#include <qstabilizer.hpp>

Inheritance diagram for Qrack::QStabilizer:

Collaboration diagram for Qrack::QStabilizer:

[legend]

Public Member Functions
	QStabilizer (bitLenInt n, bitCapInt perm=0U, qrack_rand_gen_ptr rgp=nullptr, complex phaseFac=CMPLX_DEFAULT_ARG, bool doNorm=false, bool randomGlobalPhase=true, bool ignored2=false, int64_t ignored3=-1, bool useHardwareRNG=true, bool ignored4=false, real1_f ignored5=REAL1_EPSILON, std::vector< int64_t > ignored6={}, bitLenInt ignored7=0U, real1_f ignored8=FP_NORM_EPSILON_F)

	~QStabilizer ()

QInterfacePtr	Clone ()
	Clone this QInterface. More...

QStabilizerPtr	CloneEmpty ()

bool	isClifford ()
	Returns "true" if current state is identifiably within the Clifford set, or "false" if it is not or cannot be determined. More...

bool	isClifford (bitLenInt qubit)
	Returns "true" if current qubit state is identifiably within the Clifford set, or "false" if it is not or cannot be determined. More...

bitLenInt	GetQubitCount ()
	Get the count of bits in this register. More...

bitCapInt	GetMaxQPower ()
	Get the maximum number of basis states, namely \( 2^n \) for \( n \) qubits. More...

void	ResetPhaseOffset ()

complex	GetPhaseOffset ()

void	SetPermutation (bitCapInt perm, complex phaseFac=CMPLX_DEFAULT_ARG)
	Set to a specific permutation of all qubits. More...

void	SetRandomSeed (uint32_t seed)

void	SetDevice (int64_t dID)
	Set the device index, if more than one device is available. More...

bool	Rand ()

void	Clear ()

bitLenInt	gaussian ()
	Do Gaussian elimination to put the stabilizer generators in the following form: At the top, a minimal set of generators containing X's and Y's, in "quasi-upper-triangular" form. More...

bitCapInt	PermCount ()

void	SetQuantumState (const complex *inputState)
	Set an arbitrary pure quantum state representation. More...

void	SetAmplitude (bitCapInt perm, complex amp)
	Sets the representational amplitude of a full permutation. More...

void	SetRandGlobalPhase (bool isRand)

void	CNOT (bitLenInt control, bitLenInt target)
	Apply a CNOT gate with control and target. More...

void	CY (bitLenInt control, bitLenInt target)
	Apply a CY gate with control and target. More...

void	CZ (bitLenInt control, bitLenInt target)
	Apply a CZ gate with control and target. More...

void	AntiCNOT (bitLenInt control, bitLenInt target)
	Apply an (anti-)CNOT gate with control and target. More...

void	AntiCY (bitLenInt control, bitLenInt target)
	Apply an (anti-)CY gate with control and target. More...

void	AntiCZ (bitLenInt control, bitLenInt target)
	Apply an (anti-)CZ gate with control and target. More...

void	H (bitLenInt qubitIndex)
	Apply a Hadamard gate to target. More...

void	X (bitLenInt qubitIndex)
	Apply an X (or NOT) gate to target. More...

void	Y (bitLenInt qubitIndex)
	Apply a Pauli Y gate to target. More...

void	Z (bitLenInt qubitIndex)
	Apply a phase gate (\|0>->\|0>, \|1>->-\|1>, or "Z") to qubit b. More...

void	S (bitLenInt qubitIndex)
	Apply a phase gate (\|0>->\|0>, \|1>->i\|1>, or "S") to qubit b. More...

void	IS (bitLenInt qubitIndex)
	Apply an inverse phase gate (\|0>->\|0>, \|1>->-i\|1>, or "S adjoint") to qubit b. More...

void	Swap (bitLenInt qubitIndex1, bitLenInt qubitIndex2)
	Swap values of two bits in register. More...

void	ISwap (bitLenInt qubitIndex1, bitLenInt qubitIndex2)
	Swap values of two bits in register, and apply phase factor of i if bits are different. More...

void	IISwap (bitLenInt qubitIndex1, bitLenInt qubitIndex2)
	Inverse ISwap - Swap values of two bits in register, and apply phase factor of -i if bits are different. More...

bool	ForceM (bitLenInt t, bool result, bool doForce=true, bool doApply=true)
	Measure qubit t. More...

void	GetQuantumState (complex *stateVec)
	Convert the state to ket notation. More...

void	GetQuantumState (QInterfacePtr eng)
	Convert the state to ket notation, directly into another QInterface. More...

std::map< bitCapInt, complex >	GetQuantumState ()
	Convert the state to sparse ket notation. More...

void	GetProbs (real1 *outputProbs)
	Get all probabilities corresponding to ket notation. More...

complex	GetAmplitude (bitCapInt perm)
	Get a single basis state amplitude. More...

std::vector< complex >	GetAmplitudes (std::vector< bitCapInt > perms)
	Get a single basis state amplitude. More...

AmplitudeEntry	GetAnyAmplitude ()
	Get any single basis state amplitude. More...

AmplitudeEntry	GetQubitAmplitude (bitLenInt t, bool m)
	Get any single basis state amplitude where qubit "t" has value "m". More...

real1_f	ExpectationBitsFactorized (const std::vector< bitLenInt > &bits, const std::vector< bitCapInt > &perms, bitCapInt offset=0U)
	Get expectation qubits, interpreting each permutation as an unsigned integer. More...

real1_f	ExpectationFloatsFactorized (const std::vector< bitLenInt > &bits, const std::vector< real1_f > &weights)
	Get expectation qubits, interpreting each permutation as a floating-point value. More...

real1_f	ProbPermRdm (bitCapInt perm, bitLenInt ancillaeStart)
	Under assumption of a QStabilizerHybrid ancillary buffer, trace out the permutation probability of the reduced density matrx without ancillae. More...

real1_f	ProbMask (bitCapInt mask, bitCapInt permutation)
	Direct measure of masked permutation probability. More...

bool	IsSeparableZ (const bitLenInt &target)
	Returns "true" if target qubit is a Z basis eigenstate. More...

bool	IsSeparableX (const bitLenInt &target)
	Returns "true" if target qubit is an X basis eigenstate. More...

bool	IsSeparableY (const bitLenInt &target)
	Returns "true" if target qubit is a Y basis eigenstate. More...

uint8_t	IsSeparable (const bitLenInt &target)
	Returns: 0 if target qubit is not separable 1 if target qubit is a Z basis eigenstate 2 if target qubit is an X basis eigenstate 3 if target qubit is a Y basis eigenstate. More...

bitLenInt	Compose (QInterfacePtr toCopy)
	Combine another QInterface with this one, after the last bit index of this one. More...

bitLenInt	Compose (QStabilizerPtr toCopy)

bitLenInt	Compose (QInterfacePtr toCopy, bitLenInt start)

bitLenInt	Compose (QStabilizerPtr toCopy, bitLenInt start)

void	Decompose (bitLenInt start, QInterfacePtr dest)
	Minimally decompose a set of contiguous bits from the separably composed unit, into "destination". More...

QInterfacePtr	Decompose (bitLenInt start, bitLenInt length)
	Schmidt decompose a length of qubits. More...

void	Dispose (bitLenInt start, bitLenInt length)
	Minimally decompose a set of contiguous bits from the separably composed unit, and discard the separable bits from index "start" for "length.". More...

void	Dispose (bitLenInt start, bitLenInt length, bitCapInt ignored)
	Dispose a a contiguous set of qubits that are already in a permutation eigenstate. More...

bool	CanDecomposeDispose (const bitLenInt start, const bitLenInt length)

bitLenInt	Allocate (bitLenInt start, bitLenInt length)
	Allocate new "length" count of \|0> state qubits at specified qubit index start position. More...

void	NormalizeState (real1_f nrm=REAL1_DEFAULT_ARG, real1_f norm_thresh=REAL1_DEFAULT_ARG, real1_f phaseArg=ZERO_R1_F)
	Apply the normalization factor found by UpdateRunningNorm() or on the fly by a single bit gate. More...

void	UpdateRunningNorm (real1_f norm_thresh=REAL1_DEFAULT_ARG)
	Force a calculation of the norm of the state vector, in order to make it unit length before the next probability or measurement operation. More...

real1_f	SumSqrDiff (QInterfacePtr toCompare)

bool	ApproxCompare (QInterfacePtr toCompare, real1_f error_tol=TRYDECOMPOSE_EPSILON)
	Compare state vectors approximately, component by component, to determine whether this state vector is the same as the target. More...

bool	ApproxCompare (QStabilizerPtr toCompare, real1_f error_tol=TRYDECOMPOSE_EPSILON)

bool	GlobalPhaseCompare (QInterfacePtr toCompare, real1_f error_tol=TRYDECOMPOSE_EPSILON)

bool	GlobalPhaseCompare (QStabilizerPtr toCompare, real1_f error_tol=TRYDECOMPOSE_EPSILON)

real1_f	Prob (bitLenInt qubit)
	Direct measure of bit probability to be in \|1> state. More...

void	Mtrx (const complex *mtrx, bitLenInt target)
	Apply an arbitrary single bit unitary transformation. More...

void	Phase (complex topLeft, complex bottomRight, bitLenInt target)
	Apply a single bit transformation that only effects phase. More...

void	Invert (complex topRight, complex bottomLeft, bitLenInt target)
	Apply a single bit transformation that reverses bit probability and might effect phase. More...

void	MCPhase (const std::vector< bitLenInt > &controls, complex topLeft, complex bottomRight, bitLenInt target)
	Apply a single bit transformation that only effects phase, with arbitrary control bits. More...

