Related papers: MagicPool: Dealing with Magic State Distillation F…
Parallel Quantum Annealing is a technique to solve multiple optimization problems simultaneously. Parallel quantum annealing aims to optimize the utilization of available qubits on a quantum topology by addressing multiple independent…
We show that using qutrits rather than qubits leads to a substantial reduction in the overhead cost associated with an approach to fault-tolerant quantum computing known as magic state distillation. We construct a family of $[[9m-k, k,…
Quantum key distribution promises information-theoretically secure communication, with data post-processing playing a vital role in extracting secure keys from raw data. While hardware advancements have significantly improved practical…
Efficient constructions for quantum logic are essential since quantum computation is experimentally challenging. This thesis develops quantum logic synthesis as a paradigm for reducing the resource overhead in fault-tolerant quantum…
Quantum coherence in a qubit is vulnerable to environmental noise. When long quantum calculation is run on a quantum processor without error correction, the noise often causes fatal errors and messes up the calculation. Here, we propose…
Magic state distillation protocols have a complicated non-linear nature. Analysis of protocols is therefore usually restricted to one-parameter families of states, which aids tractability. We show that if we lift this one-parameter…
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…
It is challenging to transform an arbitrary quantum circuit into a form protected by surface code quantum error correcting codes (a variant of topological quantum error correction), especially if the goal is to minimise overhead. One of the…
Quantum network states are multipartite states built from distributing pairwise entanglement among parties and underpin the paradigm of quantum networks for quantum information processing. In this work we introduce the problem of partial…
We consider the task of secure multi-party distributed quantum computation on a quantum network. We propose a protocol based on quantum error correction which reduces the number of necessary qubits. That is, each of the $n$ nodes in our…
Quantum entanglement is widely recognized as one of the key resources for the advantages of quantum information processing, including universal quantum computation, reduction of communication complexity or secret key distribution. However,…
State preparation is a necessary component of many quantum algorithms. In this work, we combine a method for efficiently representing smooth differentiable probability distributions using matrix product states with recently discovered…
We introduce a mixed-state magic criterion, the Triangle Criterion, which plays a role for magic analogous to the Positive Partial Transposition (PPT) Criterion for entanglement: it combines strong detection capability, a clear geometric…
Fault-tolerant quantum computing requires high-fidelity logical magic states for implementing non-Clifford operations. Magic-state cultivation provides a lower-overhead route to logical magic-state preparation, but its efficiency is limited…
Identifying necessary and sufficient conditions for universal quantum computing is a long-standing open problem for which contextuality is, perhaps, the only promising solution [Howard et al., Nature 510, 351 (2014)]. To justify this…
Quantum entanglement shared by remote network nodes serves as a valuable resource for promising applications in distributed computing, cryptography, and sensing. However, distributing entanglement with high-quality via fiber optic routes…
Dataset distillation, a pragmatic approach in machine learning, aims to create a smaller synthetic dataset from a larger existing dataset. However, existing distillation methods primarily adopt a model-based paradigm, where the synthetic…
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…
As there is no quantum error correction code with universal set of transversal gates, several approaches have been proposed which, in combination of transversal gates, make universal fault-tolerant quantum computation possible. Magic state…
We provide an analysis of basic quantum information processing protocols under the effect of intrinsic non-idealities in cluster states. These non-idealities are based on the introduction of randomness in the entangling steps that create…