Error Crafting in Mixed Quantum Gate Synthesis

• URL: http://arxiv.org/abs/2405.15565v2
• Date: Wed, 15 Jan 2025 06:52:22 GMT
• Title: Error Crafting in Mixed Quantum Gate Synthesis
• Authors: Nobuyuki Yoshioka, Seiseki Akibue, Hayata Morisaki, Kento Tsubouchi, Yasunari Suzuki,
• Abstract summary: We craft the remnant error of arbitrary single-qubit unitaries to be Pauli and depolarizing errors.<n>For Pauli rotation gates, in particular, the crafting enables us to suppress the remnant error up to cubic order.<n>Our work opens a novel avenue in quantum circuit design and architecture that orchestrates error countermeasures.
• Score: 0.16777183511743468
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In fault-tolerant quantum computing, errors in unitary gate synthesis is comparable with noise inherent in the gates themselves. While mixed synthesis can suppress such coherent errors quadratically, there is no clear understanding on its remnant error, which hinders us from designing a holistic and practical error countermeasure. In this work, we propose that the classical characterizability of synthesis error can be exploited; remnant errors can be crafted to satisfy desirable properties. We prove that we can craft the remnant error of arbitrary single-qubit unitaries to be Pauli and depolarizing errors, while the conventional twirling cannot be applied in general. For Pauli rotation gates, in particular, the crafting enables us to suppress the remnant error up to cubic order, which results in synthesis with a T-count of $\log_2(1/\varepsilon)$ up to accuracy of $\varepsilon=10^{-9}$. Our work opens a novel avenue in quantum circuit design and architecture that orchestrates error countermeasures.

Related papers

• Universal quantum computation via scalable measurement-free error correction [45.29832252085144]
  We show that universal quantum computation can be made fault-tolerant in a scenario where the error-correction is implemented without mid-circuit measurements. We introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $mathitCCZ$ gate. In particular, our findings support that below-breakeven logical performance is achievable with a circuit-level error rate below $10-3$.
  arXiv  Detail & Related papers  (2024-12-19T18:55:44Z)
• Robust Error Accumulation Suppression for Quantum Circuits [0.6282171844772421]
  We present a robust error accumulation suppression technique to manage errors in quantum computers. For coherent errors, we show a reduction of the error scaling in an $L$-depth circuit from $O(sqrtL)$ to $O(sqrtL)$. We derive the general form of decoherence noise that can be suppressed by REAS.
  arXiv  Detail & Related papers  (2024-01-30T10:38:53Z)
• Fault-tolerant quantum computation using large spin cat-codes [0.8640652806228457]
  We construct a fault-tolerant quantum error-correcting protocol based on a qubit encoded in a large spin qudit using a spin-cat code. We show how to generate a universal gate set, including the rank-preserving CNOT gate, using quantum control and the Rydberg blockade. These findings pave the way for encoding a qubit in a large spin with the potential to achieve fault tolerance, high threshold, and reduced resource overhead in quantum information processing.
  arXiv  Detail & Related papers  (2024-01-08T22:56:05Z)
• Normal quantum channels and Markovian correlated two-qubit quantum errors [77.34726150561087]
  We study general normally'' distributed random unitary transformations. On the one hand, a normal distribution induces a unital quantum channel. On the other hand, the diffusive random walk defines a unital quantum process.
  arXiv  Detail & Related papers  (2023-07-25T15:33:28Z)
• Demonstrating a long-coherence dual-rail erasure qubit using tunable transmons [59.63080344946083]
  We show that a "dual-rail qubit" consisting of a pair of resonantly coupled transmons can form a highly coherent erasure qubit. We demonstrate mid-circuit detection of erasure errors while introducing $ 0.1%$ dephasing error per check. This work establishes transmon-based dual-rail qubits as an attractive building block for hardware-efficient quantum error correction.
  arXiv  Detail & Related papers  (2023-07-17T18:00:01Z)
• Probabilistic state synthesis based on optimal convex approximation [1.2277343096128712]
  We show that the optimal probabilistic synthesis quadratically reduces the approximation error. We also numerically demonstrate how this conversion halves an information-theoretic lower bound on the circuit size.
  arXiv  Detail & Related papers  (2023-03-20T04:43:21Z)
• Characterizing non-Markovian Off-Resonant Errors in Quantum Gates [0.11249583407496219]
  We describe a class of coherent non-Markovian errors -- excitations due to an off-resonant drive. Off-resonant excitations potentially limit any architectures that use frequency selectivity.
  arXiv  Detail & Related papers  (2023-02-21T18:55:24Z)
• 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)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• Quantum Error Correction with Gauge Symmetries [69.02115180674885]
  Quantum simulations of Lattice Gauge Theories (LGTs) are often formulated on an enlarged Hilbert space containing both physical and unphysical sectors. We provide simple fault-tolerant procedures that exploit such redundancy by combining a phase flip error correction code with the Gauss' law constraint.
  arXiv  Detail & Related papers  (2021-12-09T19:29:34Z)
• Software mitigation of coherent two-qubit gate errors [55.878249096379804]
  Two-qubit gates are important components of quantum computing. But unwanted interactions between qubits (so-called parasitic gates) can degrade the performance of quantum applications. We present two software methods to mitigate parasitic two-qubit gate errors.
  arXiv  Detail & Related papers  (2021-11-08T17:37:27Z)
• Composability of global phase invariant distance and its application to approximation error management [0.0]
  A quantum compiler synthesizes each approximately synthesizable unitary up to some approximation error. In this paper we consider the case when the errors are measured in the global phase invariant distance.
  arXiv  Detail & Related papers  (2021-06-13T22:06:17Z)
• Hidden Inverses: Coherent Error Cancellation at the Circuit Level [3.3012851255362494]
  Coherent gate errors are a concern in many proposed quantum computing architectures. We benchmark our coherent errors by comparing the actual performance of composite single-qubit gates to the predicted performance. We propose a compilation technique, which we refer to as hidden inverses, that creates circuits robust to these coherent errors.
  arXiv  Detail & Related papers  (2021-04-02T15:57:48Z)
• Autonomous quantum error correction and quantum computation [3.1541105002077714]
  We present a general theoretical framework for the study of autonomously corrected quantum devices. We identify a necessary and sufficient revised version of the Knill-Laflamme conditions for the existence of an engineered Lindbladian. We demonstrate that engineered dissipation can be combined with generalized realizations of error-transparent Hamiltonians.
  arXiv  Detail & Related papers  (2021-03-08T19:00:03Z)
• Fusion-based quantum computation [43.642915252379815]
  Fusion-based quantum computing (FBQC) is a model of universal quantum computation in which entangling measurements, called fusions, are performed on qubits of small constant-sized entangled resource states. We introduce a stabilizer formalism for analyzing fault tolerance and computation in these schemes. This framework naturally captures the error structure that arises in certain physical systems for quantum computing, such as photonics.
  arXiv  Detail & Related papers  (2021-01-22T20:00:22Z)
• 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.