void	MACPhase (const std::vector< bitLenInt > &controls, complex topLeft, complex bottomRight, bitLenInt target)
	Apply a single bit transformation that only effects phase, with arbitrary (anti-)control bits. More...

void	MCInvert (const std::vector< bitLenInt > &controls, complex topRight, complex bottomLeft, bitLenInt target)
	Apply a single bit transformation that reverses bit probability and might effect phase, with arbitrary control bits. More...

void	MACInvert (const std::vector< bitLenInt > &controls, complex topRight, complex bottomLeft, bitLenInt target)
	Apply a single bit transformation that reverses bit probability and might effect phase, with arbitrary (anti-)control bits. More...

void	MCMtrx (const std::vector< bitLenInt > &controls, const complex *mtrx, bitLenInt target)
	Apply an arbitrary single bit unitary transformation, with arbitrary control bits. More...

void	MACMtrx (const std::vector< bitLenInt > &controls, const complex *mtrx, bitLenInt target)
	Apply an arbitrary single bit unitary transformation, with arbitrary (anti-)control bits. More...

void	FSim (real1_f theta, real1_f phi, bitLenInt qubit1, bitLenInt qubit2)
	The 2-qubit "fSim" gate, (useful in the simulation of particles with fermionic statistics) More...

bool	TrySeparate (const std::vector< bitLenInt > &qubits, real1_f ignored)
	Qrack::QUnit types maintain explicit separation of representations of qubits, which reduces memory usage and increases gate speed. More...

bool	TrySeparate (bitLenInt qubit)
	Single-qubit TrySeparate() More...

bool	TrySeparate (bitLenInt qubit1, bitLenInt qubit2)
	Two-qubit TrySeparate() More...

virtual void	H (bitLenInt qubit)
	Apply a Hadamard gate to target. More...

virtual void	H (bitLenInt start, bitLenInt length)
	Apply a Hadamard gate to target. More...

virtual void	X (bitLenInt qubit)
	Apply an X (or NOT) gate to target. More...

virtual void	X (bitLenInt start, bitLenInt length)
	Apply an X (or NOT) gate to target. More...

virtual bitLenInt	Compose (QInterfacePtr toCopy)
	Combine another QInterface with this one, after the last bit index of this one. More...

virtual std::map< QInterfacePtr, bitLenInt >	Compose (std::vector< QInterfacePtr > toCopy)

virtual bitLenInt	Compose (QInterfacePtr toCopy, bitLenInt start)

virtual bitLenInt	Allocate (bitLenInt length)
	Allocate new "length" count of \|0> state qubits at end of qubit index position. More...

virtual bitLenInt	Allocate (bitLenInt start, bitLenInt length)=0
	Allocate new "length" count of \|0> state qubits at specified qubit index start position. More...

Public Member Functions inherited from Qrack::QInterface
	QInterface (bitLenInt n, qrack_rand_gen_ptr rgp=nullptr, bool doNorm=false, bool useHardwareRNG=true, bool randomGlobalPhase=true, real1_f norm_thresh=REAL1_EPSILON)

	QInterface ()
	Default constructor, primarily for protected internal use. More...

virtual	~QInterface ()

void	SetRandomSeed (uint32_t seed)

virtual void	SetConcurrency (uint32_t threadsPerEngine)
	Set the number of threads in parallel for loops, per component QEngine. More...

virtual bool	GetIsArbitraryGlobalPhase ()

real1_f	Rand ()
	Generate a random real number between 0 and 1. More...

virtual bitLenInt	ComposeNoClone (QInterfacePtr toCopy)

virtual std::map< QInterfacePtr, bitLenInt >	Compose (std::vector< QInterfacePtr > toCopy)

virtual bitLenInt	Allocate (bitLenInt length)
	Allocate new "length" count of \|0> state qubits at end of qubit index position. More...

virtual void	UCMtrx (const std::vector< bitLenInt > &controls, const complex *mtrx, bitLenInt target, bitCapInt controlPerm)
	Apply an arbitrary single bit unitary transformation, with arbitrary control bits, with arbitary control permutation. More...

virtual void	UCPhase (const std::vector< bitLenInt > &controls, complex topLeft, complex bottomRight, bitLenInt target, bitCapInt perm)
	Apply a single bit transformation that only effects phase, with arbitrary control bits, with arbitrary control permutation. More...

virtual void	UCInvert (const std::vector< bitLenInt > &controls, complex topRight, complex bottomLeft, bitLenInt target, bitCapInt perm)
	Apply a single bit transformation that reverses bit probability and might effect phase, with arbitrary control bits, with arbitrary control permutation. More...

virtual void	UniformlyControlledSingleBit (const std::vector< bitLenInt > &controls, bitLenInt qubitIndex, const complex *mtrxs)
	Apply a "uniformly controlled" arbitrary single bit unitary transformation. More...

virtual void	UniformlyControlledSingleBit (const std::vector< bitLenInt > &controls, bitLenInt qubitIndex, const complex *mtrxs, const std::vector< bitCapInt > &mtrxSkipPowers, bitCapInt mtrxSkipValueMask)

virtual void	TimeEvolve (Hamiltonian h, real1_f timeDiff)
	To define a Hamiltonian, give a vector of controlled single bit gates ("HamiltonianOp" instances) that are applied by left-multiplication in low-to-high vector index order on the state vector. More...

virtual void	CSwap (const std::vector< bitLenInt > &controls, bitLenInt qubit1, bitLenInt qubit2)
	Apply a swap with arbitrary control bits. More...

virtual void	AntiCSwap (const std::vector< bitLenInt > &controls, bitLenInt qubit1, bitLenInt qubit2)
	Apply a swap with arbitrary (anti) control bits. More...

virtual void	CSqrtSwap (const std::vector< bitLenInt > &controls, bitLenInt qubit1, bitLenInt qubit2)
	Apply a square root of swap with arbitrary control bits. More...

virtual void	AntiCSqrtSwap (const std::vector< bitLenInt > &controls, bitLenInt qubit1, bitLenInt qubit2)
	Apply a square root of swap with arbitrary (anti) control bits. More...

virtual void	CISqrtSwap (const std::vector< bitLenInt > &controls, bitLenInt qubit1, bitLenInt qubit2)
	Apply an inverse square root of swap with arbitrary control bits. More...

virtual void	AntiCISqrtSwap (const std::vector< bitLenInt > &controls, bitLenInt qubit1, bitLenInt qubit2)
	Apply an inverse square root of swap with arbitrary (anti) control bits. More...

virtual void	CCNOT (bitLenInt control1, bitLenInt control2, bitLenInt target)
	Doubly-controlled NOT gate. More...

virtual void	AntiCCNOT (bitLenInt control1, bitLenInt control2, bitLenInt target)
	Anti doubly-controlled NOT gate. More...

virtual void	CCY (bitLenInt control1, bitLenInt control2, bitLenInt target)
	Doubly-Controlled Y gate. More...

virtual void	AntiCCY (bitLenInt control1, bitLenInt control2, bitLenInt target)
	Anti doubly-controlled Y gate. More...

virtual void	CCZ (bitLenInt control1, bitLenInt control2, bitLenInt target)
	Doubly-Controlled Z gate. More...

virtual void	AntiCCZ (bitLenInt control1, bitLenInt control2, bitLenInt target)
	Anti doubly-controlled Z gate. More...

virtual void	U (bitLenInt target, real1_f theta, real1_f phi, real1_f lambda)
	General unitary gate. More...

virtual void	U2 (bitLenInt target, real1_f phi, real1_f lambda)
	2-parameter unitary gate More...

virtual void	IU2 (bitLenInt target, real1_f phi, real1_f lambda)
	Inverse 2-parameter unitary gate. More...

virtual void	AI (bitLenInt target, real1_f azimuth, real1_f inclination)
	"Azimuth, Inclination" (RY-RZ) More...

virtual void	IAI (bitLenInt target, real1_f azimuth, real1_f inclination)
	Invert "Azimuth, Inclination" (RY-RZ) More...

virtual void	CAI (bitLenInt control, bitLenInt target, real1_f azimuth, real1_f inclination)
	Controlled "Azimuth, Inclination" (RY-RZ) More...

virtual void	AntiCAI (bitLenInt control, bitLenInt target, real1_f azimuth, real1_f inclination)
	(Anti-)Controlled "Azimuth, Inclination" (RY-RZ) More...

virtual void	CIAI (bitLenInt control, bitLenInt target, real1_f azimuth, real1_f inclination)
	Controlled inverse "Azimuth, Inclination" (RY-RZ) More...

virtual void	AntiCIAI (bitLenInt control, bitLenInt target, real1_f azimuth, real1_f inclination)
	(Anti-)Controlled inverse "Azimuth, Inclination" (RY-RZ) More...

virtual void	CU (const std::vector< bitLenInt > &controls, bitLenInt target, real1_f theta, real1_f phi, real1_f lambda)
	Controlled general unitary gate. More...

virtual void	AntiCU (const std::vector< bitLenInt > &controls, bitLenInt target, real1_f theta, real1_f phi, real1_f lambda)
	(Anti-)Controlled general unitary gate More...

virtual void	SqrtH (bitLenInt qubit)
	Square root of Hadamard gate. More...

virtual void	SH (bitLenInt qubit)
	Y-basis transformation gate. More...

virtual void	HIS (bitLenInt qubit)
	Y-basis (inverse) transformation gate. More...

virtual bool	M (bitLenInt qubitIndex)
	Measurement gate. More...

virtual void	T (bitLenInt qubit)
	T gate. More...

