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
- 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) - Empirical Evaluation of Circuit Approximations on Noisy Quantum Devices [0.0]
Noisy Intermediate-Scale Quantum (NISQ) devices fail to produce outputs with sufficient fidelity for deep circuits with many gates today.
This work develops a methodology to generate shorter circuits with fewer multi-qubit gates whose unitary transformations approximate the original reference one.
arXiv Detail & Related papers (2021-07-14T13:44:54Z) - 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) - Solving Sparse Linear Inverse Problems in Communication Systems: A Deep
Learning Approach With Adaptive Depth [51.40441097625201]
We propose an end-to-end trainable deep learning architecture for sparse signal recovery problems.
The proposed method learns how many layers to execute to emit an output, and the network depth is dynamically adjusted for each task in the inference phase.
arXiv Detail & Related papers (2020-10-29T06:32:53Z) - 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.