Related papers: Group twirling and noise tailoring for multi-qubit…
Quantum noise is a central challenge in quantum computing across many applications. Extensive work has examined how qubits couple to their environment, leading to decoherence and relaxation, which is irreversible. Current studies focus on…
Reducing errors in quantum gates is critical to the development of quantum computers. To do so, any distortions in the control signals should be identified, however, conventional tools are not always applicable when part of the system is…
In this paper, we derive optimized measurement-free protocols for quantum error correction and the implementation of a universal gate set optimized for an error model that is noise biased . The noise bias is adapted for neutral atom…
Randomized compiling reduces the effects of errors on quantum computers by tailoring arbitrary Markovian errors into stochastic Pauli noise. Here we prove that randomized compiling also tailors non-Markovian errors into local stochastic…
Efficiently calculating the low-lying eigenvalues of Hamiltonians, written as sums of Pauli operators, is a fundamental challenge in quantum computing. While various methods have been proposed to reduce the complexity of quantum circuits…
Classical simulations of noisy stabilizer circuits are often used to estimate the threshold of a quantum error-correcting code. Physical noise sources are efficiently approximated by random insertions of Pauli operators. For a single qubit,…
Mid-circuit measurements (MCMs) are crucial ingredients in the development of fault-tolerant quantum computation. While there have been rapid experimental progresses in realizing MCMs, a systematic method for characterizing noisy MCMs is…
Classical simulation of noisy quantum circuits is essential for understanding quantum computing experiments. It enables scalable error characterization, analysis of how noise impacts quantum algorithms, and optimized implementations of…
We consider the possibility of adding noise to a quantum circuit to make it efficiently simulatable classically. In previous works this approach has been used to derive upper bounds to fault tolerance thresholds - usually by identifying a…
We study the effects of imperfections on the fidelity of the Toffoli gate recently realized in a circuit~QED setup using quantum control methods. The noise is introduced in the interqubits interactions. The coupling constants are no longer…
The Clifford group is the set of gates generated by the CZ gate, and the two local gates: the Hadamard and the Pi/2 phase shift gate. It is known that, for a two qubit system, the Clifford group C2 is a subgroup of order 92160 of the group…
We introduce a general framework for weak transversal gates -- probabilistic implementation of logical unitaries realized by local physical unitaries -- and propose a novel partially fault-tolerant quantum computing architecture that…
Quantum error correction is believed to be essential for scalable quantum computation, but its implementation is challenging due to its considerable space-time overhead. Motivated by recent experiments demonstrating efficient manipulation…
We show that quantum circuits cannot be made fault-tolerant against a depolarizing noise level of approximately 45%, thereby improving on a previous bound of 50% (due to Razborov). Our precise quantum circuit model enables perfect gates…
Recently, there has been an emergence of useful applications for noisy intermediate-scale quantum (NISQ) devices notably, though not exclusively, in the fields of quantum machine learning and variational quantum algorithms. In such…
Recently it has been shown that Repeat-Until-Success (RUS) circuits can approximate a given single-qubit unitary with an expected number of $T$ gates of about $1/3$ of what is required by optimal, deterministic, ancilla-free decompositions…
Quantum computers promise to solve certain problems more efficiently than their digital counterparts. A major challenge towards practically useful quantum computing is characterizing and reducing the various errors that accumulate during an…
A central building block of many quantum algorithms is the diagonalization of Pauli operators. Although it is always possible to construct a quantum circuit that simultaneously diagonalizes a given set of commuting Pauli operators, only…
There is increasing interest in the development of gate-based quantum circuits for the training of machine learning models. Yet, little is understood concerning the parameters of circuit design, and the effects of noise and other…
Quantum circuit network is a set of circuits that implements a certain computation task. Being at the center of the quantum circuit network, the multi-qubit controlled phase shift is one of the most important quantum gates. In this paper,…