virtual void	IT (bitLenInt qubit)
	Inverse T gate. More...

virtual void	PhaseRootN (bitLenInt n, bitLenInt qubit)
	"PhaseRootN" gate More...

virtual void	IPhaseRootN (bitLenInt n, bitLenInt qubit)
	Inverse "PhaseRootN" gate. More...

virtual void	PhaseParity (real1_f radians, bitCapInt mask)
	Parity phase gate. More...

virtual void	XMask (bitCapInt mask)
	Masked X gate. More...

virtual void	YMask (bitCapInt mask)
	Masked Y gate. More...

virtual void	ZMask (bitCapInt mask)
	Masked Z gate. More...

virtual void	SqrtX (bitLenInt qubit)
	Square root of X gate. More...

virtual void	ISqrtX (bitLenInt qubit)
	Inverse square root of X gate. More...

virtual void	SqrtY (bitLenInt qubit)
	Square root of Y gate. More...

virtual void	ISqrtY (bitLenInt qubit)
	Inverse square root of Y gate. More...

virtual void	SqrtW (bitLenInt qubit)
	Square root of W gate. More...

virtual void	ISqrtW (bitLenInt qubit)
	Inverse square root of W gate. More...

virtual void	CH (bitLenInt control, bitLenInt target)
	Controlled H gate. More...

virtual void	AntiCH (bitLenInt control, bitLenInt target)
	(Anti-)controlled H gate More...

virtual void	CS (bitLenInt control, bitLenInt target)
	Controlled S gate. More...

virtual void	AntiCS (bitLenInt control, bitLenInt target)
	(Anti-)controlled S gate More...

virtual void	CIS (bitLenInt control, bitLenInt target)
	Controlled inverse S gate. More...

virtual void	AntiCIS (bitLenInt control, bitLenInt target)
	(Anti-)controlled inverse S gate More...

virtual void	CT (bitLenInt control, bitLenInt target)
	Controlled T gate. More...

virtual void	CIT (bitLenInt control, bitLenInt target)
	Controlled inverse T gate. More...

virtual void	CPhaseRootN (bitLenInt n, bitLenInt control, bitLenInt target)
	Controlled "PhaseRootN" gate. More...

virtual void	AntiCPhaseRootN (bitLenInt n, bitLenInt control, bitLenInt target)
	(Anti-)controlled "PhaseRootN" gate More...

virtual void	CIPhaseRootN (bitLenInt n, bitLenInt control, bitLenInt target)
	Controlled inverse "PhaseRootN" gate. More...

virtual void	AntiCIPhaseRootN (bitLenInt n, bitLenInt control, bitLenInt target)
	(Anti-)controlled inverse "PhaseRootN" gate More...

virtual void	AND (bitLenInt inputBit1, bitLenInt inputBit2, bitLenInt outputBit)
	Quantum analog of classical "AND" gate. More...

virtual void	OR (bitLenInt inputBit1, bitLenInt inputBit2, bitLenInt outputBit)
	Quantum analog of classical "OR" gate. More...

virtual void	XOR (bitLenInt inputBit1, bitLenInt inputBit2, bitLenInt outputBit)
	Quantum analog of classical "XOR" gate. More...

virtual void	CLAND (bitLenInt inputQBit, bool inputClassicalBit, bitLenInt outputBit)
	Quantum analog of classical "AND" gate. More...

virtual void	CLOR (bitLenInt inputQBit, bool inputClassicalBit, bitLenInt outputBit)
	Quantum analog of classical "OR" gate. More...

virtual void	CLXOR (bitLenInt inputQBit, bool inputClassicalBit, bitLenInt outputBit)
	Quantum analog of classical "XOR" gate. More...

virtual void	NAND (bitLenInt inputBit1, bitLenInt inputBit2, bitLenInt outputBit)
	Quantum analog of classical "NAND" gate. More...

virtual void	NOR (bitLenInt inputBit1, bitLenInt inputBit2, bitLenInt outputBit)
	Quantum analog of classical "NOR" gate. More...

virtual void	XNOR (bitLenInt inputBit1, bitLenInt inputBit2, bitLenInt outputBit)
	Quantum analog of classical "XNOR" gate. More...

virtual void	CLNAND (bitLenInt inputQBit, bool inputClassicalBit, bitLenInt outputBit)
	Quantum analog of classical "NAND" gate. More...

virtual void	CLNOR (bitLenInt inputQBit, bool inputClassicalBit, bitLenInt outputBit)
	Quantum analog of classical "NOR" gate. More...

virtual void	CLXNOR (bitLenInt inputQBit, bool inputClassicalBit, bitLenInt outputBit)
	Quantum analog of classical "XNOR" gate. More...

virtual void	UniformlyControlledRY (const std::vector< bitLenInt > &controls, bitLenInt qubitIndex, real1 const *angles)
	Apply a "uniformly controlled" rotation of a bit around the Pauli Y axis. More...

virtual void	UniformlyControlledRZ (const std::vector< bitLenInt > &controls, bitLenInt qubitIndex, real1 const *angles)
	Apply a "uniformly controlled" rotation of a bit around the Pauli Z axis. More...

virtual void	RT (real1_f radians, bitLenInt qubitIndex)
	Phase shift gate. More...

virtual void	RX (real1_f radians, bitLenInt qubitIndex)
	X axis rotation gate. More...

virtual void	RY (real1_f radians, bitLenInt qubitIndex)
	Y axis rotation gate. More...

virtual void	RZ (real1_f radians, bitLenInt qubitIndex)
	Z axis rotation gate. More...

virtual void	CRZ (real1_f radians, bitLenInt control, bitLenInt target)
	Controlled Z axis rotation gate. More...

virtual void	CRY (real1_f radians, bitLenInt control, bitLenInt target)
	Controlled Y axis rotation gate. More...

virtual void	RTDyad (int numerator, int denomPower, bitLenInt qubitIndex)
	Dyadic fraction phase shift gate. More...

virtual void	RXDyad (int numerator, int denomPower, bitLenInt qubitIndex)
	Dyadic fraction X axis rotation gate. More...

virtual void	Exp (real1_f radians, bitLenInt qubitIndex)
	(Identity) Exponentiation gate More...

virtual void	Exp (const std::vector< bitLenInt > &controls, bitLenInt qubit, const complex *matrix2x2, bool antiCtrled=false)
	Imaginary exponentiation of arbitrary 2x2 gate. More...

virtual void	ExpDyad (int numerator, int denomPower, bitLenInt qubitIndex)
	Dyadic fraction (identity) exponentiation gate. More...

virtual void	ExpX (real1_f radians, bitLenInt qubitIndex)
	Pauli X exponentiation gate. More...

virtual void	ExpXDyad (int numerator, int denomPower, bitLenInt qubitIndex)
	Dyadic fraction Pauli X exponentiation gate. More...

virtual void	ExpY (real1_f radians, bitLenInt qubitIndex)
	Pauli Y exponentiation gate. More...

virtual void	ExpYDyad (int numerator, int denomPower, bitLenInt qubitIndex)
	Dyadic fraction Pauli Y exponentiation gate. More...

virtual void	ExpZ (real1_f radians, bitLenInt qubitIndex)
	Pauli Z exponentiation gate. More...

virtual void	ExpZDyad (int numerator, int denomPower, bitLenInt qubitIndex)
	Dyadic fraction Pauli Z exponentiation gate. More...

virtual void	CRX (real1_f radians, bitLenInt control, bitLenInt target)
	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	RYDyad (int numerator, int denomPower, bitLenInt qubitIndex)
	Dyadic fraction 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	RZDyad (int numerator, int denomPower, bitLenInt qubitIndex)
	Dyadic fraction 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 (real1_f radians, bitLenInt control, bitLenInt target)
	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	ROL (bitLenInt shift, bitLenInt start, bitLenInt length)
	Circular shift left - shift bits left, and carry last bits. More...

virtual void	ROR (bitLenInt shift, bitLenInt start, bitLenInt length)
	Circular shift right - shift bits right, and carry first bits. 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	INCDECC (bitCapInt toAdd, bitLenInt start, bitLenInt length, bitLenInt carryIndex)
	Common driver method behind INCC and DECC. More...

virtual void	INCC (bitCapInt toAdd, bitLenInt start, bitLenInt length, bitLenInt carryIndex)
	Add integer (without sign, with carry) More...

virtual void	DECC (bitCapInt toSub, bitLenInt start, bitLenInt length, bitLenInt carryIndex)
	Subtract classical integer (without sign, with carry) More...

virtual void	INC (bitCapInt toAdd, bitLenInt start, bitLenInt length)
	Add integer (without sign) More...

virtual void	CINC (bitCapInt toAdd, bitLenInt inOutStart, bitLenInt length, const std::vector< bitLenInt > &controls)
	Add integer (without sign, with controls) More...

virtual void	INCS (bitCapInt toAdd, bitLenInt start, bitLenInt length, bitLenInt overflowIndex)
	Add a classical integer to the register, with sign and without carry. More...

virtual void	DEC (bitCapInt toSub, bitLenInt start, bitLenInt length)
	Subtract classical integer (without sign) More...

virtual void	CDEC (bitCapInt toSub, bitLenInt inOutStart, bitLenInt length, const std::vector< bitLenInt > &controls)
	Subtract classical integer (without sign, with controls) More...

virtual void	DECS (bitCapInt toSub, bitLenInt start, bitLenInt length, bitLenInt overflowIndex)
	Subtract a classical integer from the register, with sign and without carry. More...

virtual void	MULModNOut (bitCapInt toMul, bitCapInt modN, bitLenInt inStart, bitLenInt outStart, bitLenInt length)
	Multiplication modulo N by integer, (out of place) More...

