Entanglement is widely believed to lie at the heart of the advantages offered by a quantum computer. This belief is supported by the discovery that a noiseless (pure) state quantum computer must generate a large amount of entanglement in order to offer any speed up over a classical computer. However, deterministic quantum computation with one pure qubit (DQC1), which employs noisy (mixed) states, is an efficient model that generates at most a marginal amount of entanglement. Although this model cannot implement any arbitrary algorithm it can efficiently solve a range of problems of significant importance to the scientific community. Here we experimentally implement a first-order case of a key DQC1 algorithm and explicitly characterise the non-classical correlations generated. Our results show that while there is no entanglement the algorithm does give rise to other non-classical correlations, which we quantify using the quantum discord - a stronger measure of non-classical correlations that includes entanglement as a subset. Our results suggest that discord could replace entanglement as a necessary resource for a quantum computational speed-up. Furthermore, DQC1 is far less resource intensive than universal quantum computing and our implementation in a scalable architecture highlights the model as a practical short-term goal.
This note shows how quantum entanglement may be simulated in classical computing. The simulated entanglement protocol is implemented using oblivious transfer in the simplest case and other many-to-one mappings in more general cases. For the case where the mapping is of order k, we prove a theorem that gives us the function of the entangled state. A useful generalization beyond this research will be the implementation of quantum states with arbitrary probability amplitude functions.
In this paper we provide an operational method to detect multipartite entanglement in ensemble-based quantum computing. This method is based on the concept of entanglement witness. We decompose the entanglement witness for each class of multipartite entanglement into nonlocal operations in addition to local measurements. Individual single qubit measurements are performed simultaneously, hence complete detection of entanglement is performed in a single run experiment. This approach is particularly important for experiments where it is operationally difficult to prepare several copies of an unkn…
In arXiv:1208.0365 entanglement polytopes where introduced as a coarsening of the SLOCC classification of multipartite entanglement. The advantages of classifying entanglement by entanglement polytopes are a finite hierarchy for all dimensions and a number of parameters linear in system size. In arXiv:1208.0365 a method to compute entanglement polytopes using geometric invariant theory is presented. In this thesis we consider alternative methods to compute them. Some geometrical and algebraical tools are presented that can be used to compute inequalities giving an outer approximation of the en…
In this work, we have been working on the concept of quantum entanglement. At first, we studied the theory of entanglement in its characterization and measurement, introducing a new scheme for detection of entanglement. The new approach links molecular-spin entities involving nuclear spins to quantum computing as more appropriate physical systems of interest. Then, we continued with the realization of entanglement in experiments. NMR has been the first choice due to its well approved advantages for quantum computing. NMR, however, has not been an appropriate system for demonstrating entangled …
The role of entanglement and quantum correlations in complex physical systems and quantum information processing devices has become a topic of intense study in the past two decades. In this work we present new tools for learning about entanglement and quantum correlations in dynamical systems where the quantum states are mixed and the eigenvalue spectrum is highly degenerate. We apply these results to the Deterministic quantum computing with one qubit (DQC1) computation model and show that the states generated in a DQC1 circuit have an eigenvalue structure that makes them difficult to entangle…
In the discussion about the quantumness of NMR computation a conclusion is done that computational states are separable and therefore can not be entangled. This conclusion is based on the assumption that the initial density matrix of an individual molecule coincides with whole sample molecules distribution over single molecule energy levels. This means that quantum stochasticity is replaced by classical stochasticity. In the present paper it is shown, that quantum NMR computation can create genuine entangled states if initial system states are thermodynamical equilibrium ones. A separability a…
Distributed variational quantum computing with deterministic entanglement tuning
Korea Institute of Science and Technology (KIST)（韩国科学技术院）；Kyung Hee University（庆熙大学）；Korea University of Science and Technology（韩国科学技术院）；Korea Institute for Advanced Study（韩国高等研究院）；Korea University（高丽大学）
We consider quantum computing with pseudo-pure states. This framework arises in certain implementations of quantum computing using NMR. We analyze quantum computational protocols which aim to solve exponential classical problems with polynomial resources and ask whether or not entanglement of the pseudo-pure states is needed to achieve this aim. We show that for a large class of such protocols, including Shor's factorization, entanglement is necessary. We also show that achieving entanglement is not sufficient: if the noise in the state is sufficiently large, exponential resources are needed e…
We study the computational complexity of quantum discord (a measure of quantum correlation beyond entanglement), and prove that computing quantum discord is NP-complete. Therefore, quantum discord is computationally intractable: the running time of any algorithm for computing quantum discord is believed to grow exponentially with the dimension of the Hilbert space so that computing quantum discord in a quantum system of moderate size is not possible in practice. As by-products, some entanglement measures (namely entanglement cost, entanglement of formation, relative entropy of entanglement, sq…
The partial transpose (PT) is an important function for entanglement testing and quantification and also for the study of geometrical aspects of the quantum state space. In this article, considering general bipartite and multipartite discrete systems, explicit formulas ready for the numerical implementation of the PT and of related entanglement functions are presented and the Fortran code produced for that purpose is described. What is more, we obtain an analytical expression for the Hilbert-Schmidt entanglement of two-qudit systems and for the associated closest separable state. In contrast t…
Continuous-variable (CV) cluster states are a universal quantum computing platform that has experimentally out-scaled qubit platforms by orders of magnitude. Room-temperature implementation of CV cluster states has been achieved with quantum optics by using multimode squeezed Gaussian states. It has also been proven that fault tolerance thresholds for CV quantum computing can be reached at realistic squeezing levels. In this paper, we show that standard approaches to design and characterize CV cluster states can miss entanglement present in the system. Such hidden entanglement may be used to i…
Quantum algorithms could efficiently solve certain classically intractable problems by exploiting quantum parallelism. To date, whether the quantum entanglement is useful or not for quantum computing is still a question of debate. Here, we present a new quantum algorithm to show that entanglement could help to gain advantage over classical algorithm and even the quantum algorithm without entanglement. Furthermore, we implement experiments to demonstrate our proposed algorithm using superconducting qubits. Our results show the viability of the algorithm and suggest that entanglement is essentia…
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 of the outcome after a xed number of oracle calls. Using a separable (that is, unentangled) n-qubit state, we show that the Deutsch-Jozsa problem and the Simon problem can be solved more reliably by a quantum computer than by the best possible classical algorithm, even probabilistic. We conclude that: (a) entanglement is not essential for quantum computing;…
We claim that the nonlocality without entanglement revealed quite recently by Bennett {\it et al.} [quant-ph/9804053] should be rather interpreted as {\it Einstein-Podolsky-Rosen paradox without entanglement}. It would be true nonlocality without entanglement if one knew that quantum mechnics provides the best possible means for extracting information from physical system i.e. that it is ``operationally complete''.
The quantum nature of bulk ensemble NMR quantum computing --the center of recent heated debate, is addressed. Concepts of the mixed state and entanglement are examined, and the data in a 2 qubit liquid NMR quantum computation are analyzed. It is pointed out that the key problem in the current debate is the understanding of entanglement in a mixed state system. The following points are concluded in this Letter: 1)Density matrix describes the "state" of an average particle in an ensemble. It can not describe the state of an individual particle in an ensemble in detail; 2) Entanglement is a prope…
We propose an entanglement swapping scheme in cavity QED. In the scheme, the previously used joint measurement is not needed. The entanglement swapping in our proposal is a non-post-selection one, i.e., after the swapping is done, the swapped entanglement is still there.
Entanglement of quantum variables is usually thought to be a prerequisite for obtaining quantum speed-ups of information processing tasks such as searching databases. This paper presents methods for quantum search that give a speed-up over classical methods, but that do not require entanglement. These methods rely instead on interference to provide a speed-up. Search without entanglement comes at a cost: although they outperform analogous classical devices, the quantum devices that perform the search are not universal quantum computers and require exponentially greater overhead than a quantum …
There are many possible architectures of qubit connectivity that designers of future quantum computers will need to choose between. However, the process of evaluating a particular connectivity graph's performance as a quantum architecture can be difficult. In this paper, we show that a quantity known as the isoperimetric number establishes a lower bound on the time required to create highly entangled states. This metric we propose counts resources based on the use of two-qubit unitary operations, while allowing for arbitrarily fast measurements and classical feedback. We use this metric to eva…
This paper shows how to construct quantum entanglement states of n qubits based on a self-stabilizing token ring algorithm. The entangled states can be applied to the fields of the quantum network, quantum Internet, distributed quantum computing, and quantum cloud. To the best of our knowledge, this is the first attempt to construct quantum entanglement based on the self-stabilizing algorithm. By the quantum circuit implementation based on the IBM Quantum Experience platform, it is demonstrated that the construction indeed can achieve specific n qubit entangled states, which in turn can be use…
Exploiting multiple modes in a quantum acoustic device could enable applications in quantum information in a hardware-efficient setup, including quantum simulation in a synthetic dimension and continuous-variable quantum computing with cluster states.We develop a multimode surface acoustic wave (SAW) resonator with a superconducting quantum interference device (SQUID) integrated in one of the Bragg reflectors. The interaction with the SQUID-shunted mirror gives rise to coupling between the more than 20 accessible resonator modes. We exploit this coupling to demonstrate two-mode squeezing of SA…
We propose a quantum key distribution (QKD) protocol that enables three parties agree at once on a shared common random bit string in presence of an eavesdropper without use of entanglement. We prove its unconditional security and analyze the key rate.
We combine the eyebrow-raising quantum phenomena of erasure and counterfactuality for the first time, proposing a simple yet unusual quantum eraser: A distant Bob can decide to erase which-path information from Alice's photon, dramatically restoring interference, without previously-shared entanglement, and without Alice's photon ever leaving her lab.
Multipartite entanglement has been widely regarded as key resources in distributed quantum computing, for instance, multi-party cryptography, measurement based quantum computing, quantum algorithms. It also plays a fundamental role in quantum phase transitions, even responsible for transport efficiency in biological systems. Certifying multipartite entanglement is generally a fundamental task. Since an $N$ qubit state is parameterized by $4^N-1$ real numbers, one is interested to design a measurement setup that reveals multipartite entanglement with as little effort as possible, at least witho…
We experimentally demonstrate a simple scheme for generating a four-photon entangled cluster state with fidelity over 0.860 $\pm$ 0.015. We show that the fidelity is high enough to guarantee that the produced state is distinguished from Greenberger-Horne-Zeilinger, W, and Dicke types of genuine four-qubit entanglement. We also demonstrate basic operations of one-way quantum computing using the produced state and show that the output state fidelities surpass classical bounds, which indicates that the entanglement in the produced state essentially contributes to the quantum operation.
We discuss how continous-variable quantum states such as coherent states and two-mode squeezed states can be encoded in phase-reference independent ways.
Multipartite entanglement constitutes one of the key resources in quantum information processing. We exploit correlation tensor norms to develop a framework for its experimental detection without the need for shared frames of reference. By bounding these norms for partially separable states and states of limited dimension we achieve an extensive characterization of entanglement in multipartite systems in an experimentally feasible way. Furthermore we show that both bi- and multipartite dimensionality of entanglement can be revealed by our methods.
We propose a scheme for measuring the squeezing, purity, and entanglement of Gaussian states of light that does not require homodyne detection. The suggested setup only needs beam splitters and single-photon detectors. Two-mode entanglement can be detected from coincidences between photodetectors placed on the two beams.
Entanglement, which is an essential characteristic of quantum mechanics, is the key element in potential practical quantum information and quantum communication systems. However, there are many open and fundamental questions (relating to entanglement measures, sudden death, etc.) that require a deeper understanding. Thus, we are motivated to investigate a simple but non-trivial correlated two-body continuous variable system in the absence of a heat bath, which facilitates an \underline{exact} measure of the entanglement at all times. In particular, we find that the results obtained from all we…
Entanglement is an essential resource in current experimental implementations for quantum information processing. We review a class of experiments exploiting photonic entanglement, ranging from one-way quantum computing over quantum communication complexity to long-distance quantum communication. We then propose a set of feasible experiments that will underline the advantages of photonic entanglement for quantum information processing.
Phenomena induced by the existence of entanglement, such as nonlocal correlations, exhibit characteristic properties of quantum mechanics distinguishing from classical theories. When entanglement is accompanied by classical communication, it enhances the power of quantum operations jointly performed by two spatially separated parties. Such a power has been analyzed by the gap between the performances of joint quantum operations implementable by local operations at each party connected by classical communication with and without the assistance of entanglement. In this work, we present a new for…
Quantum cryptography is reviewed, first using entanglement both for the intuition and for the experimental realizations. Next, the implementation is simplified in several steps until it becomes practical. At this point entanglement has disappeared. This method can be seen as a lesson of Applied Physics. Finally, security issues, e.g. photon number splitting attacks, and counter-measures are discussed.
Based on quantum complementary relations (QCRs) and a purification scenario, we analyze a class of N-qubit mixed states that are entangled but do not have two-, and genuine three-, four-, ..., N-qubit entanglements. It is shown that entanglement (one-tangle or negativity) in these mixed states is closely related to the QCR entanglement of their purified states. In particular, it is elaborated that when the mixed state does not have multipartite tangles (two- and higher tangles), its entanglement is actually a kind of genuine multipartite QCR entanglement between the system and its environment.
Quantum separable operations are defined as those that cannot produce entanglement from separable states, and it is known that they strictly surpass local operations and classical communication (LOCC) in a number of tasks, which is sometimes referred to as "quantum nonlocality without entanglement." Here we consider a task with such a gap regarding the trade-off between state discrimination and preservation of entanglement. We show that this task along with the gap has an analogue in a purely classical setup, indicating that the quantum properties are not essential in the existence of a nonzer…
