Related papers: Gaussian decomposition of magic states for matchga…
In unitary circuit games, two competing parties, an "entangler" and a "disentangler", can induce an entanglement phase transition in a quantum many-body system. The transition occurs at a certain rate at which the disentangler acts. We…
In the context of quantum technologies over continuous variables, Gaussian states and operations are typically regarded as freely available, as they are relatively easily accessible experimentally. In contrast, the generation of…
How would the world appear to us if its ontology was that of classical mechanics but every agent faced a restriction on how much they could come to know about the classical state? We show that in most respects, it would appear to us as…
Gaussian states are the backbone of quantum information protocols with continuous variable systems, whose power relies fundamentally on the entanglement between the different modes. In the case of global pure states, knowledge of the…
We provide a necessary and sufficient condition for separability of Gaussian states of bipartite systems of arbitrarily many modes. The condition provides an operational criterion since it can be checked by simple computation. Moreover, it…
Many proposals for fault-tolerant quantum computation require injection of 'magic states' to achieve a universal set of operations. Some qubit states are above a threshold fidelity, allowing them to be converted into magic states via 'magic…
We first propose a new separability criterion based on algebraic-geometric invariants of bipartite mixed states introduced in [1], then prove that for all low ranks r <m+n-2, generic rank r mixed states in mxn systems have relatively high…
The quantum simulation of real molecules and materials is one of the most highly anticipated applications of quantum computing. Algorithms for simulating electronic structure using a first-quantized plane wave representation are especially…
Starting with a set of conditions for bipartite separability of arbitrary quantum states in any dimension and expressed in terms of arbitrary operators whose commutator is a $c$-number, we derive a hierarchy of conditions for tripartite…
Quantum state tomography, a fundamental tool for quantum physics, usually requires a number of state copies that scale exponentially with the system size, owing to the intricate quantum correlations between subsystems. We show that, in…
We investigate $(k_1,k_2)$-extendibility of fermionic Gaussian states, a property central to quantum correlations and approximations of separability. We show that these states are $(k_1,k_2)$-extendible if and only if they admit a fermionic…
We establish lower-bounds on the number of resource states, also known as magic states, needed to perform various quantum computing tasks, treating stabilizer operations as free. Our bounds apply to adaptive computations using measurements…
Unitary operations are the building blocks of quantum programs. Our task is to design effcient or optimal implementations of these unitary operations by employing the intrinsic physical resources of a given n-qubit system. The most common…
Quantum error correction and fault-tolerance have provided the possibility for large scale quantum computations without a detrimental loss of quantum information. A very natural class of gates for fault-tolerant quantum computation is the…
Gate model quantum computers with too many qubits to be simulated by available classical computers are about to arrive. We present a strategy for programming these devices without error correction or compilation. This means that the number…
We propose a general method for preparing stabilizer states with reduced two-qubit gate count and depth compared to the state of the art. The method starts from a graph state representation of the stabilizer state and iteratively reduces…
We show how to perform measurement-based quantum computing on qudits (high-dimensional quantum systems) using alternative resource states beyond the cluster state. Estimating overheads for gate decomposition, we find that generalizing…
We consider the distinguishability of Gaussian states from the view point of continuous-variable quantum cryptography using post-selection. Specifically, we use the probability of error to distinguish between two pure coherent (squeezed)…
We present a novel, non-parametric form for compactly representing entangled many-body quantum states, which we call a `Gaussian Process State'. In contrast to other approaches, we define this state explicitly in terms of a configurational…
We prove that for many ranks r<2m-2, random rank r mixed states in bipartite mxm systems have relatively high Schmidt numbers, which is based on algebraic-geometric separability criterion proved in [1]. This also means that the…