virtual void	IMULModNOut (bitCapInt toMul, bitCapInt modN, bitLenInt inStart, bitLenInt outStart, bitLenInt length)
	Inverse of multiplication modulo N by integer, (out of place) More...

virtual void	CMULModNOut (bitCapInt toMul, bitCapInt modN, bitLenInt inStart, bitLenInt outStart, bitLenInt length, const std::vector< bitLenInt > &controls)
	Controlled multiplication modulo N by integer, (out of place) More...

virtual void	CIMULModNOut (bitCapInt toMul, bitCapInt modN, bitLenInt inStart, bitLenInt outStart, bitLenInt length, const std::vector< bitLenInt > &controls)
	Inverse of controlled multiplication modulo N by integer, (out of place) More...

virtual void	FullAdd (bitLenInt inputBit1, bitLenInt inputBit2, bitLenInt carryInSumOut, bitLenInt carryOut)
	Quantum analog of classical "Full Adder" gate. More...

virtual void	IFullAdd (bitLenInt inputBit1, bitLenInt inputBit2, bitLenInt carryInSumOut, bitLenInt carryOut)
	Inverse of FullAdd. More...

virtual void	CFullAdd (const std::vector< bitLenInt > &controls, bitLenInt inputBit1, bitLenInt inputBit2, bitLenInt carryInSumOut, bitLenInt carryOut)
	Controlled quantum analog of classical "Full Adder" gate. More...

virtual void	CIFullAdd (const std::vector< bitLenInt > &controls, bitLenInt inputBit1, bitLenInt inputBit2, bitLenInt carryInSumOut, bitLenInt carryOut)
	Inverse of CFullAdd. More...

virtual void	ADC (bitLenInt input1, bitLenInt input2, bitLenInt output, bitLenInt length, bitLenInt carry)
	Add a quantum integer to a quantum integer, with carry. More...

virtual void	IADC (bitLenInt input1, bitLenInt input2, bitLenInt output, bitLenInt length, bitLenInt carry)
	Inverse of ADC. More...

virtual void	CADC (const std::vector< bitLenInt > &controls, bitLenInt input1, bitLenInt input2, bitLenInt output, bitLenInt length, bitLenInt carry)
	Add a quantum integer to a quantum integer, with carry and with controls. More...

virtual void	CIADC (const std::vector< bitLenInt > &controls, bitLenInt input1, bitLenInt input2, bitLenInt output, bitLenInt length, bitLenInt carry)
	Inverse of CADC. More...

virtual void	QFT (bitLenInt start, bitLenInt length, bool trySeparate=false)
	Quantum Fourier Transform - Apply the quantum Fourier transform to the register. More...

virtual void	QFTR (const std::vector< bitLenInt > &qubits, bool trySeparate=false)
	Quantum Fourier Transform (random access) - Apply the quantum Fourier transform to the register. More...

virtual void	IQFT (bitLenInt start, bitLenInt length, bool trySeparate=false)
	Inverse Quantum Fourier Transform - Apply the inverse quantum Fourier transform to the register. More...

virtual void	IQFTR (const std::vector< bitLenInt > &qubits, bool trySeparate=false)
	Inverse Quantum Fourier Transform (random access) - Apply the inverse quantum Fourier transform to the register. More...

virtual void	ZeroPhaseFlip (bitLenInt start, bitLenInt length)
	Reverse the phase of the state where the register equals zero. More...

virtual void	PhaseFlip ()
	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)
	Set register bits to given permutation. More...

virtual bitCapInt	MReg (bitLenInt start, bitLenInt length)
	Measure permutation state of a register. More...

virtual bitCapInt	MAll ()
	Measure permutation state of all coherent bits. More...

virtual bitCapInt	ForceMReg (bitLenInt start, bitLenInt length, bitCapInt result, bool doForce=true, bool doApply=true)
	Act as if is a measurement was applied, except force the (usually random) result. More...

virtual bitCapInt	M (const std::vector< bitLenInt > &bits)
	Measure bits with indices in array, and return a mask of the results. More...

virtual bitCapInt	ForceM (const std::vector< bitLenInt > &bits, const std::vector< bool > &values, bool doApply=true)
	Measure bits with indices in array, and return a mask of the results. More...

virtual void	SqrtSwap (bitLenInt qubitIndex1, bitLenInt qubitIndex2)
	Square root of Swap gate. More...

virtual void	ISqrtSwap (bitLenInt qubitIndex1, bitLenInt qubitIndex2)
	Inverse square root of Swap gate. More...

virtual void	Reverse (bitLenInt first, bitLenInt last)
	Reverse all of the bits in a sequence. More...

virtual real1_f	CProb (bitLenInt control, bitLenInt target)
	Direct measure of bit probability to be in \|1> state, if control bit is \|1>. More...

virtual real1_f	ACProb (bitLenInt control, bitLenInt target)
	Direct measure of bit probability to be in \|1> state, if control bit is \|0>. More...

virtual real1_f	ProbAll (bitCapInt fullRegister)
	Direct measure of full permutation probability. More...

virtual real1_f	ProbReg (bitLenInt start, bitLenInt length, bitCapInt permutation)
	Direct measure of register permutation probability. More...

virtual void	ProbMaskAll (bitCapInt mask, real1 *probsArray)
	Direct measure of masked permutation probability. More...

virtual void	ProbBitsAll (const std::vector< bitLenInt > &bits, real1 *probsArray)
	Direct measure of listed permutation probability. More...

virtual real1_f	ExpectationBitsAll (const std::vector< bitLenInt > &bits, bitCapInt offset=0U)
	Get permutation expectation value of bits. More...

virtual real1_f	ExpectationBitsFactorizedRdm (bool roundRz, const std::vector< bitLenInt > &bits, const std::vector< bitCapInt > &perms, bitCapInt offset=0)
	Get (reduced density matrix) expectation value of bits, given an array of qubit weights. More...

virtual real1_f	ExpectationFloatsFactorizedRdm (bool roundRz, const std::vector< bitLenInt > &bits, const std::vector< real1_f > &weights)
	Get (reduced density matrix) expectation value of bits, given a (floating-point) array of qubit weights. More...

virtual real1_f	ProbRdm (bitLenInt qubitIndex)
	Direct measure of bit probability to be in \|1> state, treating all ancillary qubits as post-selected T gate gadgets. More...

virtual real1_f	ProbAllRdm (bool roundRz, bitCapInt fullRegister)
	Direct measure of full permutation probability, treating all ancillary qubits as post-selected T gate gadgets. More...

virtual real1_f	ProbMaskRdm (bool roundRz, bitCapInt mask, bitCapInt permutation)
	Direct measure of masked permutation probability, treating all ancillary qubits as post-selected T gate gadgets. More...

virtual real1_f	ExpectationBitsAllRdm (bool roundRz, const std::vector< bitLenInt > &bits, bitCapInt offset=0U)
	Get permutation expectation value of bits, treating all ancillary qubits as post-selected T gate gadgets. More...

virtual std::map< bitCapInt, int >	MultiShotMeasureMask (const std::vector< bitCapInt > &qPowers, unsigned shots)
	Statistical measure of masked permutation probability. More...

virtual void	MultiShotMeasureMask (const std::vector< bitCapInt > &qPowers, unsigned shots, unsigned long long *shotsArray)
	Statistical measure of masked permutation probability (returned as array) More...

virtual void	SetBit (bitLenInt qubit, bool value)
	Set individual bit to pure \|0> (false) or \|1> (true) state. More...

virtual bool	TryDecompose (bitLenInt start, QInterfacePtr dest, real1_f error_tol=TRYDECOMPOSE_EPSILON)

virtual void	Finish ()
	If asynchronous work is still running, block until it finishes. More...

virtual bool	isFinished ()
	Returns "false" if asynchronous work is still running, and "true" if all previously dispatched asynchronous work is done. More...

virtual void	Dump ()
	If asynchronous work is still running, let the simulator know that it can be aborted. More...

virtual bool	isBinaryDecisionTree ()
	Returns "true" if current state representation is definitely a binary decision tree, "false" if it is definitely not, or "true" if it cannot be determined. More...

virtual bool	isOpenCL ()
	Returns "true" if current simulation is OpenCL-based. More...

virtual double	GetUnitaryFidelity ()
	When "Schmidt-decomposition rounding parameter" ("SDRP") is being used, starting from initial 1.0 fidelity, we compound the "unitary fidelity" by successive multiplication by one minus two times the true unitary probability discarded in each single rounding event. More...

virtual void	ResetUnitaryFidelity ()
	Reset the internal fidelity calculation tracker to 1.0. More...

virtual void	SetSdrp (real1_f sdrp)
	Set the "Schmidt decomposition rounding parameter" value, (between 0 and 1) More...

virtual void	SetReactiveSeparate (bool isAggSep)
	Set reactive separation option (on by default if available) More...

virtual bool	GetReactiveSeparate ()
	Get reactive separation option. More...

virtual void	SetTInjection (bool useGadget)
	Set the option to use T-injection gadgets (off by default) More...

virtual bool	GetTInjection ()
	Get the option to use T-injection gadgets. More...

virtual int64_t	GetDevice ()
	Get the device index. More...

bitCapIntOcl	GetMaxSize ()
	Get maximum number of amplitudes that can be allocated on current device. More...

virtual real1_f	FirstNonzeroPhase ()
	Get phase of lowest permutation nonzero amplitude. More...

