Related papers: Macroscopic entanglement in Quantum Computation
We propose a classical to quantum information encoding system using non--orthogonal states and apply it to the problem of searching an element in a quantum list. We show that the proposed encoding scheme leads to an exponential gain in…
Recent advances in quantum technology facilitate the realization of information processing using quantum computers at least on the small and intermediate scales of up to several dozens of qubits. We investigate entanglement cost required…
We present an experimentally implementable method to couple Josephson charge qubits and to generate and detect macroscopic entangled states. A large-junction superconducting quantum interference device is used in the qubit circuit for both…
Graph states form a rich class of entangled states that exhibit important aspects of multi-partite entanglement. At the same time, they can be described by a number of parameters that grows only moderately with the system size. They have a…
We discuss a model for quantum computing with initially mixed states. Although such a computer is known to be less powerful than a quantum computer operating with pure (entangled) states, it may efficiently solve some problems for which no…
We define the algorithmic complexity of a quantum state relative to a given precision parameter, and give upper bounds for various examples of states. We also establish a connection between the entanglement of a quantum state and its…
The computation of quantum entanglement can be formulated as a high-dimensional nonconvex optimization problem with orthogonality constraints. In this work, we propose structure-preserving consensus-based optimization (CBO) methods for…
We give for the first time a diagrammatic calculational tool of quantum entanglement. We present a pedagogical and simple mechanical implementation of quantum entanglement or "spooky action at a distance" to give a tangible realization of…
Entangled many-body states are an essential resource for quantum computing and interferometry. Determining the type of entanglement present in a system usually requires access to an exponential number of parameters. We show that in the case…
Quantum entanglement of identical particles is essential in quantum information theory. Yet, its correct determination remains an open issue hindering the general understanding and exploitation of many-particle systems. Operator-based…
Quantum entanglement is an essential feature of many-body systems that impacts both quantum information processing and fundamental physics. The growth of entanglement is a major challenge for classical simulation methods. In this work, we…
We propose an algorithm which proves a given bipartite quantum state to be separable in a finite number of steps. Our approach is based on the search for a decomposition via a countable subset of product states, which is dense within all…
Our investigation aims to study the specific role played by entanglement in the quantum computation process, by elaborating an entangled spin model developed within the 'hidden measurement approach' to quantum mechanics. We show that an…
Solving the discrete logarithm problem (DLP) with quantum computers is a fundamental task with important implications. Beyond Shor's algorithm, many researchers have proposed alternative solutions in recent years. However, due to current…
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by solving instances of the HSP. A common feature of the…
Classifying states as entangled or separable is a highly challenging task, while it is also one of the foundations of quantum information processing theory. This task is higly nontrivial even for relatively simple cases, such as two-qutrit…
Grover's search algorithm is designed to be executed on a quantum mechanical computer. In this paper, the probabilistic wp-calculus is used to model and reason about Grover's algorithm. It is demonstrated that the calculus provides a…
The rapid progress of computer science has been accompanied by a corresponding evolution of computation, from classical computation to quantum computation. As quantum computing is on its way to becoming an established discipline of…
Quantum computing is an emerging field of science which will eventually lead us to new and powerful logic devices with capabilities far beyond the limits of current transistor-based technology. There are certain types of problems which…
Entanglement is one of the fundamental properties of a quantum state and is a crucial differentiator between classical and quantum computation. There are many ways to define entanglement and its measure, depending on the problem or…