Parity measurement

Quantum circuit that exhibits Parity measurement

Parity measurement (also referred to as Operator measurement) is a procedure in quantum information science used for error detection in quantum qubits. A parity measurement checks the equality of two qubits to return a true or false answer, which can be used to determine whether a correction needs to occur.[1] Additional measurements can be made for a system greater than two qubits. Because parity measurement does not measure the state of singular bits but rather gets information about the whole state, it is considered an example of a joint measurement. Joint measurements do not have the consequence of destroying the original state of a qubit as normal quantum measurements do.[2] Mathematically speaking, parity measurements are used to project a state into an eigenstate of an operator and to acquire its eigenvalue.[citation needed]

Parity measurement is an essential concept of quantum error correction. From the parity measurement, an appropriate unitary operation can be applied to correct the error without knowing the beginning state of the qubit.[3]

## Contents

* 1 Parity and parity checking
* 1.1 Example
* 2 Parity check matrix
* 3 Types of parity measurements
* 3.1 Example
* 4 Experiments and applications
* 5 References

## Parity and parity checking

A qubit is a two level system and when we measure one qubit, we can have either 1 or 0 as a result. One corresponds odd parity and zero corresponds even parity. This is what a parity check is. This idea can be generalized beyond single qubits. This can be generalized beyond a single qubit and it is useful in QEC. The idea of parity checks in QEC is to have just parity information of multiple data qubits over one (auxiliary) qubit without revealing any other information. Any unitary can be used for the parity check. If we want to have the parity information of a valid quantum observable U, we need to apply the controlled-U gates between the ancilla qubit and the data qubits sequentially. For example, for making parity check measurement in the X basis, we need to apply CNOT gates between the ancilla qubit and the data qubits sequentially since the controlled gate in this case is a CNOT (CX) gate.[4]

The unique state of the ancillary qubit is then used to determine either even or odd parity of the qubits. When the qubits of the input states are equal, an even parity will be measured indicating that no error has occurred. When the qubits are unequal, an odd parity will be measured indicating a single bit-flip error.[5]

With more than two qubits, additional parity measurements can be performed to determine if the qubits are the same value, and if not, to find which is the outlier. For example, in a system of three qubits, one can first perform a parity measurement on the first and second qubit, and then on the first and third qubit. Specifically, one is measuring Z⊗Z⊗I to determine if an X error has occurred on the first two qubits, and then Z⊗I⊗Z to determine if an X error has occurred on the first and third qubits.[citation needed]

In a circuit, an ancillary qubit is prepared in the |0⟩ state. During measurement, a CNOT gate is performed on the ancillary bit dependent on the first qubit being checked, followed by a second CNOT gate performed on the ancillary bit dependent on the second qubit being checked. If these qubits are the same, the double CNOT gates will revert the ancillary qubit to its initial |0⟩ state, which indicates even parity. If these qubits are not the same, the double CNOT gates will alter the ancillary qubit to the opposite |1⟩ state, which indicates odd parity.[1] Looking at the ancillary qubits, a corresponding correction can be performed.

Alternatively, the parity measurement can be thought of as a projection of a qubit state into an eigenstate of an operator and to acquire its eigenvalue. For the Z⊗Z⊗I measurement, checking the ancillary qubit in the basis |0⟩± |1⟩ will return the eigenvalue of the measurement. If the eigenvalue here is measured to be +1, this indicates even parity of the bits without error. If the eigenvalue is measured to be -1, this indicates odd parity of the bits with a bit-flip error.[citation needed]

### Example

Alice, a sender, wants to transmit a qubit to Bob, a receiver. The state of any qubit that Alice would wish to send can be written as a |0⟩+b |1⟩ where a and b are coefficients. Alice encodes this into three qubits, so that the initial state she transmits is a |000⟩+b |111⟩. Following noise in the channel, the three qubits state can be seen in the following table with the corresponding probability:[1]

State Changes following Noise in a Quantum Circuit  Qubit State  | Probability  | Ancillary Qubits  | Correction

|
|
|

(a |000⟩+b |111⟩) | (1−p)3 | |00⟩ | not needed
(a |100⟩+b |011⟩) | p(1−p)2 | |11⟩ | apply σx to first qubit
(a |010⟩+b |101⟩) | p(1−p)2 | |10⟩ | apply σx to second qubit
(a |001⟩+b |110⟩) | p(1−p)2 | |01⟩ | apply σx to third qubit
(a |110⟩+b |001⟩) | p2(1−p) | |01⟩ | apply σx to third qubit
(a |101⟩+b |010⟩) | p2(1−p) | |10⟩ | apply σx to second qubit
(a |011⟩+b |100⟩) | p2(1−p) | |11⟩ | apply σx to first qubit
(a |111⟩+b |000⟩) | p3 | |00⟩ | not needed