virtual void	DepolarizingChannelWeak1Qb (bitLenInt qubit, real1_f lambda)
	Simulate a local qubit depolarizing noise channel, under a stochastic "weak simulation condition." Under "weak" condition, sampling and exact state queries are not accurate, but sampling can be achieved via repeated full execution of a noisy circuit, for each hardware-realistic measurement sample. More...

virtual bitLenInt	DepolarizingChannelStrong1Qb (bitLenInt qubit, real1_f lambda)
	Simulate a local qubit depolarizing noise channel, under a "strong simulation condition." "Strong" condition supports measurement sampling and direct queries of state, but the expression of state is in terms of one retained ancillary qubit per applied noise channel. More...

Public Member Functions inherited from Qrack::ParallelFor
	ParallelFor ()

void	SetConcurrencyLevel (unsigned num)

unsigned	GetConcurrencyLevel ()

bitCapIntOcl	GetStride ()

bitLenInt	GetPreferredConcurrencyPower ()

void	par_for_inc (const bitCapIntOcl begin, const bitCapIntOcl itemCount, IncrementFunc, ParallelFunc fn)
	Iterate through the permutations a maximum of end-begin times, allowing the caller to control the incrementation offset through 'inc'. More...

void	par_for (const bitCapIntOcl begin, const bitCapIntOcl end, ParallelFunc fn)
	Call fn once for every numerical value between begin and end. More...

void	par_for_skip (const bitCapIntOcl begin, const bitCapIntOcl end, const bitCapIntOcl skipPower, const bitLenInt skipBitCount, ParallelFunc fn)
	Skip over the skipPower bits. More...

void	par_for_mask (const bitCapIntOcl, const bitCapIntOcl, const std::vector< bitCapIntOcl > &maskArray, ParallelFunc fn)
	Skip over the bits listed in maskArray in the same fashion as par_for_skip. More...

void	par_for_set (const std::set< bitCapIntOcl > &sparseSet, ParallelFunc fn)
	Iterate over a sparse state vector. More...

void	par_for_set (const std::vector< bitCapIntOcl > &sparseSet, ParallelFunc fn)
	Iterate over a sparse state vector. More...

void	par_for_sparse_compose (const std::vector< bitCapIntOcl > &lowSet, const std::vector< bitCapIntOcl > &highSet, const bitLenInt &highStart, ParallelFunc fn)
	Iterate over the power set of 2 sparse state vectors. More...

real1_f	par_norm (const bitCapIntOcl maxQPower, const StateVectorPtr stateArray, real1_f norm_thresh=ZERO_R1_F)
	Calculate the normal for the array, (with flooring). More...

real1_f	par_norm_exact (const bitCapIntOcl maxQPower, const StateVectorPtr stateArray)
	Calculate the normal for the array, (without flooring.) More...

Protected Types
typedef std::vector< bool >	BoolVector

typedef std::function< void(const bitLenInt &)>	StabilizerParallelFunc

typedef std::function< void(void)>	DispatchFn

Protected Member Functions
void	Dispatch (DispatchFn fn)

void	ParFor (StabilizerParallelFunc fn, std::vector< bitLenInt > qubits)

void	SetPhaseOffset (real1_f phaseArg)

void	rowcopy (const bitLenInt &i, const bitLenInt &k)
	Sets row i equal to row k. More...

void	rowswap (const bitLenInt &i, const bitLenInt &k)
	Swaps row i and row k - does not change the logical state. More...

void	rowset (const bitLenInt &i, bitLenInt b)
	Sets row i equal to the bth observable (X_1,...X_n,Z_1,...,Z_n) More...

void	rowmult (const bitLenInt &i, const bitLenInt &k)
	Left-multiply row i by row k - does not change the logical state. More...

uint8_t	clifford (const bitLenInt &i, const bitLenInt &k)
	Return the phase (0,1,2,3) when row i is LEFT-multiplied by row k. More...

void	seed (const bitLenInt &g)
	Finds a Pauli operator P such that the basis state P\|0...0> occurs with nonzero amplitude in q, and writes P to the scratch space of q. More...

AmplitudeEntry	getBasisAmp (const real1_f &nrm)
	Helper for setBasisState() and setBasisProb() More...

void	setBasisState (const real1_f &nrm, complex *stateVec)
	Returns the result of applying the Pauli operator in the "scratch space" of q to \|0...0> More...

void	setBasisState (const real1_f &nrm, QInterfacePtr eng)
	Returns the result of applying the Pauli operator in the "scratch space" of q to \|0...0> More...

void	setBasisState (const real1_f &nrm, std::map< bitCapInt, complex > &stateMap)
	Returns the result of applying the Pauli operator in the "scratch space" of q to \|0...0> More...

void	setBasisProb (const real1_f &nrm, real1 *outputProbs)
	Returns the probability from applying the Pauli operator in the "scratch space" of q to \|0...0> More...

real1_f	getExpectation (const real1_f &nrm, const std::vector< bitCapInt > &bitPowers, const std::vector< bitCapInt > &perms, bitCapInt offset)
	Returns the (partial) expectation value from a state vector amplitude. More...

real1_f	getExpectation (const real1_f &nrm, const std::vector< bitCapInt > &bitPowers, const std::vector< real1_f > &weights)
	Returns the (partial) expectation value from a state vector amplitude. More...

void	DecomposeDispose (const bitLenInt start, const bitLenInt length, QStabilizerPtr toCopy)

real1_f	ApproxCompareHelper (QStabilizerPtr toCompare, real1_f error_tol=TRYDECOMPOSE_EPSILON, bool isDiscrete=false)

Protected Member Functions inherited from Qrack::QInterface
virtual void	SetQubitCount (bitLenInt qb)

complex	GetNonunitaryPhase ()

template<typename Fn >
void	MACWrapper (const std::vector< bitLenInt > &controls, Fn fn)

bitCapInt	SampleClone (const std::vector< bitCapInt > &qPowers)

Protected Attributes
unsigned	rawRandBools

unsigned	rawRandBoolsRemaining

real1	phaseOffset

bitLenInt	maxStateMapCacheQubitCount

bool	isUnitarityBroken

std::vector< uint8_t >	r

std::vector< BoolVector >	x

std::vector< BoolVector >	z

Protected Attributes inherited from Qrack::QInterface
bool	doNormalize

bool	randGlobalPhase

bool	useRDRAND

bitLenInt	qubitCount

uint32_t	randomSeed

real1	amplitudeFloor

bitCapInt	maxQPower

qrack_rand_gen_ptr	rand_generator

std::uniform_real_distribution< real1_s >	rand_distribution

std::shared_ptr< RdRandom >	hardware_rand_generator

Friends
std::ostream &	operator<< (std::ostream &os, const QStabilizerPtr s)

std::istream &	operator>> (std::istream &is, const QStabilizerPtr s)

Additional Inherited Members
Static Protected Member Functions inherited from Qrack::QInterface
static real1_f	normHelper (complex c)

static real1_f	clampProb (real1_f toClamp)

Member Typedef Documentation

◆ BoolVector

typedef std::vector<bool> Qrack::QStabilizer::BoolVector

protected

◆ DispatchFn

typedef std::function<void(void)> Qrack::QStabilizer::DispatchFn

protected

◆ StabilizerParallelFunc

typedef std::function<void(const bitLenInt&)> Qrack::QStabilizer::StabilizerParallelFunc

protected

Constructor & Destructor Documentation

◆ QStabilizer()

Qrack::QStabilizer::QStabilizer	(	bitLenInt	n,
		bitCapInt	perm = `0U`,
		qrack_rand_gen_ptr	rgp = `nullptr`,
		complex	phaseFac = `CMPLX_DEFAULT_ARG`,
		bool	doNorm = `false`,
		bool	randomGlobalPhase = `true`,
		bool	ignored2 = `false`,
		int64_t	ignored3 = `-1`,
		bool	useHardwareRNG = `true`,
		bool	ignored4 = `false`,
		real1_f	ignored5 = `REAL1_EPSILON`,
		std::vector< int64_t >	ignored6 = `{}`,
		bitLenInt	ignored7 = `0U`,
		real1_f	ignored8 = `FP_NORM_EPSILON_F`
	)

◆ ~QStabilizer()

Qrack::QStabilizer::~QStabilizer ( )

inline

Member Function Documentation

◆ Allocate() [1/3]

virtual bitLenInt Qrack::QInterface::Allocate

inline

Allocate new "length" count of |0> state qubits at end of qubit index position.

◆ Allocate() [2/3]

bitLenInt Qrack::QStabilizer::Allocate	(	bitLenInt	start,
		bitLenInt	length
	)

inlinevirtual

Allocate new "length" count of |0> state qubits at specified qubit index start position.

Implements Qrack::QInterface.

◆ Allocate() [3/3]

virtual bitLenInt Qrack::QInterface::Allocate

Allocate new "length" count of |0> state qubits at specified qubit index start position.

◆ AntiCNOT()

void Qrack::QStabilizer::AntiCNOT	(	bitLenInt	control,
		bitLenInt	target
	)

virtual

Apply an (anti-)CNOT gate with control and target.

Reimplemented from Qrack::QInterface.

◆ AntiCY()

void Qrack::QStabilizer::AntiCY	(	bitLenInt	control,
		bitLenInt	target
	)

virtual

Apply an (anti-)CY gate with control and target.

Reimplemented from Qrack::QInterface.

◆ AntiCZ()

void Qrack::QStabilizer::AntiCZ	(	bitLenInt	control,
		bitLenInt	target
	)

virtual

Apply an (anti-)CZ gate with control and target.

Reimplemented from Qrack::QInterface.

◆ ApproxCompare() [1/2]

