English
Related papers

Related papers: Is Circuit Depth Accurate for Comparing Quantum Ci…

200 papers

Checking whether two quantum circuits are equivalent is important for the design and optimization of quantum-computer applications with real-world devices. We consider quantum circuits consisting of Clifford gates, a practically-relevant…

Quantum Physics · Physics 2023-08-03 Dimitrios Thanos , Tim Coopmans , Alfons Laarman

Accurate methods of assessing the performance of quantum gates are extremely important. Quantum process tomography and randomized benchmarking are the current favored methods. Quantum process tomography gives detailed information, but…

Quantum Physics · Physics 2014-05-08 Austin G. Fowler , D. Sank , J. Kelly , R. Barends , John M. Martinis

Coherent gate errors are a concern in many proposed quantum computing architectures. These errors can be effectively handled through composite pulse sequences for single-qubit gates, however, such techniques are less feasible for entangling…

As various quantum computing technologies continue to compete for quantum supremacy, several parameters have emerged as benchmarks for the quality of qubits. These include fidelity, coherence times, connectivity, and a few others. In this…

Quantum Physics · Physics 2020-03-04 Daniel Koch , Avery Torrance , David Kinghorn , Saahil Patel , Laura Wessing , Paul M. Alsing

Quantum computing faces a key challenge: balancing the need for low circuit depth (crucial for fault tolerance) with the high accuracy required for complex computations like quantum chemistry and error correction, which typically require…

Quantum Physics · Physics 2025-11-21 Ioana Moflic , Alexandru Paler , Akash Kundu

The performance requirements for fault-tolerant quantum computing are very stringent. Qubits must be manipulated, coupled, and measured with error rates well below 1%. For semiconductor implementations, silicon quantum dot spin qubits have…

The use of analog classical systems for computation is generally thought to be a difficult proposition due to the susceptibility of these devices to noise and the lack of a clear framework for achieving fault-tolerance. We present…

Quantum Physics · Physics 2021-04-27 Corey Ostrove , Brian La Cour , Andrew Lanham , Granville Ott

Motivated by realistic hardware considerations of the pre-fault-tolerant era, we comprehensively study the impact of uncorrected noise on quantum circuits. We first show that any noise `truncates' most quantum circuits to effectively…

A Quantum Computer is a new type of computer which can solve problems such as factoring and database search very efficiently. The usefulness of a quantum computer is limited by the effect of two different types of errors, decoherence and…

Quantum Physics · Physics 2007-05-23 Kevin M. Obenland , Alvin M. Despain

We investigate the theoretical limits of the effect of the quantum interaction distance on the speed of exact quantum addition circuits. For this study, we exploit graph embedding for quantum circuit analysis. We study a logical mapping of…

Quantum Physics · Physics 2012-09-17 Byung-Soo Choi , Rodney Van Meter

A clever choice and design of gate sets can reduce the depth of a quantum circuit, and can improve the quality of the solution one obtains from a quantum algorithm. This is especially important for near-term quantum computers that suffer…

Quantum Physics · Physics 2025-07-08 Madhav Mohan , Julius de Hond , Servaas Kokkelmans

Estimating the eigenstate properties of quantum systems is a long-standing, challenging problem for both classical and quantum computing. Existing universal quantum algorithms typically rely on ideal and efficient query models (e.g. time…

Quantum Physics · Physics 2026-01-21 Jinzhao Sun , Pei Zeng , Tom Gur , M. S. Kim

In near-term quantum computing devices, connectivity between qubits remain limited by architectural constraints. A computational circuit with given connectivity requirements necessary for multi-qubit gates have to be embedded within…

Decoherence of quantum states is a major hurdle towards scalable and reliable quantum computing. Lower decoherence (i.e., higher fidelity) can alleviate the error correction overhead and obviate the need for energy-intensive noise reduction…

Emerging Technologies · Computer Science 2019-04-10 Abdullah Ash Saki , Mahabubul Alam , Swaroop Ghosh

Continuous gate sets are a key ingredient for near-term quantum algorithms. Here, we demonstrate a hardware-efficient, continuous set of controlled arbitrary-phase ($\mathrm{C}Z_{\theta}$) gates acting on flux-tunable transmon qubits. This…

The success probability of a quantum algorithm constructed from noisy quantum gates cannot be accurately predicted from single parameter metrics that compare noisy and ideal gates. We illustrate this concept by examining a system with…

Quantum Physics · Physics 2019-03-27 Daniel C. Murphy , Kenneth R. Brown

Geometric phase is a promising element to induce high-fidelity and robust quantum operations due to its built-in noise-resilience feature. Unfortunately, its practical applications are usually circumscribed by requiring complex interactions…

Quantum Physics · Physics 2020-12-08 Tao Chen , Zheng-Yuan Xue

Fault tolerant protocol assumes the application of error correction after every quantum gate. However, correcting errors is costly in terms of time and number of qubits. Here we demonstrate that quantum error correction can be applied…

Quantum Physics · Physics 2015-06-18 Yaakov S. Weinstein

Increasing quantum circuit fidelity requires an efficient instruction set to avoid errors from decoherence. The choice of a two-qubit (2Q) hardware basis gate depends on a quantum modulator's native Hamiltonian interactions and applied…

Quantum Physics · Physics 2025-04-22 Evan McKinney , Chao Zhou , Mingkang Xia , Michael Hatridge , Alex K. Jones

Quantum Parametric Circuits are constructed as an alternative to reduce the size of quantum circuits, meaning to decrease the number of quantum gates and, consequently, the depth of these circuits. However, determining the optimal circuit…

Machine Learning · Computer Science 2025-02-24 Fernando M de Paula Neto