Sampling hard circuits with verifiably high fidelity

• URL: http://arxiv.org/abs/2607.25941v1
• Date: Tue, 28 Jul 2026 16:26:56 GMT
• Title: Sampling hard circuits with verifiably high fidelity
• Abstract summary: We introduce structured circuits, which admit an encoding in a quantum code.<n>This allows us to simultaneously reach high fidelities at high circuit depths, and to certify an experimental fidelity.<n>We demonstrate our proposal with a $70$-qubit, depth-$70$ Clifford circuit doped with $468$ $T$ gates.
• Score: 0.9840002506848337
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Sampling-based proposals are prominent candidates for demonstrating quantum computations beyond the reach of classical supercomputers. However, it has been difficult to combine their complexity-theoretic hardness with two capabilities needed for scalable quantum computing more generally: suppressing hardware errors, and verifying the quantum computation itself. Here we address both issues by introducing structured circuits, which, in addition to provable hardness guarantees, admit an encoding in a quantum code. This allows us to simultaneously reach high fidelities at high circuit depths, and to certify an experimental fidelity via the circuit structure and measurement of code syndromes. The resulting certificate is device dependent, but requires substantially weaker noise assumptions than existing fidelity proxy benchmarks. We demonstrate our proposal with a $70$-qubit, depth-$70$ Clifford circuit doped with $468$ $T$ gates. We use a total of $97$ physical qubits to encode this computation in spacetime codes, effectively suppressing gate error rates by $10\times$ after syndrome post-selection, and yielding a state with a fidelity lower bound of $0.284$ with $95\%$ confidence. Our construction is a systematic method for promoting a stabilizer state to a magic state while keeping an error-detected fidelity certificate.

Related papers

• Efficient quantum state preparation on Quantinuum hardware [5.8774791521019765]
  We have demonstrated an end-to-end framework that combines resource-efficient quantum state preparation with rapid, robust fidelity verification on near-term quantum hardware.<n>We achieved a high hardware fidelity of $F_mathrmhw = 0.929$ on the Quantinuum H2-1 trapped-ion platform.
  arXiv  Detail & Related papers  (2026-09-08T08:23:15Z)
• Verifiable quantum advantage in extremely low depth [52.51019642214249]
  We give a problem that is solvable by shallow quantum circuits, hard for computation in time under lattice-based assumptions.<n>We prove that shallow quantum circuits have sufficient structure to solve certain classically hard tasks whose solutions can be verified efficiently.
  arXiv  Detail & Related papers  (2026-09-01T15:54:34Z)
• Fault-Tolerant Quantum Error Correction: Implementing Hamming-Based Codes with Advanced Syndrome Extraction Techniques [0.0]
  We show that intelligent ancilla management improves error suppression by up to 2.4$times$ compared to standard approaches.<n>Our implementations achieve logical error rates as low as $5.1 times 10-5$ under realistic noise conditions.<n>These results provide immediately deployable tools for near-term quantum devices.
  arXiv  Detail & Related papers  (2026-01-10T00:10:52Z)
• Quantum subspace verification for error correction codes [13.856955493134908]
  We introduce a framework of quantum subspace verification, employing the knowledge of quantum error correction code subspaces to reduce the potential measurement budgets. For certain codes like the notable Calderbank-Shor-Steane codes and QLDPC stabilizer codes, the setting number and sample complexity can be significantly reduced. By combining the proposed subspace verification and direct fidelity estimation, we construct a protocol to verify the fidelity of general magic logical states.
  arXiv  Detail & Related papers  (2024-10-16T13:28:33Z)
• Fault-tolerant compiling of classically hard IQP circuits on hypercubes [34.225996865725605]
  We develop a hardware-efficient, fault-tolerant approach to realizing quantum sampling circuits.<n>We develop a theory of second-moment properties of degree-$D$ IQP circuits for analyzing hardness and verification of random sampling.<n>Our results highlight fault-tolerant compiling as a powerful tool in co-configurable algorithms with specific error-correcting codes and realistic hardware.
  arXiv  Detail & Related papers  (2024-04-29T18:00:03Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Universal qudit gate synthesis for transmons [44.22241766275732]
  We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
  arXiv  Detail & Related papers  (2022-12-08T18:59:53Z)
• Universal logic with encoded spin qubits in silicon [1.5796098351442824]
  Qubits encoded in a decoherence-free subsystem and realized in exchange-coupled silicon quantum dots are promising candidates for fault-tolerant quantum computing. Key difficulties are that encoded entangling gates require a large number of control pulses and high-yielding quantum dot arrays. Here we show a device made using the single-layer etch-defined gate architecture that achieves both the required functional yield needed for full control and the coherence necessary for thousands of exchange pulses to be applied.
  arXiv  Detail & Related papers  (2022-02-08T02:23:46Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Building a fault-tolerant quantum computer using concatenated cat codes [44.03171880260564]
  We present a proposed fault-tolerant quantum computer based on cat codes with outer quantum error-correcting codes. We numerically simulate quantum error correction when the outer code is either a repetition code or a thin rectangular surface code. We find that with around 1,000 superconducting circuit components, one could construct a fault-tolerant quantum computer.
  arXiv  Detail & Related papers  (2020-12-07T23:22:40Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.