qublets 0.1.3

A quantum computing library for the rest of us

Qublets

Qublets is an approachable Quantum Computing Library written in Python using Intel's intel-qs Quantum Computing Simulator. The goal of the library is to make introductory quantum computing approachable at the undergraduate (or lower) level.

Setup

If you are on Unix, the easiest way to start using qublets is by installing the pre-compiled pip module:

pip install qublets

If you don't have pip installed, it takes 30 seconds and it will make your life managing Python deps much easier:

cd ~
curl https://bootstrap.pypa.io/get-pip.py > get-pip.py
python3 get-pip.py

If you are not on Unix or don't want to install pip, you can always build from source

Getting Started

Qublets makes it easy to run simple quantum examples. Consider the classic "Superposition qubit" case:

from qublets import QUInt

result = QUInt.zeros(1).hadamard().measure()
print(result)

As you can see, Qublets aims to be as readable as possible (although you can customize quite a bit later). Running the code above will yield a 1 50% of the cases and a 0 the rest. That's it. You may also notice (most) Qublets operators are chainable and will return the object they operated on - this makes building circuits a breeze.

If you're familiar with quantum state names, you can make the above example even shorter by using a |+〉state:

from qublets import QUInt

result = QUInt.pluses(1).measure()
print(result)

You may have noticed Qublets supports integers natively - in fact, it supports both unsigned and signed integers of any given size (that your computer can work with without combusting in flames). The example above easily generalizes to a 4-bit QInt:

from qublets import QInt

result = QInt.pluses(4).measure()
print(result)

Now, you'd instead get a (mostly) uniformly random number between -8 and 7.

It wouldn't really be a quantum computing library if we didn't entangle some bits so let's do that quickly:

from qublets import QUInt

q1 = QUInt.zeros(2)
q1[0].hadamard()
q1[1].c_negate(on=q1[0])
print(q1.measure())

# Or, just like before, we can use a shortcut
print(QUInt.fully_entangled(2).measure())

If you're familiar with quantum computing's ABCs, you'd likely be happy to see only 0 and 3 as the possible values of the measurements. That's because the classic had/cnot combo will give us a perfect |Φ+〉state (a bell pair) to work with. fully_entangled, on the other hand, will always entangle all the bits in a QInt using a chain of cnots - which would be equivalent for only 2 bits.

Qublets also supports cross-q(u)int operations, built-in primitives, batch runs for your circuits, extracting probability amplitudes and more - you can find some inspirational samples in docs/examples/