Related papers: Magic State Distillation at Intermediate Size
We consider distillation of entanglement from two qubit states which are mixtures of three mutually orthogonal states: two pure entangled states and one pure product state. We distill entanglement from such states by projecting n copies of…
We provide a simple security proof for prepare & measure quantum key distribution protocols employing noisy processing and one-way postprocessing of the key. This is achieved by showing that the security of such a protocol is equivalent to…
Given an ensemble of mixed qubit states, it is possible to increase the purity of the constituent states using a procedure known as state purification. The reverse operation, which we refer to as dilution, reduces the level of purity…
Minimizing both experimental effort and consumption of valuable quantum resources in state estimation is vital in practical quantum information processing. Here, we explore characterizing states as an additional benefit of the entanglement…
We introduce Magic Secret Sharing (MSS), a quantum cryptographic primitive in which the secret is the computational capability of a quantum state rather than its classical description. In the resource theory of magic, non-stabilizer states…
We study the compression of n quantum systems, each prepared in the same state belonging to a given parametric family of quantum states. For a family of states with f independent parameters, we devise an asymptotically faithful protocol…
We show that all entangled Gaussian states of two infinite dimensional systems can be distilled to maximally entangled states in finite dimensions. The distillation protocol involves local squeezing operations, local homodyne measurements…
Using error correcting codes and fault tolerant techniques, it is possible, at least in theory, to produce logical qubits with significantly lower error rates than the underlying physical qubits. Suppose, however, that the gates that act on…
We put forward a method for optimized distillation of partly entangled pairs of qubits into a smaller number of more entangled pairs by recurrent local unitary operations and projections. Optimized distillation is achieved by minimization…
In fault-tolerant quantum computing with the surface code, non-Clifford gates are crucial for universal computation. However, implementing these gates using methods like magic state distillation and code switching requires significant…
Many problems in quantum information theory can be formulated as optimizations over the sequential outcomes of dynamical systems subject to unpredictable external influences. Such problems include many-body entanglement detection through…
The quantum states corresponding to a secret key are characterized using the so-called private states, where the key part consisting of a secret key is shielded by the additional systems. Based on the construction, it was shown that a…
Intermediate step methodologies like chain of thoughts (COT) have demonstrated effectiveness in enhancing the performance of Large Language Models (LLMs) on code generation. This study explores the utilization of intermediate languages,…
In this work, we explore a new approach to designing both algorithms and error detection codes for preparing approximate ground states of molecules. We propose a classical algorithm to find the optimal stabilizer state by using excitations…
A reliable source of identical (indistinguishable) photons is a prerequisite for exploiting interference effects, which is a necessary component for linear optical based quantum computing, and applications thereof such as Boson sampling.…
In a recent work by Maitra et al. (Phys. Rev. A, 2017), it was shown that the existing Quantum Private Query (QPQ) protocols fail to maintain the database security if the entangled states shared between Alice and Bob are not of a certain…
We consider the task of distilling local purity from a noisy quantum state $\rho^{ABC}$, wherein we provide a protocol for three parties, Alice, Bob and Charlie, to distill local purity (at a rate $P$) from many independent copies of a…
We compute on all quantum states several measures that characterise asymptotic quantum coherence manipulation under restricted classes of operations. We focus on the distillable coherence, i.e. the maximum rate of production of approximate…
The quantum relative entropy is known to play a key role in determining the asymptotic convertibility of quantum states in general resource-theoretic settings, often constituting the unique monotone that is relevant in the asymptotic…
We propose a method for universal fault-tolerant quantum computation using concatenated quantum error correcting codes. Namely, other than computational basis state preparation as required by the DiVincenzo criteria [1], our scheme requires…