A parity measurement can be performed on the altered state, with two ancillary qubits storing the measurement. First, the first and second qubits' parity is checked. If they are equal, a |0⟩ is stored in the first ancillary qubit. If they are not equal, a |1⟩ is stored in the first ancillary qubit. The same action is performed comparing the first and third qubits, with the check being stored in the second ancillary qubit. Important to note is that we do not actually need to know the input qubit state, and can perform the CNOT operations indicating the parity without this knowledge. The ancillary qubits are what indicates what bit has been altered, and the σx correction operation can be performed as needed.[1]

Parity Measurement in Quantum Error Correction

An easy way to visualize this is in the circuit above. First, the input state |ψ⟩ is encoded into 3 bits, and parity checks are performed with subsequent error correction performed based on the results of the ancilla qubits at the bottom. Finally, decoding is performing to put get back to the same basis of the input state.

## Parity check matrix

A parity check matrix for a quantum circuit can also be constructed using these principles. For some message x encoded as Gx, where G corresponds to the generator matrix, Hx = 0 where H is the parity matrix containing 0's and 1's for a situation where there is no error. However, if an error occurs at one component, then the pattern in the errors can be used to find which bit is incorrect.[3]

## Types of parity measurements

Two types of parity measurement are indirect and direct. Indirect parity measurements coincide with the typical way we think of parity measurement as described above, by measuring an ancilla qubit to determine the parity of the input bits. Direct parity measurements differ from the previous type in that a common mode with the parities coupled to the qubits is measured, without the need for an ancilla qubit. While indirect parity measurements can put a strain on experimental capacity, direct measurements may interfere with the fidelity of the initial states.[6]

### Example

For example, given a Hermitian and Unitary operator U (whose eigenvalues are ±1) and a state |ψ⟩, the circuit on the top right performs a Parity measurement on U. After the first Hadamard gate, the state of the circuit is

12(|0⟩|ψ⟩+|1⟩|ψ⟩)

After applying the controlled-U gate, the state of the circuit evolves to

12(|0⟩|ψ⟩+|1⟩U|ψ⟩)

After applying the second Hadamard gate, the state of the circuit turns into

12|0⟩(|ψ⟩+U|ψ⟩)+12|1⟩(|ψ⟩−U|ψ⟩)

If the state of the top qubit after measurement is |0⟩, then |ϕ⟩=|ψ⟩+U|ψ⟩; which is the +1 eigenstate of U. If the state of the top qubit is |1⟩, then |ϕ⟩=|ψ⟩−U|ψ⟩; which is the −1 eigenstate of U.[5]

## Experiments and applications

In experiments, parity measurements are not only a mechanism for quantum error correction, but they can also help combat non-ideal conditions. Given the existent possibility for bit flip errors, there is an additional likelihood for errors as a result of leakage. This phenomenon is due to unused high-energy qubits becoming excited. It has been demonstrated in superconducting transmon qubits that parity measurements can be applied repetitively during quantum error correction to remove leakage errors.[7] Repetitive parity measurements can be used to stabilize an entangled state and prevent leakage errors (which normally is not possible with typical quantum error correction), but the first group to accomplish this did so in 2020. By performing interleaving XX and ZZ checks, which can ultimately tell whether an X (bit), Y (iXZ), or Z (phase) flip error occurs. The outcomes of these parity measurements of ancilla qubits are used with Hidden Markov Models to complete leakage detection and correction.[8]

## References

