Related papers: Beyond Bell sampling: stabilizer state learning an…
We show that a simple experimental setting of a locally pumped and lossy array of two-level quantum systems can stabilize states with strong long-range coherence. Indeed, by explicit analytic construction, we show there is an extensive set…
The vast and complicated large-qubit state space forbids us to comprehensively capture the dynamics of modern quantum computers via classical simulations or quantum tomography. Recent progress in quantum learning theory prompts a crucial…
We consider the classical shadows task for pure states in the setting of both joint and independent measurements. The task is to measure few copies of an unknown pure state $\rho$ in order to learn a classical description which suffices to…
This paper builds on the idea of simulating stabiliser circuits through transformations of quadratic form expansions. This is a representation of a quantum state which specifies a formula for the expansion in the standard basis, describing…
We describe a scalable experimental protocol for obtaining estimates of the error rate of individual quantum computational gates. This protocol, in which random Clifford gates are interleaved between a gate of interest, provides a bounded…
Over the past few decades, experimental tests of Bell-type inequalities have been at the forefront of understanding quantum mechanics and its implications. These strong bounds on specific measurements on a physical system originate from…
Non-stabilizerness, or magic, is a fundamental resource for quantum computation, enabling quantum algorithms to surpass classical capabilities. Despite its importance, characterizing magic remains challenging due to the intricate geometry…
Randomized benchmarking is a widely used experimental technique to characterize the average error of quantum operations. Benchmarking procedures that scale to enable characterization of $n$-qubit circuits rely on efficient procedures for…
Quantum supremacy poses that a realistic quantum computer can perform a calculation that classical computers cannot in any reasonable amount of time. It has become a topic of significant research interest since the birth of the field, and…
Recently, a group of experiments tested local realism with random choices prepared by humans. These various tests were subject to additional assumptions, which lead to loopholes in the interpretations of almost all of the experiments. Among…
We present a unified framework for quantum sensitivity sampling, extending the advantages of quantum computing to a broad class of classical approximation problems. Our unified framework provides a streamlined approach for constructing…
The phenomenon of quantum steering in bipartite quantum systems can be reduced to the question whether or not the first party can perform measurements such that the conditional states on the second party can be explained by a local hidden…
We introduce a hierarchical algorithm for identifying the largest Pauli coefficients of an unknown $n$-qubit quantum state. The algorithm traverses a prefix-based tree whose nodes represent partial sums of squared Pauli coefficients, always…
We provide explicit quantum circuits for the non-destructive deterministic discrimination of Bell states in the Hilbert space $C^{d^{n}}$, where $d$ is qudit dimension. We discuss a method for generalizing this to non-destructive…
The certification of randomness is essential for both fundamental science and information technologies. Unlike traditional random number generators, randomness obtained from nonlocal correlations is fundamentally guaranteed to be…
Quantum network protocols depend on the availability of shared entanglement. Given that entanglement generation and distribution are affected by noise, characterization of the shared entangled states is essential to bound the errors of the…
We develop a means of simulating the evolution and measurement of a multipartite quantum state under discrete or continuous evolution using another quantum system with states and operators lying in a real Hilbert space. This extends…
Noise in quantum operations often negates the advantage of quantum computation. However, most classical simulations of quantum computers calculate the ideal probability amplitudes either storing full state vectors or using sophisticated…
We present a quantum algorithm for efficiently sampling transformed Gaussian random fields on $d$-dimensional domains, based on an enhanced version of the classical moving average method. Pointwise transformations enforcing boundedness are…
Nonlocality lies at the core of quantum mechanics from both a fundamental and applicative point of view. It is typically revealed by a Bell test, that is by violation of a Bell inequality, whose success depends both on the state of the…