Related papers: Magic state parity-checker with pre-distilled comp…
Matrix product states (MPS) are a central language for one-dimensional quantum matter and a practical target for near-term quantum simulators and variational algorithms. Yet, while substantial effort has focused on preparing MPS with…
Distillation of entanglement using only Gaussian operations is an important primitive in quantum communication, quantum repeater architectures, and distributed quantum computing. Existing distillation protocols for continuous degrees of…
A mixed quantum state shared between two parties is said to be distillable if, by means of a protocol involving only local quantum operations and classical communication, the two parties can transform some number of copies of that state…
We experimentally generate and tomographically characterize a mixed, genuinely non-Gaussian bipartite continuous-variable entangled state. By testing entanglement in 2$\times$2-dimensional two-qubit subspaces, entangled qubits are localized…
Based on a sequential communication game, semi-device independent certification of an unsharp instrument has recently been demonstrated [\href{https://iopscience.iop.org/article/10.1088/1367-2630/ab3773}{New J. Phys. 21 083034 (2019),…
Random party distillation refers to the process by which Einstein-Podolsky-Rosen pairs are randomly extracted from a single copy of a multipartite entangled state after multiple rounds of performing positive operator value measure…
We develop classical simulation algorithms for adaptive quantum circuits that produce states with low levels of ``magic'' (i.e., non-stabilizerness). These algorithms are particularly well-suited to circuits with high rates of Pauli…
Magic states can be used as a resource to circumvent the restrictions due to stabilizer-preserving operations, and magic-state conversion has not been studied in the single-copy regime thus far. Here we solve the question of whether a…
The dependence of quantum algorithms on state fidelity is difficult to characterize analytically and is best explored experimentally as hardware scales and noisy simulations become intractable. While low fidelity states are often…
This paper will address the question of the distillation of entanglement from a finite number of multi-partite mixed states. It is shown that if one can distill a pure entangled state from n copies of a mixed state $\sigma _{ABC...}$ there…
Self-testing refers to a device-independent way to uniquely identify the state and the measurement for uncharacterized quantum devices. The only information required comprises the number of measurements, the number of outputs of each…
Quantum universality can be achieved using classically controlled stabilizer operations and repeated preparation of certain ancilla states. Which ancilla states suffice for universality? This "magic states distillation" question is closely…
We develop two general approaches to characterising the manipulation of quantum states by means of probabilistic protocols constrained by the limitations of some quantum resource theory. First, we give a general necessary condition for the…
Nonstabilizerness or `magic' is a crucial resource for quantum computers which can be distilled from noisy quantum states. However, determining the magic of mixed quantum has been a notoriously difficult task. Here, we provide efficient…
It is well known that any entangled mixed state in $2\otimes 2$ systems can be purified via infinite copies of the mixed state. But can one distill a pure maximally entangled state from finite copies of a mixed state in any bipartite system…
Quantum state purification, which operates not by identifying and correcting specific errors but by repeatedly projecting multiple noisy copies onto special subspaces, provides a syndrome-free alternative to quantum error correction.…
Known entanglement purification protocols for mixed states use collective measurements on several copies of the state in order to increase the entanglement of some of them. We address the question of whether it is possible to purify the…
Quantum state discrimination plays a central role in defining the possible and impossible operations through a restricted class of quantum operations. A seminal result by Bennett et al. [Phys. Rev. A 59, 1070 (1999)] demonstrates the…
The surface code family is a promising approach to implementing fault-tolerant quantum computations. Universal fault-tolerance requires error-corrected non-Clifford operations, in addition to Clifford gates, and for the former, it is…
We investigate sampling procedures that certify that an arbitrary quantum state on $n$ subsystems is close to an ideal mixed state $\varphi^{\otimes n}$ for a given reference state $\varphi$, up to errors on a few positions. This task makes…