bool Qrack::QStabilizer::ApproxCompare	(	QInterfacePtr	toCompare,
		real1_f	error_tol = `TRYDECOMPOSE_EPSILON`
	)

inlinevirtual

Compare state vectors approximately, component by component, to determine whether this state vector is the same as the target.

Warning: PSEUDO-QUANTUM

Reimplemented from Qrack::QInterface.

◆ ApproxCompare() [2/2]

bool Qrack::QStabilizer::ApproxCompare	(	QStabilizerPtr	toCompare,
		real1_f	error_tol = `TRYDECOMPOSE_EPSILON`
	)

inline

◆ ApproxCompareHelper()

real1_f Qrack::QStabilizer::ApproxCompareHelper	(	QStabilizerPtr	toCompare,
		real1_f	error_tol = `TRYDECOMPOSE_EPSILON`,
		bool	isDiscrete = `false`
	)

protected

◆ CanDecomposeDispose()

bool Qrack::QStabilizer::CanDecomposeDispose	(	const bitLenInt	start,
		const bitLenInt	length
	)

◆ Clear()

void Qrack::QStabilizer::Clear ( )

inline

◆ clifford()

uint8_t Qrack::QStabilizer::clifford	(	const bitLenInt &	i,
		const bitLenInt &	k
	)

protected

Return the phase (0,1,2,3) when row i is LEFT-multiplied by row k.

◆ Clone()

QInterfacePtr Qrack::QStabilizer::Clone ( )

virtual

Clone this QInterface.

Implements Qrack::QInterface.

◆ CloneEmpty()

QStabilizerPtr Qrack::QStabilizer::CloneEmpty ( )

◆ CNOT()

void Qrack::QStabilizer::CNOT	(	bitLenInt	control,
		bitLenInt	target
	)

virtual

Apply a CNOT gate with control and target.

Reimplemented from Qrack::QInterface.

◆ Compose() [1/7]

virtual bitLenInt Qrack::QInterface::Compose

inline

Combine another QInterface with this one, after the last bit index of this one.

"Compose" 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 "Compose." Informally, "Compose" 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 "Compose" them.

"Compose" 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.

◆ Compose() [2/7]

bitLenInt Qrack::QStabilizer::Compose ( QInterfacePtr toCopy )

inlinevirtual

Combine another QInterface with this one, after the last bit index of this one.

"Compose" 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 "Compose." Informally, "Compose" 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 "Compose" them.

"Compose" 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.

Reimplemented from Qrack::QInterface.

◆ Compose() [3/7]

bitLenInt Qrack::QInterface::Compose

◆ Compose() [4/7]

bitLenInt Qrack::QStabilizer::Compose	(	QInterfacePtr	toCopy,
		bitLenInt	start
	)

inlinevirtual

Reimplemented from Qrack::QInterface.

◆ Compose() [5/7]

bitLenInt Qrack::QStabilizer::Compose ( QStabilizerPtr toCopy )

inline

◆ Compose() [6/7]

bitLenInt Qrack::QStabilizer::Compose	(	QStabilizerPtr	toCopy,
		bitLenInt	start
	)

◆ Compose() [7/7]

std::map< QInterfacePtr, bitLenInt > Qrack::QInterface::Compose

◆ CY()

void Qrack::QStabilizer::CY	(	bitLenInt	control,
		bitLenInt	target
	)

virtual

Apply a CY gate with control and target.

Reimplemented from Qrack::QInterface.

◆ CZ()

void Qrack::QStabilizer::CZ	(	bitLenInt	control,
		bitLenInt	target
	)

virtual

Apply a CZ gate with control and target.

Reimplemented from Qrack::QInterface.

◆ Decompose() [1/2]

QInterfacePtr Qrack::QStabilizer::Decompose	(	bitLenInt	start,
		bitLenInt	length
	)

virtual

Schmidt decompose a length of qubits.

Implements Qrack::QInterface.

◆ Decompose() [2/2]

void Qrack::QStabilizer::Decompose	(	bitLenInt	start,
		QInterfacePtr	dest
	)

inlinevirtual

Minimally decompose a set of contiguous bits from the separably composed unit, into "destination".

Minimally decompose a set of contigious bits from the separably composed unit. The length of this separable unit is reduced by the length of bits decomposed, 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 "Compose" is like "just setting another group of qubits down next to the first," if two sets of qubits are not entangled, then "Decompose" 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. (This is equivalent to a "Schmidt decomposition.")

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:

\( P(|1000>|xy>) = P(|1000 00>) + P(|1000 10>) + P(|1000 01>) + P(|1000 11>). \)

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.

Implements Qrack::QInterface.

◆ DecomposeDispose()

void Qrack::QStabilizer::DecomposeDispose	(	const bitLenInt	start,
		const bitLenInt	length,
		QStabilizerPtr	toCopy
	)

protected

◆ Dispatch()

void Qrack::QStabilizer::Dispatch ( DispatchFn fn )

inlineprotected

◆ Dispose() [1/2]

void Qrack::QStabilizer::Dispose	(	bitLenInt	start,
		bitLenInt	length
	)

inlinevirtual

Minimally decompose a set of contiguous bits from the separably composed unit, and discard the separable bits from index "start" for "length.".

Minimally decompose a set of contigious bits from the separably composed unit. The length of this separable unit is reduced by the length of bits decomposed, 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 "Compose" is like "just setting another group of qubits down next to the first," if two sets of qubits are not entangled, then "Decompose" 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. (This is equivalent to a "Schmidt decomposition.")

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:

\( P(|1000>|xy>) = P(|1000 00>) + P(|1000 10>) + P(|1000 01>) + P(|1000 11>). \)

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.

Implements Qrack::QInterface.

◆ Dispose() [2/2]

void Qrack::QStabilizer::Dispose	(	bitLenInt	start,
		bitLenInt	length,
		bitCapInt	disposedPerm
	)

inlinevirtual

Dispose a a contiguous set of qubits that are already in a permutation eigenstate.

Implements Qrack::QInterface.

◆ ExpectationBitsFactorized()

real1_f Qrack::QStabilizer::ExpectationBitsFactorized	(	const std::vector< bitLenInt > &	bits,
		const std::vector< bitCapInt > &	perms,
		bitCapInt	offset = `0U`
	)

virtual

Get expectation qubits, interpreting each permutation as an unsigned integer.

Reimplemented from Qrack::QInterface.

◆ ExpectationFloatsFactorized()

real1_f Qrack::QStabilizer::ExpectationFloatsFactorized	(	const std::vector< bitLenInt > &	bits,
		const std::vector< real1_f > &	weights
	)

virtual

Get expectation qubits, interpreting each permutation as a floating-point value.

Reimplemented from Qrack::QInterface.

◆ ForceM()

bool Qrack::QStabilizer::ForceM	(	bitLenInt	t,
		bool	result,
		bool	doForce = `true`,
		bool	doApply = `true`
	)

virtual

Measure qubit t.

Implements Qrack::QInterface.

◆ FSim()

void Qrack::QStabilizer::FSim	(	real1_f	theta,
		real1_f	phi,
		bitLenInt	qubitIndex1,
		bitLenInt	qubitIndex2
	)

virtual

The 2-qubit "fSim" gate, (useful in the simulation of particles with fermionic statistics)

Implements Qrack::QInterface.

◆ gaussian()

bitLenInt Qrack::QStabilizer::gaussian ( )

Do Gaussian elimination to put the stabilizer generators in the following form: At the top, a minimal set of generators containing X's and Y's, in "quasi-upper-triangular" form.

(Return value = number of such generators = log_2 of number of nonzero basis states) At the bottom, generators containing Z's only in quasi-upper-triangular form.

◆ GetAmplitude()

complex Qrack::QStabilizer::GetAmplitude ( bitCapInt perm )

virtual

Get a single basis state amplitude.

Convert the state to ket notation (warning: could be huge!)

Implements Qrack::QInterface.

◆ GetAmplitudes()

std::vector< complex > Qrack::QStabilizer::GetAmplitudes ( std::vector< bitCapInt > perms )

Get a single basis state amplitude.

Convert the state to ket notation (warning: could be huge!)

◆ GetAnyAmplitude()

AmplitudeEntry Qrack::QStabilizer::GetAnyAmplitude ( )

Get any single basis state amplitude.

◆ getBasisAmp()

AmplitudeEntry Qrack::QStabilizer::getBasisAmp ( const real1_f & nrm )

protected

Helper for setBasisState() and setBasisProb()

◆ getExpectation() [1/2]

real1_f Qrack::QStabilizer::getExpectation	(	const real1_f &	nrm,
		const std::vector< bitCapInt > &	bitPowers,
		const std::vector< bitCapInt > &	perms,
		bitCapInt	offset
	)

protected

Returns the (partial) expectation value from a state vector amplitude.

◆ getExpectation() [2/2]

real1_f Qrack::QStabilizer::getExpectation	(	const real1_f &	nrm,
		const std::vector< bitCapInt > &	bitPowers,
		const std::vector< real1_f > &	weights
	)

protected

Returns the (partial) expectation value from a state vector amplitude.

◆ GetMaxQPower()

bitCapInt Qrack::QStabilizer::GetMaxQPower ( )

inlinevirtual

Get the maximum number of basis states, namely \( 2^n \) for \( n \) qubits.

Reimplemented from Qrack::QInterface.

◆ GetPhaseOffset()

complex Qrack::QStabilizer::GetPhaseOffset ( )

inline

◆ GetProbs()

void Qrack::QStabilizer::GetProbs ( real1 * outputProbs )

virtual

Get all probabilities corresponding to ket notation.

Implements Qrack::QInterface.

◆ GetQuantumState() [1/3]

