An entanglement distillation protocol is introduced that utilizes an arbitrary stabilizer code to convert raw copies of an arbitrary Greenberger-Horne-Zeilinger (GHZ) state into logical copies in the presence of Pauli noise, and it is proved that some stabilizer codes can distill any stabilizer state with this protocol.
Abstract
We introduce an entanglement distillation protocol that utilizes an arbitrary $[[n,k,d]]$ stabilizer code to convert $n$ raw copies of an $N$-qubit Greenberger-Horne-Zeilinger (GHZ) state into $k$ logical copies in the presence of Pauli noise. Our explicit formulation of the scheme on a star network topology is efficiently scalable to arbitrary $N$, requires only local operations, and minimizes the impact of errors on idle physical qubits, enabling the distribution of high-fidelity entangled logical states between any number of quantum processors. We report the results of numerical experiments using the 5-qubit code, toric code, and $[[144,12,12]]$ bivariate bicyle code to protect against independent single-qubit depolarizing noise on all qubits. Our encoding scheme improves the final GHZ state fidelity relative to a single bare GHZ state sent over the same noisy channel for depolarizing rates up to or above $6 \%$ for all codes tested. Additionally, we use the stabilizer formalism to prove that our protocol can be applied to any $N$-qubit Calderbank-Shor-Steane (CSS) stabilizer state, from which the GHZ state emerges as a special case. This result explicitly establishes the working principle of previous stabilizer-based Bell pair and GHZ state distillation schemes, and generalizes such protocols beyond the traditionally considered states. We also show that some stabilizer codes can distill any stabilizer state with our protocol.
We theoretically introduce a quantum-circuit synthesis protocol to realize any $n$-qubit transformation $U\in U(2^n)$, up to a diagonal. The resulting circuit is directly native to and optimal in gate count and depth for systems where bitstring-conditioned rotations with tunable angle and axis, $C^{(n-1)}R(\theta,\phi)...
Heikki Suominen, Suman Kundu, Heidi Kivijärvi et al.· 0 citations
We construct a two-parameter family of single-error-correcting seven-ququart codes with transversal $\tilde{A_7}$ symmetry, realizing the finite component of a two-qubit super-golden gate set. These $((7,4,3))_4$ codes encode two logical qubits and support non-Clifford operations by applying the same gate to each physi...
We demonstrate high-fidelity logical qubit operations using \texttt{ibm\_phoenix}, a square-lattice array of 120 coupled superconducting qubits that are capable of fast reset. Using strategies to exclude underperforming components together with noise informed decoding, we routinely produce surface codes at distance-3 a...
Robin Harper, X. C. Kolesnikow, Campbell K. McLauchlan et al.· 0 citations
Consider the task of identifying an unknown classical codeword delivered to a register of quantum sensor qubits through a sequence of weak phase interactions that each encode one bit. Suppose that each received bit controls an identical $Z$-rotation of angle $\theta$ applied to every sensor qubit; receivers may also us...
John Blue, Zachary E. Chin, Vlad S. Oros et al.· 0 citations
The first experimental demonstration of distributed quantum error detection and correction is reported, providing an experimental foundation for quantum error correction (QEC) across modular quantum architectures.
E. M. Ainley, A. Agrawal, T. Araki et al.· 2 citations
We construct Clifford+$T$ circuits implementing arbitrary $n$-qubit unitaries with worst-case $T$-count $\widetilde{O}(N^{8/7})$ at constant operator-norm error, where $N=2^n$, improving the previous exponent $5/4$. The construction uses $\widetilde{O}(N^{6/7})$ clean ancillas. The main idea is to reduce the data addre...
Diyi Liu, Shu-Chen Zhu, Wibe A. de Jong et al.· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.