REVIEW 6 cited by
Breaking even with magic: demonstration of a high-fidelity logical non-Clifford gate
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Encoding quantum information to protect it from errors is essential for performing large-scale quantum computations. Performing a universal set of quantum gates on encoded states demands a potentially large resource overhead and minimizing this overhead is key for the practical development of large-scale fault-tolerant quantum computers. We propose and experimentally implement a magic-state preparation protocol to fault-tolerantly prepare a pair of logical magic states in a [[6,2,2]] quantum error-detecting code using only eight physical qubits. Implementing this protocol on H1-1, a 20 qubit trapped-ion quantum processor, we prepare magic states with experimental infidelity $7^{+3}_{-1}\times 10^{-5}$ with a $14.8^{+1}_{-1}\%$ discard rate and use these to perform a fault-tolerant non-Clifford gate, the controlled-Hadamard (CH), with logical infidelity $\leq 2.3^{+9}_{-9}\times 10^{-4}$. Notably, this significantly outperforms the unencoded physical CH infidelity of $10^{-3}$. Through circuit-level stabilizer simulations, we show that this protocol can be self-concatenated to produce extremely high-fidelity magic states with low space-time overhead in a [[36,4,4]] quantum error correcting code, with logical error rates of $6\times 10^{-10}$ ($5\times 10^{-14}$) at two-qubit error rate of $10^{-3}$ ($10^{-4}$) respectively.
Forward citations
Cited by 6 Pith papers
-
Efficient simulation of logical magic state preparation protocols
A classical simulation method that propagates circuit-level Pauli noise to a Clifford error makes logical magic-state preparation protocols simulable in time polynomial in qubits and the target state's stabilizer rank.
-
Efficient certification of intractable quantum states with few Pauli measurements
The paper claims Clifford-enhanced product states can be certified with O(n^2/epsilon^2) Pauli measurements in the i.i.d. setting and polynomially many in the adversarial setting, but the central estimator is derived ...
-
Theoretical and experimental analysis of adaptive quantum computers
Under a worst-case noise model, adaptive GHZ and W-state preparation can exponentially beat non-adaptive circuits only in narrow gate-vs-idling error regimes, and current IBM hardware is too noisy and too restricted t...
-
Efficient and scalable inter-module switching for distributed quantum computing architectures
GMZI-based decentralized switch designs achieve any-to-any module connectivity with half the active depth and coupler count of GMZI-Spanke switches.
-
Efficient Qudit Circuit for Quench Dynamics of $2+1$D Quantum Link Electrodynamics
A matter-integrated-out reformulation of 2+1D U(1) quantum link electrodynamics is translated into explicit qudit circuits, with Trotterized simulations matching exact dynamics on small lattices.
-
Demonstration of measurement-free universal fault-tolerant quantum computation
A trapped-ion experiment realizes measurement-free fault-tolerant logical teleportation, a universal logical gate set, and a three-logical-qubit Grover search, albeit with success below the classical baseline.
Discussion (0). Continue with ORCID to comment.