std::map< bitCapInt, complex > Qrack::QStabilizer::GetQuantumState ( )

Convert the state to sparse ket notation.

Convert the state to ket notation (warning: could be huge!)

◆ GetQuantumState() [2/3]

void Qrack::QStabilizer::GetQuantumState ( complex * stateVec )

virtual

Convert the state to ket notation.

Convert the state to ket notation (warning: could be huge!)

Implements Qrack::QInterface.

◆ GetQuantumState() [3/3]

void Qrack::QStabilizer::GetQuantumState ( QInterfacePtr eng )

Convert the state to ket notation, directly into another QInterface.

Convert the state to ket notation (warning: could be huge!)

◆ GetQubitAmplitude()

AmplitudeEntry Qrack::QStabilizer::GetQubitAmplitude	(	bitLenInt	t,
		bool	m
	)

Get any single basis state amplitude where qubit "t" has value "m".

◆ GetQubitCount()

bitLenInt Qrack::QStabilizer::GetQubitCount ( )

inlinevirtual

Get the count of bits in this register.

Reimplemented from Qrack::QInterface.

◆ GlobalPhaseCompare() [1/2]

bool Qrack::QStabilizer::GlobalPhaseCompare	(	QInterfacePtr	toCompare,
		real1_f	error_tol = `TRYDECOMPOSE_EPSILON`
	)

inline

◆ GlobalPhaseCompare() [2/2]

bool Qrack::QStabilizer::GlobalPhaseCompare	(	QStabilizerPtr	toCompare,
		real1_f	error_tol = `TRYDECOMPOSE_EPSILON`
	)

inline

◆ H() [1/3]

virtual void Qrack::QInterface::H

inline

Apply a Hadamard gate to target.

◆ H() [2/3]

void Qrack::QStabilizer::H ( bitLenInt qubitIndex )

virtual

Apply a Hadamard gate to target.

Reimplemented from Qrack::QInterface.

◆ H() [3/3]

virtual void Qrack::QInterface::H

Apply a Hadamard gate to target.

◆ IISwap()

void Qrack::QStabilizer::IISwap	(	bitLenInt	qubitIndex1,
		bitLenInt	qubitIndex2
	)

virtual

Inverse ISwap - Swap values of two bits in register, and apply phase factor of -i if bits are different.

Reimplemented from Qrack::QInterface.

◆ Invert()

void Qrack::QStabilizer::Invert	(	complex	topRight,
		complex	bottomLeft,
		bitLenInt	qubitIndex
	)

virtual

Apply a single bit transformation that reverses bit probability and might effect phase.

Reimplemented from Qrack::QInterface.

◆ IS()

void Qrack::QStabilizer::IS ( bitLenInt qubitIndex )

virtual

Apply an inverse phase gate (|0>->|0>, |1>->-i|1>, or "S adjoint") to qubit b.

Apply a phase gate (|0>->|0>, |1>->i|1>, or "S") to qubit b.

Reimplemented from Qrack::QInterface.

◆ isClifford() [1/2]

bool Qrack::QStabilizer::isClifford ( )

inlinevirtual

Returns "true" if current state is identifiably within the Clifford set, or "false" if it is not or cannot be determined.

Reimplemented from Qrack::QInterface.

◆ isClifford() [2/2]

bool Qrack::QStabilizer::isClifford ( bitLenInt qubit )

inlinevirtual

Returns "true" if current qubit state is identifiably within the Clifford set, or "false" if it is not or cannot be determined.

Reimplemented from Qrack::QInterface.

◆ IsSeparable()

uint8_t Qrack::QStabilizer::IsSeparable ( const bitLenInt & target )

Returns: 0 if target qubit is not separable 1 if target qubit is a Z basis eigenstate 2 if target qubit is an X basis eigenstate 3 if target qubit is a Y basis eigenstate.

◆ IsSeparableX()

bool Qrack::QStabilizer::IsSeparableX ( const bitLenInt & target )

Returns "true" if target qubit is an X basis eigenstate.

◆ IsSeparableY()

bool Qrack::QStabilizer::IsSeparableY ( const bitLenInt & target )

Returns "true" if target qubit is a Y basis eigenstate.

◆ IsSeparableZ()

bool Qrack::QStabilizer::IsSeparableZ ( const bitLenInt & target )

Returns "true" if target qubit is a Z basis eigenstate.

◆ ISwap()

void Qrack::QStabilizer::ISwap	(	bitLenInt	qubitIndex1,
		bitLenInt	qubitIndex2
	)

virtual

Swap values of two bits in register, and apply phase factor of i if bits are different.

Reimplemented from Qrack::QInterface.

◆ MACInvert()

void Qrack::QStabilizer::MACInvert	(	const std::vector< bitLenInt > &	controls,
		complex	topRight,
		complex	bottomLeft,
		bitLenInt	target
	)

virtual

Apply a single bit transformation that reverses bit probability and might effect phase, with arbitrary (anti-)control bits.

Reimplemented from Qrack::QInterface.

◆ MACMtrx()

void Qrack::QStabilizer::MACMtrx	(	const std::vector< bitLenInt > &	controls,
		const complex *	mtrx,
		bitLenInt	target
	)

inlinevirtual

Apply an arbitrary single bit unitary transformation, with arbitrary (anti-)control bits.

Reimplemented from Qrack::QInterface.

◆ MACPhase()

void Qrack::QStabilizer::MACPhase	(	const std::vector< bitLenInt > &	controls,
		complex	topLeft,
		complex	bottomRight,
		bitLenInt	target
	)

virtual

Apply a single bit transformation that only effects phase, with arbitrary (anti-)control bits.

Reimplemented from Qrack::QInterface.

◆ MCInvert()

void Qrack::QStabilizer::MCInvert	(	const std::vector< bitLenInt > &	controls,
		complex	topRight,
		complex	bottomLeft,
		bitLenInt	target
	)

virtual

Apply a single bit transformation that reverses bit probability and might effect phase, with arbitrary control bits.

Reimplemented from Qrack::QInterface.

◆ MCMtrx()

void Qrack::QStabilizer::MCMtrx	(	const std::vector< bitLenInt > &	controls,
		const complex *	mtrx,
		bitLenInt	target
	)

inlinevirtual

Apply an arbitrary single bit unitary transformation, with arbitrary control bits.

Implements Qrack::QInterface.

◆ MCPhase()

void Qrack::QStabilizer::MCPhase	(	const std::vector< bitLenInt > &	controls,
		complex	topLeft,
		complex	bottomRight,
		bitLenInt	target
	)

virtual

Apply a single bit transformation that only effects phase, with arbitrary control bits.

Reimplemented from Qrack::QInterface.

◆ Mtrx()

void Qrack::QStabilizer::Mtrx	(	const complex *	mtrx,
		bitLenInt	qubitIndex
	)

virtual

Apply an arbitrary single bit unitary transformation.

Implements Qrack::QInterface.

◆ NormalizeState()

void Qrack::QStabilizer::NormalizeState	(	real1_f	nrm = `REAL1_DEFAULT_ARG`,
		real1_f	norm_thresh = `REAL1_DEFAULT_ARG`,
		real1_f	phaseArg = `ZERO_R1_F`
	)

inlinevirtual

Apply the normalization factor found by UpdateRunningNorm() or on the fly by a single bit gate.

(On an actual quantum computer, the state should never require manual normalization.)

Warning: PSEUDO-QUANTUM

Implements Qrack::QInterface.

◆ ParFor()

void Qrack::QStabilizer::ParFor	(	StabilizerParallelFunc	fn,
		std::vector< bitLenInt >	qubits
	)

protected

◆ PermCount()

bitCapInt Qrack::QStabilizer::PermCount ( )

inline

◆ Phase()

void Qrack::QStabilizer::Phase	(	complex	topLeft,
		complex	bottomRight,
		bitLenInt	qubitIndex
	)

virtual

Apply a single bit transformation that only effects phase.

Reimplemented from Qrack::QInterface.

◆ Prob()

real1_f Qrack::QStabilizer::Prob ( bitLenInt qubitIndex )

virtual

Direct measure of bit probability to be in |1> state.

Warning: PSEUDO-QUANTUM

Implements Qrack::QInterface.

◆ ProbMask()

real1_f Qrack::QStabilizer::ProbMask	(	bitCapInt	mask,
		bitCapInt	permutation
	)

virtual

Direct measure of masked permutation probability.

Reimplemented from Qrack::QInterface.

◆ ProbPermRdm()

real1_f Qrack::QStabilizer::ProbPermRdm	(	bitCapInt	perm,
		bitLenInt	ancillaeStart
	)

Under assumption of a QStabilizerHybrid ancillary buffer, trace out the permutation probability of the reduced density matrx without ancillae.

◆ Rand()

bool Qrack::QStabilizer::Rand ( )

inline

◆ ResetPhaseOffset()

void Qrack::QStabilizer::ResetPhaseOffset ( )

inline

◆ rowcopy()

void Qrack::QStabilizer::rowcopy	(	const bitLenInt &	i,
		const bitLenInt &	k
	)

inlineprotected

Sets row i equal to row k.

◆ rowmult()

void Qrack::QStabilizer::rowmult	(	const bitLenInt &	i,
		const bitLenInt &	k
	)

inlineprotected

Left-multiply row i by row k - does not change the logical state.

◆ rowset()

void Qrack::QStabilizer::rowset	(	const bitLenInt &	i,
		bitLenInt	b
	)

inlineprotected

Sets row i equal to the bth observable (X_1,...X_n,Z_1,...,Z_n)

◆ rowswap()

void Qrack::QStabilizer::rowswap	(	const bitLenInt &	i,
		const bitLenInt &	k
	)

