Related papers: Heuristic-free Verification-inspired Quantum Bench…
Quantum memories are an important building block for quantum information processing. Ideally, these memories preserve the quantum properties of the input. We present general criteria for measures to evaluate the quality of quantum memories.…
A proof of quantumness is a method for provably demonstrating (to a classical verifier) that a quantum device can perform computational tasks that a classical device with comparable resources cannot. Providing a proof of quantumness is the…
In order to quantify the relative performance of different testbed quantum computing devices, it is useful to benchmark them using a common protocol. While some benchmarks rely on the performance of random circuits and are generic in…
In this work we investigate how to quantify the coherence of quantum measurements. First, we establish a resource theoretical framework to address the coherence of measurement and show that any statistical distance can be adopted to define…
A proof of quantumness is a protocol through which a classical machine can test whether a purportedly quantum device, with comparable time and memory resources, is performing a computation that is impossible for classical computers.…
Here we investigate the use of the majorization-based indicator introduced in [R. O. Vallejos, F. de Melo, and G. G. Carlo, Phys. Rev. A 104, 012602 (2021)] as a way to benchmark the complexity within reach of quantum processors. By…
Quantum measurement is universal for quantum computation. This universality allows alternative schemes to the traditional three-step organisation of quantum computation: initial state preparation, unitary transformation, measurement. In…
The quantum kernel method, a promising quantum machine learning algorithm, possesses substantial potential for demonstrating quantum advantage. Although the majority of the quantum kernel is constructed in the context of gate-based quantum…
Certifying the performance of quantum computers requires standardized tests. We propose a simple energy estimation benchmark that is motivated from quantum chemistry. With this benchmark we statistically characterize the noisy outcome of…
Quantum measurements on a two-level system can have more than two independent outcomes, and in this case, the measurement cannot be projective. Measurements of this general type are essential to an operational approach to quantum theory,…
In the last couple of decades, the world has seen several stunning instances of quantum algorithms that provably outperform the best classical algorithms. For most problems, however, it is currently unknown whether quantum algorithms can…
Physical processes in the quantum regime possess non-classical properties of quantum mechanics. However, methods for quantitatively identifying such processes are still lacking. Accordingly, in this study, we develop a framework for…
Analog quantum simulation allows for assessing static and dynamical properties of strongly correlated quantum systems to high precision. To perform simulations outside the reach of classical computers, accurate and reliable implementations…
We propose an efficient scheme for verifying quantum computations in the `high complexity' regime i.e. beyond the remit of classical computers. Previously proposed schemes remarkably provide confidence against arbitrarily malicious…
The presence of noise in quantum computers hinders their effective operation. Even though quantum error correction can theoretically remedy this problem, its practical realization is still a challenge. Testing and benchmarking noisy,…
With the advent of quantum cloud computing, the security of delegated quantum computation has become of utmost importance. While multiple statistically secure blind verification schemes in the prepare-and-send model have been proposed, none…
As quantum processors continue to scale in size and complexity, the need for well-defined, reproducible, and technology-agnostic performance metrics becomes increasingly critical. Here we present a suite of scalable quantum computing…
We aim to devise feasible, efficient verification schemes for bosonic channels. To this end, we construct an average-fidelity witness that yields a tight lower bound for average fidelity plus a general framework for verifying optimal…
As quantum computing hardware rapidly advances, objectively evaluating the capabilities and error rates of new processors remains a critical challenge for the field. A clear and realistic understanding of current quantum performance is…
In the scale-up of quantum computers, the framework underpinning fault-tolerance generally relies on the strong assumption that environmental noise affecting qubit logic is uncorrelated (Markovian). However, as physical devices progress…