Related papers: Divide-and-conquer verification method for noisy i…
Today's experimental noisy quantum processors can compete with and surpass all known algorithms on state-of-the-art supercomputers for the computational benchmark task of Random Circuit Sampling [1-5]. Additionally, a circuit-based quantum…
Noisy linear problems have been studied in various science and engineering disciplines. A class of "hard" noisy linear problems can be formulated as follows: Given a matrix $\hat{A}$ and a vector $\mathbf{b}$ constructed using a finite set…
We introduce a simulation-free method to estimate the fidelity of large quantum circuits based on the order statistics of measured output probabilities from highly entangled, chaotic states. The approach requires only the…
In theory, quantum computers can efficiently simulate quantum physics, factor large numbers and estimate integrals, thus solving otherwise intractable computational problems. In practice, quantum computers must operate with noisy devices…
We present a continuous monitoring system for intermediate-scale quantum processors that allows extracting estimates of noisy native gate and read-out measurements based on the set of executed quantum circuits and resulting measurement…
The effects of noise are one of the most important factors to consider when it comes to quantum computing in the noisy intermediate-scale quantum computing (NISQ) era that we are currently in. Therefore, it is important not only to gain…
We propose an efficient protocol to fully reconstruct a set of high-fidelity quantum gates. Usually, the efficiency of reconstructing high-fidelity quantum gates is limited by the sampling noise. Our protocol is based on a perturbative…
The performance of a quantum information processing protocol is ultimately judged by distinguishability measures that quantify how distinguishable the actual result of the protocol is from the ideal case. The most prominent…
The first generation of multi-qubit quantum technologies will consist of noisy, intermediate-scale devices for which active error correction remains out of reach. To exploit such devices, it is thus imperative to use passive error…
We present a scheme for implementing quantum operations with superconducting qubits. Our approach uses a "coupler" qubit to mediate a controllable, secular interaction between "data" qubits, pulse sequences which strongly mitigate the…
One of the most promising applications of quantum computing is the processing of graphical data like images. Here, we investigate the possibility of realizing a quantum pattern recognition protocol based on swap test, and use the IBMQ noisy…
We show that non-exponential fidelity decays in randomized benchmarking experiments on quantum dot qubits are consistent with numerical simulations that incorporate low-frequency noise. By expanding standard randomized benchmarking analysis…
Understanding the effects of noise on quantum computations is fundamental to the development of quantum hardware and quantum algorithms. Simulation tools are essential for quantitatively modelling these effects, yet unless artificial…
The class of commuting quantum circuits known as IQP (instantaneous quantum polynomial-time) has been shown to be hard to simulate classically, assuming certain complexity-theoretic conjectures. Here we study the power of IQP circuits in…
Instantaneous Quantum Polynomial-time (IQP) circuits are a candidate for demonstrating near-term quantum advantage, as their sampling task is believed to be classically hard in the ideal theoretical setting under standard…
The computational power of real-world quantum computers is limited by errors. When using quantum computers to perform algorithms which cannot be efficiently simulated classically, it is important to quantify the accuracy with which the…
Entanglement plays an indispensable role in numerous quantum information and quantum computation tasks, underscoring the need for efficiently verifying entangled states. In recent years, quantum state verification has received increasing…
Adiabatic quantum algorithms solve computational problems by slowly evolving a trivial state to the desired solution. On an ideal quantum computer, the solution quality improves monotonically with increasing circuit depth. By contrast,…
Simulating open quantum systems is essential for exploring novel quantum phenomena and evaluating noisy quantum circuits. In this Letter, we address the problem of whether mixed states generated from noisy quantum circuits can be…
While the power of quantum computers is commonly acknowledged to rise exponentially, it is often overlooked that the complexity of quantum noise mechanisms generally grows much faster. In particular, quantifying whether the instructions on…