Fault-tolerance in qudit circuit design

• URL: http://arxiv.org/abs/2202.06831v1
• Date: Mon, 14 Feb 2022 16:09:04 GMT
• Title: Fault-tolerance in qudit circuit design
• Authors: Michael Hanks and M.S. Kim
• Abstract summary: We show that qudits have the potential to reduce resource requirements from linear to logarithmic depth. For certain linear-depth circuits, additional error mitigation is possible via selective application of resources.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The efficient decomposition of multi-controlled gates is a significant factor in quantum compiling, both in circuit depth and T-gate count. Recent work has demonstrated that qudits have the potential to reduce resource requirements from linear to logarithmic depth and to avoid fractional phase rotations. Here we argue, based on the scaling of decoherence in high-index states, that circuit depth is not the primary factor, and that both the choice of entangling gate and interaction network topology act together to determine the spread of errors and ultimate failure rate in a circuit. We further show that for certain linear-depth circuits, additional error mitigation is possible via selective application of resources.

Related papers

• Logarithmic Depth Decomposition of Approximate Multi-Controlled Single-Qubit Gates Without Ancilla Qubits [0.9576327614980397]
  We present improved decompositions of multi-controlled NOT gates with logarithmic depth using a single ancilla qubit.<n>We also reduce the constant factors in the circuit depth compared to previous work.<n>Our method is particularly suitable for both NISQ and fault-tolerant quantum architectures.
  arXiv  Detail & Related papers  (2025-07-01T03:30:39Z)
• Multilevel Circuit Optimization in Quantum Compilers: A Case Study [0.6954287924634025]
  We explore multilevel circuit optimization (MLCO), where we deploy multiple gate sets and progressively lower the source circuit through the gate sets to the target circuit.<n>We demonstrate its effectiveness, using as a case study the source circuit for Hamiltonian simulation to solve a partial differential equation.<n>MLCO makes visible higher-level circuit structures, providing us with insights about how to simplify the circuits and how to decompose the gates.
  arXiv  Detail & Related papers  (2025-05-14T12:19:17Z)
• Optimization Driven Quantum Circuit Reduction [20.697821016522358]
  We propose three different transpilation approaches to substantially reduce circuit lengths without affecting functionality. The first variant is based on a search scheme, and the other variants are driven by a database retrieval scheme and a machine learning based decision support. We show that our proposed methods generate short quantum circuits for restricted gate sets, superior to the typical results obtained by using different qiskit optimization levels.
  arXiv  Detail & Related papers  (2025-02-20T16:41:10Z)
• Quantum Error Mitigation via Linear-Depth Verifier Circuits [0.044998333629984864]
  We provide a method for constructing verifier circuits for any quantum circuit that is accurately represented by a low-dimensional matrix product operator (MPO) By transpiling the circuits to a 2D array of qubits, we estimate the crossover point where the verifier circuit is shallower than the circuit itself, and hence useful for quantum error mitigation (QEM) We conclude that our approach may be useful for calibrating quantum sub-circuits to counter coherent noise but cannot correct for the incoherent noise present in current devices.
  arXiv  Detail & Related papers  (2024-11-05T16:44:18Z)
• Multi-qubit Lattice Surgery Scheduling [3.7126786554865774]
  A quantum circuit can be transpiled into a sequence of solely non-Clifford multi-qubit gates. We show that the transpilation significantly reduces the circuit length on the set of circuits tested. The resulting circuit of multi-qubit gates has a further reduction in the expected circuit execution time compared to serial execution.
  arXiv  Detail & Related papers  (2024-05-27T22:41:41Z)
• Designing high-fidelity two-qubit gates between fluxonium qubits [0.19528996680336308]
  We propose a two-qubit gate between fluxonium qubits for minimal error, speed, and control simplicity. Our architecture consists of two fluxoniums coupled via a linear resonator. We predict an open-system average CZ gate infidelity of $1.86 times 10-4$ in 70ns.
  arXiv  Detail & Related papers  (2024-03-12T01:56:21Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• 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)
• Measurement-induced phase transitions in sparse nonlocal scramblers [0.0]
  Measurement-induced phase transitions arise due to a competition between the scrambling of quantum information in a many-body system and local measurements. We study these transitions in different classes of fast scramblers, systems that scramble quantum information as quickly as is conjectured to be possible. We find that circuits featuring sparse nonlocal interactions are able to withstand substantially higher rates of local measurement.
  arXiv  Detail & Related papers  (2021-09-22T18:10:26Z)
• Engineering fast bias-preserving gates on stabilized cat qubits [64.20602234702581]
  bias-preserving gates can significantly reduce resource overhead for fault-tolerant quantum computing. In this work, we apply a derivative-based leakage suppression technique to overcome non-adiabatic errors.
  arXiv  Detail & Related papers  (2021-05-28T15:20:21Z)
• Noncyclic Geometric Quantum Gates with Smooth Paths via Invariant-based Shortcuts [4.354697470999286]
  We propose a scheme to realize geometric quantum gates with noncyclic and nonadiabatic evolution via invariant-based shortcuts. Our scheme provides a promising way to realize high-fidelity fault-tolerant quantum gates for scalable quantum computation.
  arXiv  Detail & Related papers  (2021-02-01T15:05:29Z)
• On the realistic worst case analysis of quantum arithmetic circuits [69.43216268165402]
  We show that commonly held intuitions when designing quantum circuits can be misleading. We show that reducing the T-count can increase the total depth. We illustrate our method on addition and multiplication circuits using ripple-carry.
  arXiv  Detail & Related papers  (2021-01-12T21:36:16Z)
• On estimating the entropy of shallow circuit outputs [49.1574468325115]
  Estimating the entropy of probability distributions and quantum states is a fundamental task in information processing. We show that entropy estimation for distributions or states produced by either log-depth circuits or constant-depth circuits with gates of bounded fan-in and unbounded fan-out is at least as hard as the Learning with Errors problem.
  arXiv  Detail & Related papers  (2020-02-27T15:32:08Z)
• Hardware-Encoding Grid States in a Non-Reciprocal Superconducting Circuit [62.997667081978825]
  We present a circuit design composed of a non-reciprocal device and Josephson junctions whose ground space is doubly degenerate and the ground states are approximate codewords of the Gottesman-Kitaev-Preskill (GKP) code. We find that the circuit is naturally protected against the common noise channels in superconducting circuits, such as charge and flux noise, implying that it can be used for passive quantum error correction.
  arXiv  Detail & Related papers  (2020-02-18T16:45:09Z)

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.