fidelities of quantum arq protocol alexei ashikhmin bell labs classical automatic repeat request...
DESCRIPTION
The state (pure) of qubits is a vector Manipulating by qubits, we effectively manipulate by complex coefficients of As a result we obtain a significant (sometimes exponential) speed up qubits QubitsTRANSCRIPT
![Page 1: Fidelities of Quantum ARQ Protocol Alexei Ashikhmin Bell Labs Classical Automatic Repeat Request (ARQ) Protocol Qubits, von Neumann Measurement, Quantum](https://reader033.vdocuments.mx/reader033/viewer/2022050814/5a4d1b917f8b9ab0599c1058/html5/thumbnails/1.jpg)
Fidelities of Quantum ARQ Protocol Alexei Ashikhmin
Bell Labs
Classical Automatic Repeat Request (ARQ) Protocol Qubits, von Neumann Measurement, Quantum Codes Quantum Automatic Repeat Request (ARQ) Protocol Quantum Errors Quantum Enumerators Fidelity of Quantum ARQ Protocol
• Quantum Codes of Finite Lengths• The asymptotical Case (the code length )
Some results from the paper “Quantum Error Detection”, by A. Ashikhmin,A. Barg, E. Knill, and S. Litsyn are used in this talk
![Page 2: Fidelities of Quantum ARQ Protocol Alexei Ashikhmin Bell Labs Classical Automatic Repeat Request (ARQ) Protocol Qubits, von Neumann Measurement, Quantum](https://reader033.vdocuments.mx/reader033/viewer/2022050814/5a4d1b917f8b9ab0599c1058/html5/thumbnails/2.jpg)
• is a parity check matrix of a code
• Compute syndrome
• If we detect an error
• If , but we have an undetected error
Classical ARQ Protocol
Noisy Channel
![Page 3: Fidelities of Quantum ARQ Protocol Alexei Ashikhmin Bell Labs Classical Automatic Repeat Request (ARQ) Protocol Qubits, von Neumann Measurement, Quantum](https://reader033.vdocuments.mx/reader033/viewer/2022050814/5a4d1b917f8b9ab0599c1058/html5/thumbnails/3.jpg)
• The state (pure) of qubits is a vector
• Manipulating by qubits, we effectively manipulate by
complex coefficients of
• As a result we obtain a significant (sometimes exponential)
speed up
qubits
Qubits
![Page 4: Fidelities of Quantum ARQ Protocol Alexei Ashikhmin Bell Labs Classical Automatic Repeat Request (ARQ) Protocol Qubits, von Neumann Measurement, Quantum](https://reader033.vdocuments.mx/reader033/viewer/2022050814/5a4d1b917f8b9ab0599c1058/html5/thumbnails/4.jpg)
• In this talk all complex vectors are assumed to be
normalized, i.e.
• All normalization factors are omitted to make notation short
![Page 5: Fidelities of Quantum ARQ Protocol Alexei Ashikhmin Bell Labs Classical Automatic Repeat Request (ARQ) Protocol Qubits, von Neumann Measurement, Quantum](https://reader033.vdocuments.mx/reader033/viewer/2022050814/5a4d1b917f8b9ab0599c1058/html5/thumbnails/5.jpg)
• is projected on with probability
• is projected on with probability
• We know to which subspace was projected
von Neumann Measurementand orthogonal subspaces,
is the orthogonal projection on is the orthogonal projection on
![Page 6: Fidelities of Quantum ARQ Protocol Alexei Ashikhmin Bell Labs Classical Automatic Repeat Request (ARQ) Protocol Qubits, von Neumann Measurement, Quantum](https://reader033.vdocuments.mx/reader033/viewer/2022050814/5a4d1b917f8b9ab0599c1058/html5/thumbnails/6.jpg)
1 2 k… k+1 n…
information qubitsin state
n1 2 …
quantum codewordin the state
unitary rotation
Quantum Codes
redundant qubitsin the ground states
is the code space
is the code rate
the joint state:
![Page 7: Fidelities of Quantum ARQ Protocol Alexei Ashikhmin Bell Labs Classical Automatic Repeat Request (ARQ) Protocol Qubits, von Neumann Measurement, Quantum](https://reader033.vdocuments.mx/reader033/viewer/2022050814/5a4d1b917f8b9ab0599c1058/html5/thumbnails/7.jpg)
ARQ protocol: – We transmit a code state – Receive – Measure with respect to and – If the result of the measurement belongs
to we ask to repeat transmission – Otherwise we use
Quantum ARQ Protocol
is fidelity
If is close to 1 we can use
![Page 8: Fidelities of Quantum ARQ Protocol Alexei Ashikhmin Bell Labs Classical Automatic Repeat Request (ARQ) Protocol Qubits, von Neumann Measurement, Quantum](https://reader033.vdocuments.mx/reader033/viewer/2022050814/5a4d1b917f8b9ab0599c1058/html5/thumbnails/8.jpg)
Conditional Fidelity
The conditional fidelity is the average value ofunder the condition that is projected on
Recall that the probability that is projected on is equal to
Quantum ARQ Protocol
![Page 9: Fidelities of Quantum ARQ Protocol Alexei Ashikhmin Bell Labs Classical Automatic Repeat Request (ARQ) Protocol Qubits, von Neumann Measurement, Quantum](https://reader033.vdocuments.mx/reader033/viewer/2022050814/5a4d1b917f8b9ab0599c1058/html5/thumbnails/9.jpg)
• Quantum computer is unavoidably vulnerable to errors
• Any quantum system is not completely isolated from the environment
• Uncertainty principle – we can not simultaneously reduce: – laser intensity and phase fluctuations – magnetic and electric fields fluctuations – momentum and position of an ion
• The probability of spontaneous emission is always greater than 0
• Leakage error – electron moves to a third level of energy
Quantum Errors
![Page 10: Fidelities of Quantum ARQ Protocol Alexei Ashikhmin Bell Labs Classical Automatic Repeat Request (ARQ) Protocol Qubits, von Neumann Measurement, Quantum](https://reader033.vdocuments.mx/reader033/viewer/2022050814/5a4d1b917f8b9ab0599c1058/html5/thumbnails/10.jpg)
Depolarizing Channel (Standard Error Model) Depolarizing Channel
means the absence of error
are the flip, phase, and flip-phase errors respectively
This is an analog of the classical quaternary symmetric channel
Quantum Errors
![Page 11: Fidelities of Quantum ARQ Protocol Alexei Ashikhmin Bell Labs Classical Automatic Repeat Request (ARQ) Protocol Qubits, von Neumann Measurement, Quantum](https://reader033.vdocuments.mx/reader033/viewer/2022050814/5a4d1b917f8b9ab0599c1058/html5/thumbnails/11.jpg)
Similar to the classical case we can define the weight of error:
Obviously
Quantum Errors
![Page 12: Fidelities of Quantum ARQ Protocol Alexei Ashikhmin Bell Labs Classical Automatic Repeat Request (ARQ) Protocol Qubits, von Neumann Measurement, Quantum](https://reader033.vdocuments.mx/reader033/viewer/2022050814/5a4d1b917f8b9ab0599c1058/html5/thumbnails/12.jpg)
Quantum Enumerators
P. Shor and R. Laflamme: is a code with the orthogonal projector
![Page 13: Fidelities of Quantum ARQ Protocol Alexei Ashikhmin Bell Labs Classical Automatic Repeat Request (ARQ) Protocol Qubits, von Neumann Measurement, Quantum](https://reader033.vdocuments.mx/reader033/viewer/2022050814/5a4d1b917f8b9ab0599c1058/html5/thumbnails/13.jpg)
• and are connected by quaternary MacWilliams identities
where are quaternary Krawtchouk polynomials:
•
• The dimension of is
• is the smallest integer s. t. then can correct any
errors
Quantum Enumerators
![Page 14: Fidelities of Quantum ARQ Protocol Alexei Ashikhmin Bell Labs Classical Automatic Repeat Request (ARQ) Protocol Qubits, von Neumann Measurement, Quantum](https://reader033.vdocuments.mx/reader033/viewer/2022050814/5a4d1b917f8b9ab0599c1058/html5/thumbnails/14.jpg)
• In many cases are known or can be accurately estimated (especially for quantum stabilizer codes)
• For example, the Steane code (encodes 1 qubit into 7 qubits):
Quantum Enumerators
• and therefore this code can correct any single ( since ) error
![Page 15: Fidelities of Quantum ARQ Protocol Alexei Ashikhmin Bell Labs Classical Automatic Repeat Request (ARQ) Protocol Qubits, von Neumann Measurement, Quantum](https://reader033.vdocuments.mx/reader033/viewer/2022050814/5a4d1b917f8b9ab0599c1058/html5/thumbnails/15.jpg)
Fidelity of Quantum ARQ Protocol
Theorem
The conditional fidelity is the average value ofunder the condition that is projected on
Recall that the probability that is projected on is equal to
![Page 16: Fidelities of Quantum ARQ Protocol Alexei Ashikhmin Bell Labs Classical Automatic Repeat Request (ARQ) Protocol Qubits, von Neumann Measurement, Quantum](https://reader033.vdocuments.mx/reader033/viewer/2022050814/5a4d1b917f8b9ab0599c1058/html5/thumbnails/16.jpg)
Lemma (representation theory) Let be a compact group, is aunitary representation of , and is the Haar measure. Then
Lemma
![Page 17: Fidelities of Quantum ARQ Protocol Alexei Ashikhmin Bell Labs Classical Automatic Repeat Request (ARQ) Protocol Qubits, von Neumann Measurement, Quantum](https://reader033.vdocuments.mx/reader033/viewer/2022050814/5a4d1b917f8b9ab0599c1058/html5/thumbnails/17.jpg)
Quantum Codes of Finite Lengths
We can numerically compute upper and lower bounds on , (recall that )
Fidelity of the Quantum ARQ Protocol
![Page 18: Fidelities of Quantum ARQ Protocol Alexei Ashikhmin Bell Labs Classical Automatic Repeat Request (ARQ) Protocol Qubits, von Neumann Measurement, Quantum](https://reader033.vdocuments.mx/reader033/viewer/2022050814/5a4d1b917f8b9ab0599c1058/html5/thumbnails/18.jpg)
Fidelity of the Quantum ARQ Protocol
Sketch: • using the MacWilliams identities • we obtain
• using inequalities we can
formulate LP problems for enumerator and denominator
![Page 19: Fidelities of Quantum ARQ Protocol Alexei Ashikhmin Bell Labs Classical Automatic Repeat Request (ARQ) Protocol Qubits, von Neumann Measurement, Quantum](https://reader033.vdocuments.mx/reader033/viewer/2022050814/5a4d1b917f8b9ab0599c1058/html5/thumbnails/19.jpg)
For the famous Steane code (encodes 1 qubit into 7 qubits) we have:
Fidelity of the Quantum ARQ Protocol
![Page 20: Fidelities of Quantum ARQ Protocol Alexei Ashikhmin Bell Labs Classical Automatic Repeat Request (ARQ) Protocol Qubits, von Neumann Measurement, Quantum](https://reader033.vdocuments.mx/reader033/viewer/2022050814/5a4d1b917f8b9ab0599c1058/html5/thumbnails/20.jpg)
Lemma The probability that will be projected onto equals
Hence we can consider as a function of
Fidelity of the Quantum ARQ Protocol
![Page 21: Fidelities of Quantum ARQ Protocol Alexei Ashikhmin Bell Labs Classical Automatic Repeat Request (ARQ) Protocol Qubits, von Neumann Measurement, Quantum](https://reader033.vdocuments.mx/reader033/viewer/2022050814/5a4d1b917f8b9ab0599c1058/html5/thumbnails/21.jpg)
• Let be the known optimal code encoding 1 qubit into 5 qubits
• Let be code that encodes 1 qubit into 5 qubits defined by the generator matrix:
• is not optimal at all
Fidelity of the Quantum ARQ Protocol
![Page 22: Fidelities of Quantum ARQ Protocol Alexei Ashikhmin Bell Labs Classical Automatic Repeat Request (ARQ) Protocol Qubits, von Neumann Measurement, Quantum](https://reader033.vdocuments.mx/reader033/viewer/2022050814/5a4d1b917f8b9ab0599c1058/html5/thumbnails/22.jpg)
Fidelity of the Quantum ARQ Protocol
![Page 23: Fidelities of Quantum ARQ Protocol Alexei Ashikhmin Bell Labs Classical Automatic Repeat Request (ARQ) Protocol Qubits, von Neumann Measurement, Quantum](https://reader033.vdocuments.mx/reader033/viewer/2022050814/5a4d1b917f8b9ab0599c1058/html5/thumbnails/23.jpg)
Theorem ( threshold behavior ) Asymptotically, as , we have
Theorem (the error exponent) For we have
The Asymptotic Case Fidelity of the Quantum ARQ Protocol
(if Q encodes qubits into qubits its rate is )
![Page 24: Fidelities of Quantum ARQ Protocol Alexei Ashikhmin Bell Labs Classical Automatic Repeat Request (ARQ) Protocol Qubits, von Neumann Measurement, Quantum](https://reader033.vdocuments.mx/reader033/viewer/2022050814/5a4d1b917f8b9ab0599c1058/html5/thumbnails/24.jpg)
Existence bound
Fidelity of the Quantum ARQ Protocol
Theorem There exists a quantum code Q with the binomial weight enumerators:
Substitution of these into
gives the existence bound on
Upper bound is much more difficult
![Page 25: Fidelities of Quantum ARQ Protocol Alexei Ashikhmin Bell Labs Classical Automatic Repeat Request (ARQ) Protocol Qubits, von Neumann Measurement, Quantum](https://reader033.vdocuments.mx/reader033/viewer/2022050814/5a4d1b917f8b9ab0599c1058/html5/thumbnails/25.jpg)
Fidelity of the Quantum ARQ Protocol
Sketch: • Primal LP problem:
• subject to constrains:
![Page 26: Fidelities of Quantum ARQ Protocol Alexei Ashikhmin Bell Labs Classical Automatic Repeat Request (ARQ) Protocol Qubits, von Neumann Measurement, Quantum](https://reader033.vdocuments.mx/reader033/viewer/2022050814/5a4d1b917f8b9ab0599c1058/html5/thumbnails/26.jpg)
Fidelity of the Quantum ARQ Protocol • From the dual LP problem we obtain:
Theorem Let and be s.t.
then
Good solution: