Qrack
1.7
General classical-emulating-quantum development framework
|
A "Qrack::QInterface" is an abstract interface exposing qubit permutation state vector with methods to operate on it as by gates and register-like instructions. More...
#include <qinterface.hpp>
Public Member Functions | |
QInterface (bitLenInt n) | |
virtual | ~QInterface () |
Destructor of QInterface. More... | |
int | GetQubitCount () |
Get the count of bits in this register. More... | |
int | GetMaxQPower () |
Get the maximum number of basis states, namely for qubits. More... | |
virtual void | SetQuantumState (complex *inputState)=0 |
Set an arbitrary pure quantum state. More... | |
virtual void | SetPermutation (bitCapInt perm)=0 |
Set to a specific permutation. More... | |
virtual bitLenInt | Cohere (QInterfacePtr toCopy)=0 |
Combine another QInterface with this one, after the last bit index of this one. More... | |
virtual std::map< QInterfacePtr, bitLenInt > | Cohere (std::vector< QInterfacePtr > toCopy)=0 |
virtual void | Decohere (bitLenInt start, bitLenInt length, QInterfacePtr dest)=0 |
Minimally decohere a set of contiguous bits from the full coherent unit, into "destination.". More... | |
virtual void | Dispose (bitLenInt start, bitLenInt length)=0 |
Minimally decohere a set of contigious bits from the full coherent unit, throwing these qubits away. More... | |
virtual void | CCNOT (bitLenInt control1, bitLenInt control2, bitLenInt target)=0 |
Doubly-controlled NOT gate. More... | |
virtual void | AntiCCNOT (bitLenInt control1, bitLenInt control2, bitLenInt target)=0 |
Anti doubly-controlled NOT gate. More... | |
virtual void | CNOT (bitLenInt control, bitLenInt target)=0 |
Controlled NOT gate. More... | |
virtual void | AntiCNOT (bitLenInt control, bitLenInt target)=0 |
Anti controlled NOT gate. More... | |
virtual void | H (bitLenInt qubitIndex)=0 |
Hadamard gate. More... | |
virtual bool | M (bitLenInt qubitIndex)=0 |
Measurement gate. More... | |
virtual void | X (bitLenInt qubitIndex)=0 |
X gate. More... | |
virtual void | Y (bitLenInt qubitIndex)=0 |
Y gate. More... | |
virtual void | Z (bitLenInt qubitIndex)=0 |
Z gate. More... | |
virtual void | CY (bitLenInt control, bitLenInt target)=0 |
Controlled Y gate. More... | |
virtual void | CZ (bitLenInt control, bitLenInt target)=0 |
Controlled Z gate. More... | |
virtual void | AND (bitLenInt inputBit1, bitLenInt inputBit2, bitLenInt outputBit)=0 |
Quantum analog of classical "AND" gate. More... | |
virtual void | OR (bitLenInt inputBit1, bitLenInt inputBit2, bitLenInt outputBit)=0 |
Quantum analog of classical "OR" gate. More... | |
virtual void | XOR (bitLenInt inputBit1, bitLenInt inputBit2, bitLenInt outputBit)=0 |
Quantum analog of classical "XOR" gate. More... | |
virtual void | CLAND (bitLenInt inputQBit, bool inputClassicalBit, bitLenInt outputBit)=0 |
Quantum analog of classical "AND" gate. More... | |
virtual void | CLOR (bitLenInt inputQBit, bool inputClassicalBit, bitLenInt outputBit)=0 |
Quantum analog of classical "OR" gate. More... | |
virtual void | CLXOR (bitLenInt inputQBit, bool inputClassicalBit, bitLenInt outputBit)=0 |
Quantum analog of classical "XOR" gate. More... | |
virtual void | RT (double radians, bitLenInt qubitIndex)=0 |
Phase shift gate. More... | |
virtual void | RTDyad (int numerator, int denomPower, bitLenInt qubitIndex) |
Dyadic fraction phase shift gate. More... | |
virtual void | RX (double radians, bitLenInt qubitIndex)=0 |
X axis rotation gate. More... | |
virtual void | RXDyad (int numerator, int denomPower, bitLenInt qubitIndex) |
Dyadic fraction X axis rotation gate. More... | |
virtual void | CRX (double radians, bitLenInt control, bitLenInt target)=0 |
Controlled X axis rotation gate. More... | |
virtual void | CRXDyad (int numerator, int denomPower, bitLenInt control, bitLenInt target) |
Controlled dyadic fraction X axis rotation gate. More... | |
virtual void | RY (double radians, bitLenInt qubitIndex)=0 |
Y axis rotation gate. More... | |
virtual void | RYDyad (int numerator, int denomPower, bitLenInt qubitIndex) |
Dyadic fraction Y axis rotation gate. More... | |
virtual void | CRY (double radians, bitLenInt control, bitLenInt target)=0 |
Controlled Y axis rotation gate. More... | |
virtual void | CRYDyad (int numerator, int denomPower, bitLenInt control, bitLenInt target) |
Controlled dyadic fraction y axis rotation gate. More... | |
virtual void | RZ (double radians, bitLenInt qubitIndex)=0 |
Z axis rotation gate. More... | |
virtual void | RZDyad (int numerator, int denomPower, bitLenInt qubitIndex) |
Dyadic fraction Z axis rotation gate. More... | |
virtual void | CRZ (double radians, bitLenInt control, bitLenInt target)=0 |
Controlled Z axis rotation gate. More... | |
virtual void | CRZDyad (int numerator, int denomPower, bitLenInt control, bitLenInt target) |
Controlled dyadic fraction Z axis rotation gate. More... | |
virtual void | CRT (double radians, bitLenInt control, bitLenInt target)=0 |
Controlled "phase shift gate". More... | |
virtual void | CRTDyad (int numerator, int denomPower, bitLenInt control, bitLenInt target) |
Controlled dyadic fraction "phase shift gate". More... | |
virtual void | H (bitLenInt start, bitLenInt length) |
Bitwise Hadamard. More... | |
virtual void | X (bitLenInt start, bitLenInt length) |
Bitwise Pauli X (or logical "NOT") operator. More... | |
virtual void | Y (bitLenInt start, bitLenInt length) |
Bitwise Pauli Y operator. More... | |
virtual void | Z (bitLenInt start, bitLenInt length) |
Bitwise Pauli Z operator. More... | |
virtual void | CNOT (bitLenInt inputBits, bitLenInt targetBits, bitLenInt length) |
Bitwise controlled-not. More... | |
virtual void | AntiCNOT (bitLenInt inputBits, bitLenInt targetBits, bitLenInt length) |
Bitwise "anti-"controlled-not. More... | |
virtual void | CCNOT (bitLenInt control1, bitLenInt control2, bitLenInt target, bitLenInt length) |
Bitwise doubly controlled-not. More... | |
virtual void | AntiCCNOT (bitLenInt control1, bitLenInt control2, bitLenInt target, bitLenInt length) |
Bitwise doubly "anti-"controlled-not. More... | |
virtual void | AND (bitLenInt inputStart1, bitLenInt inputStart2, bitLenInt outputStart, bitLenInt length) |
Bitwise "AND". More... | |
virtual void | CLAND (bitLenInt qInputStart, bitCapInt classicalInput, bitLenInt outputStart, bitLenInt length) |
Classical bitwise "AND". More... | |
virtual void | OR (bitLenInt inputStart1, bitLenInt inputStart2, bitLenInt outputStart, bitLenInt length) |
Bitwise "OR". More... | |
virtual void | CLOR (bitLenInt qInputStart, bitCapInt classicalInput, bitLenInt outputStart, bitLenInt length) |
Classical bitwise "OR". More... | |
virtual void | XOR (bitLenInt inputStart1, bitLenInt inputStart2, bitLenInt outputStart, bitLenInt length) |
Bitwise "XOR". More... | |
virtual void | CLXOR (bitLenInt qInputStart, bitCapInt classicalInput, bitLenInt outputStart, bitLenInt length) |
Classical bitwise "XOR". More... | |
virtual void | RT (double radians, bitLenInt start, bitLenInt length) |
Bitwise phase shift gate. More... | |
virtual void | RTDyad (int numerator, int denomPower, bitLenInt start, bitLenInt length) |
Bitwise dyadic fraction phase shift gate. More... | |
virtual void | RX (double radians, bitLenInt start, bitLenInt length) |
Bitwise X axis rotation gate. More... | |
virtual void | RXDyad (int numerator, int denomPower, bitLenInt start, bitLenInt length) |
Bitwise dyadic fraction X axis rotation gate. More... | |
virtual void | CRX (double radians, bitLenInt control, bitLenInt target, bitLenInt length) |
Bitwise controlled X axis rotation gate. More... | |
virtual void | CRXDyad (int numerator, int denomPower, bitLenInt control, bitLenInt target, bitLenInt length) |
Bitwise controlled dyadic fraction X axis rotation gate. More... | |
virtual void | RY (double radians, bitLenInt start, bitLenInt length) |
Bitwise Y axis rotation gate. More... | |
virtual void | RYDyad (int numerator, int denomPower, bitLenInt start, bitLenInt length) |
Bitwise dyadic fraction Y axis rotation gate. More... | |
virtual void | CRY (double radians, bitLenInt control, bitLenInt target, bitLenInt length) |
Bitwise controlled Y axis rotation gate. More... | |
virtual void | CRYDyad (int numerator, int denomPower, bitLenInt control, bitLenInt target, bitLenInt length) |
Bitwise controlled dyadic fraction y axis rotation gate. More... | |
virtual void | RZ (double radians, bitLenInt start, bitLenInt length) |
Bitwise Z axis rotation gate. More... | |
virtual void | RZDyad (int numerator, int denomPower, bitLenInt start, bitLenInt length) |
Bitwise dyadic fraction Z axis rotation gate. More... | |
virtual void | CRZ (double radians, bitLenInt control, bitLenInt target, bitLenInt length) |
Bitwise controlled Z axis rotation gate. More... | |
virtual void | CRZDyad (int numerator, int denomPower, bitLenInt control, bitLenInt target, bitLenInt length) |
Bitwise controlled dyadic fraction Z axis rotation gate. More... | |
virtual void | CRT (double radians, bitLenInt control, bitLenInt target, bitLenInt length) |
Bitwise controlled "phase shift gate". More... | |
virtual void | CRTDyad (int numerator, int denomPower, bitLenInt control, bitLenInt target, bitLenInt length) |
Bitwise controlled dyadic fraction "phase shift gate". More... | |
virtual void | CY (bitLenInt control, bitLenInt target, bitLenInt length) |
Bitwise controlled Y gate. More... | |
virtual void | CZ (bitLenInt control, bitLenInt target, bitLenInt length) |
Bitwise controlled Z gate. More... | |
virtual void | ASL (bitLenInt shift, bitLenInt start, bitLenInt length) |
Arithmetic shift left, with last 2 bits as sign and carry. More... | |
virtual void | ASR (bitLenInt shift, bitLenInt start, bitLenInt length) |
Arithmetic shift right, with last 2 bits as sign and carry. More... | |
virtual void | LSL (bitLenInt shift, bitLenInt start, bitLenInt length) |
Logical shift left, filling the extra bits with |0> More... | |
virtual void | LSR (bitLenInt shift, bitLenInt start, bitLenInt length) |
Logical shift right, filling the extra bits with |0> More... | |
virtual void | ROL (bitLenInt shift, bitLenInt start, bitLenInt length)=0 |
Circular shift left - shift bits left, and carry last bits. More... | |
virtual void | ROR (bitLenInt shift, bitLenInt start, bitLenInt length)=0 |
Circular shift right - shift bits right, and carry first bits. More... | |
virtual void | INC (bitCapInt toAdd, bitLenInt start, bitLenInt length)=0 |
Add integer (without sign) More... | |
virtual void | INCC (bitCapInt toAdd, bitLenInt start, bitLenInt length, bitLenInt carryIndex)=0 |
Add integer (without sign, with carry) More... | |
virtual void | INCS (bitCapInt toAdd, bitLenInt start, bitLenInt length, bitLenInt overflowIndex)=0 |
Add a classical integer to the register, with sign and without carry. More... | |
virtual void | INCSC (bitCapInt toAdd, bitLenInt start, bitLenInt length, bitLenInt overflowIndex, bitLenInt carryIndex)=0 |
Add a classical integer to the register, with sign and with carry. More... | |
virtual void | INCSC (bitCapInt toAdd, bitLenInt start, bitLenInt length, bitLenInt carryIndex)=0 |
Add a classical integer to the register, with sign and with (phase-based) carry. More... | |
virtual void | INCBCD (bitCapInt toAdd, bitLenInt start, bitLenInt length)=0 |
Add classical BCD integer (without sign) More... | |
virtual void | INCBCDC (bitCapInt toAdd, bitLenInt start, bitLenInt length, bitLenInt carryIndex)=0 |
Add classical BCD integer (without sign, with carry) More... | |
virtual void | DEC (bitCapInt toSub, bitLenInt start, bitLenInt length)=0 |
Subtract classical integer (without sign) More... | |
virtual void | DECC (bitCapInt toSub, bitLenInt start, bitLenInt length, bitLenInt carryIndex)=0 |
Subtract classical integer (without sign, with carry) More... | |
virtual void | DECS (bitCapInt toAdd, bitLenInt start, bitLenInt length, bitLenInt overflowIndex)=0 |
Subtract a classical integer from the register, with sign and without carry. More... | |
virtual void | DECSC (bitCapInt toAdd, bitLenInt start, bitLenInt length, bitLenInt overflowIndex, bitLenInt carryIndex)=0 |
Subtract a classical integer from the register, with sign and with carry. More... | |
virtual void | DECSC (bitCapInt toAdd, bitLenInt start, bitLenInt length, bitLenInt carryIndex)=0 |
Subtract a classical integer from the register, with sign and with carry. More... | |
virtual void | DECBCD (bitCapInt toAdd, bitLenInt start, bitLenInt length)=0 |
Subtract BCD integer (without sign) More... | |
virtual void | DECBCDC (bitCapInt toSub, bitLenInt start, bitLenInt length, bitLenInt carryIndex)=0 |
Subtract BCD integer (without sign, with carry) More... | |
virtual void | QFT (bitLenInt start, bitLenInt length) |
Quantum Fourier Transform - Apply the quantum Fourier transform to the register. More... | |
virtual void | ZeroPhaseFlip (bitLenInt start, bitLenInt length)=0 |
Reverse the phase of the state where the register equals zero. More... | |
virtual void | CPhaseFlipIfLess (bitCapInt greaterPerm, bitLenInt start, bitLenInt length, bitLenInt flagIndex)=0 |
The 6502 uses its carry flag also as a greater-than/less-than flag, for the CMP operation. More... | |
virtual void | PhaseFlip ()=0 |
Phase flip always - equivalent to Z X Z X on any bit in the QInterface. More... | |
virtual void | SetReg (bitLenInt start, bitLenInt length, bitCapInt value)=0 |
Set register bits to given permutation. More... | |
virtual bitCapInt | MReg (bitLenInt start, bitLenInt length)=0 |
Measure permutation state of a register. More... | |
virtual bitCapInt | IndexedLDA (bitLenInt indexStart, bitLenInt indexLength, bitLenInt valueStart, bitLenInt valueLength, unsigned char *values)=0 |
Set 8 bit register bits by a superposed index-offset-based read from classical memory. More... | |
virtual bitCapInt | IndexedADC (bitLenInt indexStart, bitLenInt indexLength, bitLenInt valueStart, bitLenInt valueLength, bitLenInt carryIndex, unsigned char *values)=0 |
Add to entangled 8 bit register state with a superposed index-offset-based read from classical memory. More... | |
virtual bitCapInt | IndexedSBC (bitLenInt indexStart, bitLenInt indexLength, bitLenInt valueStart, bitLenInt valueLength, bitLenInt carryIndex, unsigned char *values)=0 |
Subtract from an entangled 8 bit register state with a superposed index-offset-based read from classical memory. More... | |
virtual void | Swap (bitLenInt qubitIndex1, bitLenInt qubitIndex2)=0 |
Swap values of two bits in register. More... | |
virtual void | Swap (bitLenInt start1, bitLenInt start2, bitLenInt length) |
Bitwise swap. More... | |
virtual void | Reverse (bitLenInt first, bitLenInt last) |
Reverse all of the bits in a sequence. More... | |
virtual void | CopyState (QInterfacePtr orig)=0 |
Direct copy of raw state vector to produce a clone. More... | |
virtual double | Prob (bitLenInt qubitIndex)=0 |
Direct measure of bit probability to be in |1> state. More... | |
virtual double | ProbAll (bitCapInt fullRegister)=0 |
Direct measure of full register probability to be in permutation state. More... | |
virtual void | SetBit (bitLenInt qubitIndex1, bool value) |
Set individual bit to pure |0> (false) or |1> (true) state. More... | |
Protected Member Functions | |
virtual void | SetQubitCount (bitLenInt qb) |
Protected Attributes | |
bitLenInt | qubitCount |
bitCapInt | maxQPower |
A "Qrack::QInterface" is an abstract interface exposing qubit permutation state vector with methods to operate on it as by gates and register-like instructions.
See README.md for an overview of the algorithms Qrack employs.
|
inline |
|
inlinevirtual |
Destructor of QInterface.
|
pure virtual |
Combine another QInterface with this one, after the last bit index of this one.
"Cohere" combines the quantum description of state of two independent QInterface objects into one object, containing the full permutation basis of the full object. The "inputState" bits are added after the last qubit index of the QInterface to which we "Cohere." Informally, "Cohere" is equivalent to "just setting another group of qubits down next to the first" without interacting them. Schroedinger's equation can form a description of state for two independent subsystems at once or "separable quantum subsystems" without interacting them. Once the description of state of the independent systems is combined, we can interact them, and we can describe their entanglements to each other, in which case they are no longer independent. A full entangled description of quantum state is not possible for two independent quantum subsystems until we "Cohere" them.
"Cohere" multiplies the probabilities of the indepedent permutation states of the two subsystems to find the probabilites of the entire set of combined permutations, by simple combinatorial reasoning. If the probablity of the "left-hand" subsystem being in |00> is 1/4, and the probablity of the "right-hand" subsystem being in |101> is 1/8, than the probability of the combined |00101> permutation state is 1/32, and so on for all permutations of the new combined state.
If the programmer doesn't want to "cheat" quantum mechanically, then the original copy of the state which is duplicated into the larger QInterface should be "thrown away" to satisfy "no clone theorem." This is not semantically enforced in Qrack, because optimization of an emulator might be acheived by "cloning" "under-the-hood" while only exposing a quantum mechanically consistent API or instruction set.
Returns the quantum bit offset that the QInterface was appended at, such that bit 5 in toCopy is equal to offset+5 in this object.
Implemented in Qrack::QEngineCPU, and Qrack::QUnit.
|
pure virtual |
Implemented in Qrack::QEngineCPU, and Qrack::QUnit.
|
pure virtual |
Minimally decohere a set of contiguous bits from the full coherent unit, into "destination.".
Minimally decohere a set of contigious bits from the full coherent unit. The length of this coherent unit is reduced by the length of bits decohered, and the bits removed are output in the destination QInterface pointer. The destination object must be initialized to the correct number of bits, in 0 permutation state. For quantum mechanical accuracy, the bit set removed and the bit set left behind should be quantum mechanically "separable."
Like how "Cohere" is like "just setting another group of qubits down next to the first," if two sets of qubits are not entangled, then "Decohere" is like "just moving a few qubits away from the rest." Schroedinger's equation does not require bits to be explicitly interacted in order to describe their permutation basis, and the descriptions of state of separable subsystems, those which are not entangled with other subsystems, are just as easily removed from the description of state.
If we have for example 5 qubits, and we wish to separate into "left" and "right" subsystems of 3 and 2 qubits, we sum probabilities of one permutation of the "left" three over ALL permutations of the "right" two, for all permutations, and vice versa, like so:
If the subsystems are not "separable," i.e. if they are entangled, this operation is not well-motivated, and its output is not necessarily defined. (The summing of probabilities over permutations of subsytems will be performed as described above, but this is not quantum mechanically meaningful.) To ensure that the subsystem is "separable," i.e. that it has no entanglements to other subsystems in the QInterface, it can be measured with M(), or else all qubits other than the subsystem can be measured.
Implemented in Qrack::QEngineCPU, and Qrack::QUnit.
Minimally decohere a set of contigious bits from the full coherent unit, throwing these qubits away.
Minimally decohere a set of contigious bits from the full coherent unit, discarding these bits. The length of this coherent unit is reduced by the length of bits decohered. For quantum mechanical accuracy, the bit set removed and the bit set left behind should be quantum mechanically "separable."
Like how "Cohere" is like "just setting another group of qubits down next to the first," if two sets of qubits are not entangled, then "Dispose" is like "just moving a few qubits away from the rest, and throwing them in the trash." Schroedinger's equation does not require bits to be explicitly interacted in order to describe their permutation basis, and the descriptions of state of separable subsystems, those which are not entangled with other subsystems, are just as easily removed from the description of state.
If we have for example 5 qubits, and we wish to separate into "left" and "right" subsystems of 3 and 2 qubits, we sum probabilities of one permutation of the "left" three over ALL permutations of the "right" two, for all permutations, and vice versa, like so:
If the subsystems are not "separable," i.e. if they are entangled, this operation is not well-motivated, and its output is not necessarily defined. (The summing of probabilities over permutations of subsytems will be performed as described above, but this is not quantum mechanically meaningful.) To ensure that the subsystem is "separable," i.e. that it has no entanglements to other subsystems in the QInterface, it can be measured with M(), or else all qubits other than the subsystem can be measured.
Implemented in Qrack::QEngineCPU, and Qrack::QUnit.
|
inline |
Get the maximum number of basis states, namely for qubits.
|
inline |
Get the count of bits in this register.
|
pure virtual |
Set to a specific permutation.
Implemented in Qrack::QEngineCPU, and Qrack::QUnit.
|
pure virtual |
Set an arbitrary pure quantum state.
Implemented in Qrack::QEngineCPU, and Qrack::QUnit.
|
inlineprotectedvirtual |
Reimplemented in Qrack::QUnit.
|
protected |
|
protected |