English
Related papers

Related papers: Noise threshold for universality of 2-input gates

200 papers

Consider a coin tossing experiment which consists of tossing one of two coins at a time, according to a renewal process. The first coin is fair and the second has probability $1/2 + \theta$, $\theta \in [-1/2,1/2]$, $\theta$ unknown but…

Probability · Mathematics 2019-03-25 Diego Marcondes , Cláudia Peixoto

We present a new experimental protocol for performing universal gates in a register of superconducting qubits coupled by fixed on-chip linear reactances. The qubits have fixed, detuned Larmor frequencies and can remain, during the entire…

Quantum Physics · Physics 2009-11-10 Chad Rigetti , Michel Devoret

Successful implementation of a fault-tolerant quantum computation on a system of qubits places severe demands on the hardware used to control the many-qubit state. It is known that an accuracy threshold $P_{a}$ exists for any quantum gate…

Quantum Physics · Physics 2014-08-18 Yuchen Peng , Frank Gaitan

Quantum dot-based spin qubit realization is one of the most promising quantum computing systems owing to its integrability with classical computation hardware and its versatility in realizing qubits and quantum gates. In this work, we…

Quantum Physics · Physics 2024-11-14 Yash Tiwari , Aditya Dev , Vishvendra Singh Poonia

To successfully perform quantum computations, it is often necessary to first accurately characterize the noise in the underlying hardware. However, it is well known that fundamental limitations prevent the unique identification of the…

The estimation of parameters characterizing dynamical processes is central to science and technology. The estimation error changes with the number N of resources employed in the experiment (which could quantify, for instance, the number of…

Quantum Physics · Physics 2012-01-10 B. M. Escher , R. L. de Matos Filho , L. Davidovich

Much has been written about the representation of noisy linear 2-ports. Here we present a theory of noisy $N$-ports. We show how in the general case there are $(2N)!/(N!)^2$ equivalent representations and give the transformations relating…

Instrumentation and Methods for Astrophysics · Physics 2024-04-17 Martin Bucher , Daniel Molnar

We use quantum process tomography to characterize a full universal set of all-microwave gates on two superconducting single-frequency single-junction transmon qubits. All extracted gate fidelities, including those for Clifford group…

Transient algebra is a multi-valued algebra for hazard detection in gate circuits. Sequences of alternating 0's and 1's, called transients, represent signal values, and gates are modeled by extensions of boolean functions to transients.…

Computational Complexity · Computer Science 2010-08-11 Janusz Brzozowski , Baiyu Li , Yuli Ye

Fast entangling gates have been proposed for trapped ions that are orders of magnitude faster than current implementations. We present here a detailed analysis of the challenges involved in performing a successful fast gate. We show that…

Quantum Physics · Physics 2016-08-17 C D B Bentley , R L Taylor , A R R Carvalho , J J Hope

Consensus is one of the fundamental tasks studied in distributed computing. Processors have input values from some set $V$ and they have to decide the same value from this set. If all processors have the same input value, then they must all…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-08-27 Kokouvi Hounkanli , Avery Miller , Andrzej Pelc

The error threshold for fault tolerant quantum computation with concatenated encoding of qubits is penalized by internal communication overhead. Many quantum computation proposals rely on nearest-neighbour communication, which requires…

Quantum Physics · Physics 2007-05-23 T. Szkopek , P. O. Boykin , H. Fan , V. Roychowdhury , E. Yablonovitch , G. Simms , M. Gyure , B. Fong

The quantum degeneracy point approach [D. Vion et al., Science 296, 886 (2002)] effectively protects superconducting qubits from low-frequency noise that couples with the qubits as transverse noise. However, low-frequency noise in…

Quantum Physics · Physics 2014-11-19 Xiu-Hao Deng , Yong Hu , Lin Tian

We provide and experimentally demonstrate an accreditation protocol that upper-bounds the variation distance between noisy and noiseless probability distributions of the outputs of arbitrary quantum computations. We accredit the outputs of…

Quantum Physics · Physics 2021-10-13 Samuele Ferracin , Seth T. Merkel , David McKay , Animesh Datta

Nielsen [quant-ph/0108020] showed that universal quantum computation is possible given quantum memory and the ability to perform projective measurements on up to 4-qubits. We describe an improved method that requires only 2-qubit…

Quantum Physics · Physics 2007-05-23 D. W. Leung

Realistic fault-tolerant quantum computing at reasonable overhead requires two-qubit gates with the highest possible fidelity. Typically, an infidelity of $\lesssim 10^{-4}$ is recommended in the literature. Focusing on the phase-sensitive…

Quantum Physics · Physics 2023-11-28 Reinhold Blümel , Andrii Maksymov , Ming Li

Quantum optimal control theory allows to design accurate quantum gates. We employ it to design high-fidelity two-bit gates for Josephson charge qubits in the presence of both leakage and noise. Our protocol considerably increases the…

Quantum Physics · Physics 2009-11-13 Simone Montangero , Tommaso Calarco , Rosario Fazio

We experimentally show that the Inelastic Cooper-Pair Tunneling Amplifier (ICTA), implementing a DC-powered parametric amplification scheme, can achieve gain and noise performance similar to that of Josephson parametric amplifiers. Using…

High-fidelity two-qubit gates in quantum computers are often hampered by fluctuating experimental parameters. The effects of time-varying parameter fluctuations lead to coherent noise on the qubits, which can be suppressed by designing…

Quantum Physics · Physics 2023-01-06 Mingyu Kang , Ye Wang , Chao Fang , Bichen Zhang , Omid Khosravani , Jungsang Kim , Kenneth R. Brown

This note proves that arbitrary local gates together with any entangling bipartite gate V are universal. Previously this was known only when access to both V and V^{-1} was given, or when approximate universality was demanded.

Quantum Physics · Physics 2009-08-07 Aram W. Harrow
‹ Prev 1 8 9 10 Next ›