1. ↑ 1.0 1.1 1.2 1.3 Steane, Andrew M. (2006). A tutorial on quantum error correction. Quantum Computers, Algorithms and Chaos, 1-32. https://www2.physics.ox.ac.uk/sites/default/files/ErrorCorrectionSteane06.pdf
2. ↑ Thekkadath, Guillaume (2017). Joint Measurements of Complementary Properties of Quantum Systems (Thesis thesis). Université d'Ottawa / University of Ottawa. doi:10.20381/ruor-20949.
3. ↑ 3.0 3.1 Nielsen, Michael A. (2010). Quantum computation and quantum information. Isaac L. Chuang (10th anniversary ed.). Cambridge: Cambridge University Press. ISBN 978-1-107-00217-3. OCLC 665137861.
4. ↑ Üstün, Gözde; Morello, Andrea; Devitt, Simon (2023), Single-Step Parity Check Gate Set for Quantum Error Correction
5. ↑ 5.0 5.1 Devitt, Simon J.; Nemoto, Kae; Munro, William J. (2013). "Quantum error correction for beginners". Reports on Progress in Physics 76 (7): 076001. doi:10.1088/0034-4885/76/7/076001. PMID 23787909. Bibcode: 2013RPPh...76g6001D.
6. ↑ Royer, Baptiste; Puri, Shruti; Blais, Alexandre (2018-11-02). "Qubit parity measurement by parametric driving in circuit QED" (in en). Science Advances 4 (11): eaau1695. doi:10.1126/sciadv.aau1695. ISSN 2375-2548. PMID 30515454. Bibcode: 2018SciA....4.1695R.
7. ↑ McEwen, M.; Kafri, D.; Chen, Z.; Atalaya, J.; Satzinger, K. J.; Quintana, C.; Klimov, P. V.; Sank, D. et al. (2021-03-19). "Removing leakage-induced correlated errors in superconducting quantum error correction" (in en). Nature Communications 12 (1): 1761. doi:10.1038/s41467-021-21982-y. ISSN 2041-1723. PMID 33741936. Bibcode: 2021NatCo..12.1761M.
8. ↑ Bultink, C. C.; O'Brien, T. E.; Vollmer, R.; Muthusubramanian, N.; Beekman, M. W.; Rol, M. A.; Fu, X.; Tarasinski, B. et al. (2020-03-20). "Protecting quantum entanglement from leakage and qubit errors via repetitive parity measurements" (in en). Science Advances 6 (12): eaay3050. doi:10.1126/sciadv.aay3050. ISSN 2375-2548. PMID 32219159. Bibcode: 2020SciA....6.3050B.

* v
* t
* e

Quantum information science

General|

* Quantum computing
* Qubit
* physical vs. logical
* DiVincenzo's criteria
* Quantum information
* Quantum programming
* Quantum processors
* Cloud-based quantum computing
* Timeline of quantum computing

Theorems|

* Bell's theorem
* Gleason's theorem
* Gottesman–Knill theorem
* Holevo's theorem
* Margolus–Levitin theorem
* No-broadcast theorem
* No-cloning theorem
* No-communication theorem
* No-deleting theorem
* No-hiding theorem
* No-teleportation theorem
* PBR theorem
* Quantum threshold theorem

Quantum
communication|

* Quantum capacity
* Classical capacity
* Entanglement-assisted classical capacity
* Quantum channel
* Quantum network
* Quantum cryptography
* Quantum key distribution
* BB84
* SARG04
* Three-stage quantum cryptography protocol
* Quantum teleportation
* Superdense coding
* LOCC
* Entanglement distillation

Quantum algorithms|

* Universal quantum simulator
* Deutsch–Jozsa algorithm
* Grover's algorithm
* Quantum Fourier transform
* Shor's algorithm
* Simon's problem
* Quantum phase estimation algorithm
* Quantum counting algorithm
* Quantum annealing
* Quantum algorithm for linear systems of equations
* Amplitude amplification

Quantum
complexity theory|

* Quantum Turing machine
* EQP
* BQP
* QMA
* PostBQP
* QIP

Quantum
computing models|

* Quantum circuit
* Quantum logic gate
* One-way quantum computer
* cluster state
* Adiabatic quantum computation
* Topological quantum computer

Quantum
error correction|

* Stabilizer codes
* Entanglement-Assisted Quantum Error Correction
* Shor code
* Steane code
* CSS code
* Quantum convolutional codes
* Toric code

Physical
implementations|

| Quantum optics|

* Cavity QED
* Circuit QED
* Linear optical quantum computing
* KLM protocol
* Boson sampling

|

Ultracold atoms|

* Trapped ion quantum computer
* Optical lattice

Spin-based|

* Nuclear magnetic resonance QC
* Kane QC
* Loss–DiVincenzo QC
* Nitrogen-vacancy center

Superconducting
quantum computing|

* Charge qubit
* Flux qubit
* Phase qubit
* Transmon

Software|

* libquantum
* OpenQASM
* Q#
* Qiskit
* IBM Q Experience

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Parity measurement. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Parity_measurement&oldid=330873"
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template