Benchmarking logical three-qubit quantum Fourier transform encoded in the Steane code on a trapped-ion quantum computer
read the original abstract
We implement logically encoded three-qubit circuits for the quantum Fourier transform (QFT), using the [[7,1,3]] Steane code, and benchmark the circuits on the Quantinuum H2-1 trapped-ion quantum computer. The circuits require multiple logical two-qubit gates, which are implemented transversally, as well as logical non-Clifford single-qubit rotations, which are performed by non-fault-tolerant state preparation followed by a teleportation gadget. First, we benchmark individual logical components using randomized benchmarking for the logical two-qubit gate, and a Ramsey-type experiment for the logical $T$ gate. We then implement the full QFT circuit, using two different methods for performing a logical control-$T$, and benchmark the circuits by applying it to each basis state in a set of bases that is sufficient to lower bound the process fidelity. We compare the logical QFT benchmark results to predictions based on the logical component benchmarks.
This paper has not been read by Pith yet.
Forward citations
Cited by 11 Pith papers
-
LightStim: A Framework for QEC Protocol Evaluation and Prototyping with Automated DEM Construction
LightStim automates DEM construction for QEC protocols via an augmented Pauli tableau during compilation, matching public tools on detector counts and error rates while enabling new cross-code designs.
-
Error-corrected phase estimation averaged over variable grids on a trapped-ion quantum computer: hyperacuity spectra of a CO molecule adsorbed onto $\chi$-Fe$_5$C$_2$
QAVG reconstructs sub-resolution excitation spectra of a CO/χ-Fe5C2 model via averaged variable-grid QPE on Quantinuum H2-2 with Steane-code error correction.
-
Syndrome resampling enhances quantum error correction thresholds
Syndrome resampling increases QEC thresholds and cuts logical errors by up to four orders of magnitude by biasing toward likely syndromes, linked to Rényi coherent information phase transitions.
-
Novelty-Based Generation of Continuous Landscapes with Diverse Local Optima Networks
LightStim automates DEM construction for QEC protocols via a record-augmented Pauli tableau tracker, validated across memory, logical operations, distillation, and a novel cross-code lattice surgery design.
-
Quantum Error-Corrected Computation of Molecular Energies
First end-to-end demonstration of quantum error correction integrated with quantum phase estimation to compute molecular hydrogen ground-state energy to 0.001(13) hartree accuracy on Quantinuum H2-2 hardware.
-
Optimizing bias-tailored quantum error correction beyond code-capacity noise
Under circuit-level noise the predicted advantage of bias-optimized rectangular surface codes over XZZX codes vanishes, while a new bias-filtering CNOT gadget recovers only a few-percent threshold improvement for XZZX codes.
-
LightStim: A Framework for QEC Protocol Evaluation and Prototyping with Automated DEM Construction
A tree-encoded fusion scheme and MemTree compiler suppress fusion erasure errors in photonic MBQC, achieving large execution-time reductions over prior compilers with real-hardware validation.
-
Novelty-Based Generation of Continuous Landscapes with Diverse Local Optima Networks
Novelty search generates diverse continuous multimodal landscapes with direct basin definitions, enabling low-cost local optima networks whose features predict evolutionary algorithm performance.
-
Fully convolutional 3D neural network decoders for surface codes with syndrome circuit noise
A 3D convolutional neural network decoder for surface codes with circuit noise generalizes to distance-97 codes with thresholds up to 0.7% depolarizing noise and improved latency over MWPM above distance 33.
-
High-speed and high-connectivity two-qubit gates in long chains of trapped ions
Impulsive spin-dependent excitation enables high-fidelity non-local entangling gates between arbitrary ion pairs in chains of up to 40 trapped ions within 1.3-2 center-of-mass oscillation periods.
-
Weakly Fault-Tolerant Computation in a Quantum Error-Detecting Code
Constructions for universal quantum computation in the [[n,n-2,2]] error-detecting code detect single-gate errors at computation end, providing weak fault tolerance with reduced overhead versus full error correction.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.