Related papers: Schmidt-number benchmark for genuine quantum memor…
Accurately estimating the performance of quantum hardware is crucial for comparing different platforms and predicting the performance and feasibility of quantum algorithms and applications. In this paper, we tackle the problem of…
Quantum gates in experiment are inherently prone to errors that need to be characterized before they can be corrected. Full characterization via quantum process tomography is impractical and often unnecessary. For most practical purposes,…
Noise remains the major obstacle to scalable quantum computation. Quantum benchmarking provides key information on noise properties and is an important step for developing more advanced quantum processors. However, current benchmarking…
Quantum processors are now able to run quantum circuits that are infeasible to simulate classically, creating a need for benchmarks that assess a quantum processor's rate of errors when running these circuits. Here, we introduce a general…
We introduce the notion of a Schmidt number of a bipartite density matrix, characterizing the minimum Schmidt rank of the pure states that are needed to construct the density matrix. We prove that Schmidt number is nonincreasing under local…
We introduce a new discrete coherence monotone named the \emph{coherence number}, which is a generalization of the coherence rank to mixed states. After defining the coherence number in a similar manner to the Schmidt number in entanglement…
Quantum gate set tomography (GST) has emerged as a promising method for the full characterization of quantum logic gates. In contrast to quantum process tomography (QPT), GST self-consistently and correctly accounts for state preparation…
This work introduces the Schmidt quantum compressor, an innovative approach to quantum data compression that leverages the principles of Schmidt decomposition to encode quantum information efficiently. In contrast to traditional variational…
With the development of controllable quantum systems, fast and practical characterization for multi-qubit gates is essential for building high-fidelity quantum computing devices. The usual way to fulfill this requirement via randomized…
Quantum computers have the potential to outperform classical computers in a range of computational tasks, such as prime factorisation and unstructured searching. However, real-world quantum computers are subject to noise. Quantifying noise…
Simulating the stochastic evolution of real quantities on a digital computer requires a trade-off between the precision to which these quantities are approximated, and the memory required to store them. The statistical accuracy of the…
Quantifying coherence is an essential endeavor for both quantum foundations and quantum technologies. In this paper, we put forward a quantitative measure of coherence by following the axiomatic definition of coherence measures introduced…
As quantum computing technology improves and quantum computers with a small but non-trivial number of N > 100 qubits appear feasible in the near future the question of possible applications of small quantum computers gains importance. One…
Continuous-time stochastic processes pervade everyday experience, and the simulation of models of these processes is of great utility. Classical models of systems operating in continuous-time must typically track an unbounded amount of…
Calibration of quantum gates is a necessary hurdle to overcome on the way to a reliable quantum computer. In a recent paper, a protocol called Gate Set Calibration protocol (GSC) has been introduced and used to learn coherent errors from…
We analyze a scheme for quantum computation where quantum gates can be continuously changed from standard dynamic gates to purely geometric ones. These gates are enacted by controlling a set of parameters that are subject to unwanted…
Quantum coherence characterizes the non-classical feature of a single party system with respect to a local basis. Based on a recently introduced resource framework, coherence can be regarded as a resource and be systematically manipulated…
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 memory is important to quantum information processing in many ways: a synchronization device to match various processes within a quantum computer, an identity quantum gate that leaves any state unchanged, and a tool to convert…
An arbitrarily reliable quantum computer can be efficiently constructed from noisy components using a recursive simulation procedure, provided that those components fail with probability less than the fault-tolerance threshold. Recent…