inlineprotected

Swaps row i and row k - does not change the logical state.

◆ S()

void Qrack::QStabilizer::S ( bitLenInt qubitIndex )

virtual

Apply a phase gate (|0>->|0>, |1>->i|1>, or "S") to qubit b.

Reimplemented from Qrack::QInterface.

◆ seed()

void Qrack::QStabilizer::seed ( const bitLenInt & g )

protected

Finds a Pauli operator P such that the basis state P|0...0> occurs with nonzero amplitude in q, and writes P to the scratch space of q.

For this to work, Gaussian elimination must already have been performed on q. g is the return value from gaussian(q).

◆ SetAmplitude()

void Qrack::QStabilizer::SetAmplitude	(	bitCapInt	perm,
		complex	amp
	)

inlinevirtual

Sets the representational amplitude of a full permutation.

Warning: PSEUDO-QUANTUM

Implements Qrack::QInterface.

◆ setBasisProb()

void Qrack::QStabilizer::setBasisProb	(	const real1_f &	nrm,
		real1 *	outputProbs
	)

protected

Returns the probability from applying the Pauli operator in the "scratch space" of q to |0...0>

◆ setBasisState() [1/3]

void Qrack::QStabilizer::setBasisState	(	const real1_f &	nrm,
		complex *	stateVec
	)

protected

Returns the result of applying the Pauli operator in the "scratch space" of q to |0...0>

◆ setBasisState() [2/3]

void Qrack::QStabilizer::setBasisState	(	const real1_f &	nrm,
		QInterfacePtr	eng
	)

protected

Returns the result of applying the Pauli operator in the "scratch space" of q to |0...0>

◆ setBasisState() [3/3]

void Qrack::QStabilizer::setBasisState	(	const real1_f &	nrm,
		std::map< bitCapInt, complex > &	stateMap
	)

protected

Returns the result of applying the Pauli operator in the "scratch space" of q to |0...0>

◆ SetDevice()

void Qrack::QStabilizer::SetDevice ( int64_t dID )

inlinevirtual

Set the device index, if more than one device is available.

Implements Qrack::QInterface.

◆ SetPermutation()

void Qrack::QStabilizer::SetPermutation	(	bitCapInt	perm,
		complex	phaseFac = `CMPLX_DEFAULT_ARG`
	)

virtual

Set to a specific permutation of all qubits.

Reimplemented from Qrack::QInterface.

◆ SetPhaseOffset()

void Qrack::QStabilizer::SetPhaseOffset ( real1_f phaseArg )

inlineprotected

◆ SetQuantumState()

void Qrack::QStabilizer::SetQuantumState ( const complex * inputState )

virtual

Set an arbitrary pure quantum state representation.

Warning: PSEUDO-QUANTUM

Implements Qrack::QInterface.

◆ SetRandGlobalPhase()

void Qrack::QStabilizer::SetRandGlobalPhase ( bool isRand )

inline

◆ SetRandomSeed()

void Qrack::QStabilizer::SetRandomSeed ( uint32_t seed )

inline

◆ SumSqrDiff()

real1_f Qrack::QStabilizer::SumSqrDiff ( QInterfacePtr toCompare )

inlinevirtual

Implements Qrack::QInterface.

◆ Swap()

void Qrack::QStabilizer::Swap	(	bitLenInt	qubitIndex1,
		bitLenInt	qubitIndex2
	)

virtual

Swap values of two bits in register.

Reimplemented from Qrack::QInterface.

◆ TrySeparate() [1/3]

bool Qrack::QStabilizer::TrySeparate ( bitLenInt qubit )

inlinevirtual

Single-qubit TrySeparate()

Reimplemented from Qrack::QInterface.

◆ TrySeparate() [2/3]

bool Qrack::QStabilizer::TrySeparate	(	bitLenInt	qubit1,
		bitLenInt	qubit2
	)

inlinevirtual

Two-qubit TrySeparate()

Reimplemented from Qrack::QInterface.

◆ TrySeparate() [3/3]

bool Qrack::QStabilizer::TrySeparate	(	const std::vector< bitLenInt > &	qubits,
		real1_f	error_tol
	)

virtual

Qrack::QUnit types maintain explicit separation of representations of qubits, which reduces memory usage and increases gate speed.

This method is used to manually attempt internal separation of a QUnit subsytem. We attempt a Decompose() operation, on a state which might not be separable. If the state is not separable, we abort and return false. Otherwise, we complete the operation, add the separated subsystem back in place into the QUnit "shards," and return true.

Warning: PSEUDO-QUANTUM

This should never change the logical/physical state of the QInterface, only possibly its internal representation, for simulation optimization purposes. This is not a truly quantum computational operation, but it also does not lead to nonphysical effects.

Reimplemented from Qrack::QInterface.

◆ UpdateRunningNorm()

void Qrack::QStabilizer::UpdateRunningNorm ( real1_f norm_thresh = REAL1_DEFAULT_ARG )

inlinevirtual

Force a calculation of the norm of the state vector, in order to make it unit length before the next probability or measurement operation.

(On an actual quantum computer, the state should never require manual normalization.)

Warning: PSEUDO-QUANTUM

Implements Qrack::QInterface.

◆ X() [1/3]

virtual void Qrack::QInterface::X

inline

Apply an X (or NOT) gate to target.

◆ X() [2/3]

void Qrack::QStabilizer::X ( bitLenInt qubitIndex )

virtual

Apply an X (or NOT) gate to target.

Reimplemented from Qrack::QInterface.

◆ X() [3/3]

virtual void Qrack::QInterface::X

inline

Apply an X (or NOT) gate to target.

◆ Y()

void Qrack::QStabilizer::Y ( bitLenInt qubitIndex )

virtual

Apply a Pauli Y gate to target.

Reimplemented from Qrack::QInterface.

◆ Z()

void Qrack::QStabilizer::Z ( bitLenInt qubitIndex )

virtual

Apply a phase gate (|0>->|0>, |1>->-|1>, or "Z") to qubit b.

Reimplemented from Qrack::QInterface.

Friends And Related Function Documentation

◆ operator<<

std::ostream& operator<<	(	std::ostream &	os,
		const QStabilizerPtr	s
	)

friend

◆ operator>>

std::istream& operator>>	(	std::istream &	is,
		const QStabilizerPtr	s
	)

friend

Member Data Documentation

◆ isUnitarityBroken

bool Qrack::QStabilizer::isUnitarityBroken

protected

◆ maxStateMapCacheQubitCount

bitLenInt Qrack::QStabilizer::maxStateMapCacheQubitCount

protected

◆ phaseOffset

real1 Qrack::QStabilizer::phaseOffset

protected

◆ r

std::vector<uint8_t> Qrack::QStabilizer::r

protected

◆ rawRandBools

unsigned Qrack::QStabilizer::rawRandBools

protected

◆ rawRandBoolsRemaining

unsigned Qrack::QStabilizer::rawRandBoolsRemaining

protected

◆ x

std::vector<BoolVector> Qrack::QStabilizer::x

protected

◆ z

std::vector<BoolVector> Qrack::QStabilizer::z

protected

The documentation for this class was generated from the following files:

include/qstabilizer.hpp
src/qstabilizer.cpp

Public Member Functions

Protected Types

Protected Member Functions

Protected Attributes

Friends

Additional Inherited Members

Member Typedef Documentation

◆ BoolVector

◆ DispatchFn

◆ StabilizerParallelFunc

Constructor & Destructor Documentation

◆ QStabilizer()

◆ ~QStabilizer()

Member Function Documentation

◆ Allocate() [1/3]

◆ Allocate() [2/3]

◆ Allocate() [3/3]

◆ AntiCNOT()

◆ AntiCY()

◆ AntiCZ()

◆ ApproxCompare() [1/2]

◆ ApproxCompare() [2/2]

◆ ApproxCompareHelper()

◆ CanDecomposeDispose()

◆ Clear()

◆ clifford()

◆ Clone()

◆ CloneEmpty()

◆ CNOT()

◆ Compose() [1/7]

◆ Compose() [2/7]

◆ Compose() [3/7]

◆ Compose() [4/7]

◆ Compose() [5/7]

◆ Compose() [6/7]

◆ Compose() [7/7]

◆ CY()

◆ CZ()

◆ Decompose() [1/2]

◆ Decompose() [2/2]

◆ DecomposeDispose()

◆ Dispatch()

◆ Dispose() [1/2]

◆ Dispose() [2/2]

◆ ExpectationBitsFactorized()

◆ ExpectationFloatsFactorized()

◆ ForceM()

◆ FSim()

◆ gaussian()

◆ GetAmplitude()

◆ GetAmplitudes()

◆ GetAnyAmplitude()

◆ getBasisAmp()

◆ getExpectation() [1/2]

◆ getExpectation() [2/2]

◆ GetMaxQPower()

◆ GetPhaseOffset()

◆ GetProbs()

◆ GetQuantumState() [1/3]

◆ GetQuantumState() [2/3]

◆ GetQuantumState() [3/3]

◆ GetQubitAmplitude()

◆ GetQubitCount()

◆ GlobalPhaseCompare() [1/2]

◆ GlobalPhaseCompare() [2/2]

◆ H() [1/3]

◆ H() [2/3]

◆ H() [3/3]

◆ IISwap()

◆ Invert()

◆ IS()

◆ isClifford() [1/2]

◆ isClifford() [2/2]

◆ IsSeparable()

◆ IsSeparableX()

◆ IsSeparableY()

◆ IsSeparableZ()

◆ ISwap()

◆ MACInvert()

◆ MACMtrx()