Related papers: Minimum number of input states required for quantu…
In parity quantum computing, multi-qubit logical gates are implemented by single-qubit rotations on a suitably encoded state involving auxiliary qubits. Consequently, there is a correspondence between qubit count and the size of the native…
The performance of a quantum processor depends on the characteristics of the device and the quality of the control pulses. Characterizing cloud-based quantum computers and calibrating the pulses that control them is necessary for…
High quality, fully-programmable quantum processors are available with small numbers (<1000) of qubits, and the scientific potential of these near term machines is not well understood. If the small number of physical qubits precludes…
As a measure of the 'closeness' of two quantum states, fidelity plays a fundamental role in quantum information theory. Fidelity estimation protocols try to strike a balance between information gleaned from an experiment, and the efficiency…
Two level quantum mechanical systems like spin 1/2 particles lend themselves as a natural qubit implementation. However, encoding a single qubit in several spins reduces the resources necessary for qubit control and can protect from…
A quantum state transformation can be generally approximated by single- and two-qubit gates. This, however, does not hold with noisy intermediate-scale quantum technologies due to the errors appearing in the gate operations, where errors of…
The field of quantum computing has grown from concept to demonstration devices over the past 20 years. Universal quantum computing offers efficiency in approaching problems of scientific and commercial interest, such as factoring large…
The preparation of $n$-qubit quantum states is a cross-cutting subroutine for many quantum algorithms, and the effort to reduce its circuit complexity is a significant challenge. In the literature, the quantum state preparation algorithm by…
Standing as one of the most significant barriers to reaching quantum advantage, state-preparation fidelities on noisy intermediate-scale quantum processors suffer from quantum-gate errors, which accumulate over time. A potential remedy is…
The implementation of quantum gates with fidelities that exceed the threshold for reliable quantum computing requires robust gates whose performance is not limited by the precision of the available control fields. The performance of these…
In this paper we address the problem of optimal reconstruction of a quantum state from the result of a single measurement when the original quantum state is known to be a member of some specified set. A suitable figure of merit for this…
Gate-model quantum computers can allow quantum computations in near-term implementations. The stabilization of an optimal quantum state of a quantum computer is a challenge, since it requires stable quantum evolutions via a precise…
For a system randomly prepared in a number of quantum states, we present a lower bound for the distinguishability of the quantum states, that is, the success probability of determining the states in the form of entropy. When the states are…
In the past decades, quantum entanglement has been recognized to be the basic resource in quantum information theory. A fundamental need is then the understanding its qualification and its quantification: Is the quantum state entangled, and…
One of the most central and controversial element of quantum mechanics is the use of non zero vectors of a Hilbert space (or, more generally, of one dimension subspaces) for representing the state of a quantum system. In particular, the…
In certain regimes, the fidelity of quantum states will decay at a rate set by the classical Lyapunov exponent. This serves both as one of the most important examples of the quantum-classical correspondence principle and as an accurate test…
We introduce a simple protocol for adaptive quantum state tomography, which reduces the worst-case infidelity between the estimate and the true state from $O(N^{-1/2})$ to $O(N^{-1})$. It uses a single adaptation step and just one extra…
We show how to prepare any graph state of up to 12 qubits with: (a) the minimum number of controlled-Z gates, and (b) the minimum preparation depth. We assume only one-qubit and controlled-Z gates. The method exploits the fact that any…
We show that quantum states with "low stabilizer complexity" can be efficiently distinguished from Haar-random. Specifically, given an $n$-qubit pure state $|\psi\rangle$, we give an efficient algorithm that distinguishes whether…
A generic model of measurement device which is able to directly measure commonly used quantum-state characteristics such as fidelity, overlap, purity and Hilbert-Schmidt distance for two general uncorrelated mixed states is proposed. In…