Related papers: Pseudoentanglement Ain't Cheap
Recent work has explored using the stabilizer formalism to classically simulate quantum circuits containing a few non-Clifford gates. The computational cost of such methods is directly related to the notion of stabilizer rank, which for a…
We investigate entanglement in two-qubit systems using a geometric representation based on the minimum of essential parameters. The latter is achieved by requiring subsystems with the same entropy, regardless of whether the state of the…
The dynamics of quantum entanglement plays a central role in explaining the emergence of thermal equilibrium in isolated many-body systems. However, entanglement is notoriously hard to measure. Recent works have introduced a notion of…
The entanglement of a pure state of a pair of quantum systems is defined as the entropy of either member of the pair. The entanglement of formation of a mixed state is defined as the minimum average entanglement of an ensemble of pure…
We show that the manifold of quantum states is endowed with a rich and nontrivial geometric structure. We derive the Fubini-Study metric of the projective Hilbert space of a multi-qubit quantum system, endowing it with a Riemannian metric…
We report the creation of a wide range of quantum states with controllable degrees of entanglement and entropy using an optical two-qubit source based on spontaneous parametric downconversion. The states are characterised using measures of…
Detecting entanglement in multipartite quantum states is an inherently probabilistic process, typically with a few measured samples. The level of confidence in entanglement detection quantifies the scheme's validity via the probability that…
Quantum networks with bipartite resources and shared randomness present the simplest infrastructure for implementing a future quantum internet. Here, we shall investigate which kinds of entanglement can or cannot be generated from this kind…
Stabilizer Entropy (SE) quantifies the spread of a state in the basis of Pauli operators. It is a computationally tractable measure of non-stabilizerness and thus a useful resource for quantum computation. SE can be moved around a quantum…
Bounding the cost of classically simulating the outcomes of universal quantum circuits to additive error $\delta$ is often called weak simulation and is a direct way to determine when they confer a quantum advantage. Weak simulation of the…
Whether noisy quantum devices without error correction can provide quantum advantage over classical computers is a critical issue of current quantum computation. In this work, the random quantum circuits, which are used as the paradigm…
We consider a Quantum Computer with n quantum-bits (`qubits'), where each qubit is coupled independently to an environment affecting the state in a dephasing or depolarizing way. For mixed states we suggest a quantification for the property…
We describe the encoding of multiple qubits per atom in trapped atom quantum processors and methods for performing both intra- and inter-atomic gates on participant qubits without disturbing the spectator qubits stored in the same atoms. We…
Finding the minimal relative entropy of two quantum states under semidefinite constraints is a pivotal problem located at the mathematical core of various applications in quantum information theory. An efficient method for providing…
Entanglement is a key property of quantum states that acts as a resource for a wide range of tasks in quantum computing. Entanglement detection is a key conceptual and practical challenge. Without adaptive or joint measurements,…
Simply and reliably detecting and quantifying entanglement outside laboratory conditions will be essential for future quantum information technologies. Here we address this issue by proposing a method for generating expressions which can…
It is generally believed that entanglement is essential for quantum computing. We present here a few simple examples in which quantum computing without entanglement is better than anything classically achievable, in terms of the reliability…
Noisy intermediate-scale quantum (NISQ) computers have gate errors and decoherence, limiting the depth of circuits that can be implemented on them. A strategy for NISQ algorithms is to reduce the circuit depth at the expense of increasing…
Entanglement is a fundamental aspect of quantum physics, both conceptually and for its many applications. Classifying an arbitrary multipartite state as entangled or separable -- a task referred to as the separability problem -- poses a…
Motivated to understand how entanglement resources can be distributed in quantum networks, we introduce threshold entanglement (TE) states. These are multipartite quantum states whose entanglement across bipartitions forces all marginals of…