Related papers: Error Crafting in Mixed Quantum Gate Synthesis
Variational quantum algorithms (VQAs) are promising tools for demonstrating quantum utility on near-term quantum hardware, with applications in optimisation, quantum simulation, and machine learning. While researchers have studied how easy…
Contemporary methods for benchmarking noisy quantum processors typically measure average error rates or process infidelities. However, thresholds for fault-tolerant quantum error correction are given in terms of worst-case error rates --…
It is important for performance studies in quantum technologies to analyze quantum circuits in the presence of noise. We introduce an error probability tensor, a tool to track generalized Pauli error statistics of qudits within quantum…
The ability to execute a large number of quantum gates in parallel is a fundamental requirement for quantum error correction, allowing an error threshold to exist under the finite coherence time of physical qubits. Recently, two-dimensional…
We discuss characterization of experimental quantum gates by the error matrix, which is similar to the standard process matrix $\chi$ in the Pauli basis, except the desired unitary operation is factored out, by formally placing it either…
Based on the amplitude behavior of quantum Rabi oscillation driven by a coherent field we show that there exists an upper bound to the number of logical operation performed on any single qubit within one error-correction period of a quantum…
Entangling operations are a necessary tool for large-scale quantum information processing, but experimental imperfections can prevent current schemes from reaching sufficient fidelities as the number of qubits is increased. Here it is shown…
Generating samples from the output distribution of a quantum circuit is a ubiquitous task used as a building block of many quantum algorithms. Here we show how to accomplish this task on a noisy quantum processor lacking full-blown error…
A rotation-based synthesis framework for reversible logic is proposed. We develop a canonical representation based on binary decision diagrams and introduce operators to manipulate the developed representation model. Furthermore, a…
Physical qubits in experimental quantum information processors are inevitably exposed to different sources of noise and imperfections, which lead to errors that typically accumulate hindering our ability to perform long computations…
We provide a simple prescription to extract an effective Pauli noise model from classical simulations of a noisy experimental protocol for a unitary gate. This prescription yields the closest Pauli channel approximation to the error channel…
Unitary synthesis is the process of decomposing a target unitary transformation into a sequence of quantum gates. This is a challenging task, as the number of possible gate combinations grows exponentially with the circuit depth. In this…
Quantum computation holds the promise of solving computational problems which are believed to be classically intractable. However, in practice, quantum devices are still limited by their relatively short coherence times and imperfect…
We introduce a Bayesian method for the estimation of single qubit errors in quantum devices, and use it to characterize these errors on three 27-qubit superconducting qubit devices. We self-consistently estimate up to seven parameters of…
The central challenge in building a quantum computer is error correction. Unlike classical bits, which are susceptible to only one type of error, quantum bits ("qubits") are susceptible to two types of error, corresponding to flips of the…
Fault-tolerant quantum computation is a technique that is necessary to build a scalable quantum computer from noisy physical building blocks. Key for the implementation of fault-tolerant computations is the ability to perform a universal…
Quantum error correction is an essential ingredient for universal quantum computing. Despite tremendous experimental efforts in the study of quantum error correction, to date, there has been no demonstration in the realisation of universal…
We propose an approach to optimally synthesize quantum circuits from non-permutative quantum gates such as Controlled-Square-Root-of-Not (i.e. Controlled-V). Our approach reduces the synthesis problem to multiple-valued optimization and…
The Clifford$+T$ gate set is commonly used to perform universal quantum computation. In such setup the $T$ gate is typically much more expensive to implement in a fault-tolerant way than Clifford gates. To improve the feasibility of…
Coherent errors are a dominant noise process in many quantum computing architectures. Unlike stochastic errors, these errors can combine constructively and grow into highly detrimental overrotations. To combat this, we introduce a simple…