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 evaluate the hierarchical architecture proposed by A. Bapat et al. [Phys. Rev. A 98, 062328 (2018)], and find it to be a promising alternative to the conventional grid architecture. We also show that the lower bound that this metric places on the creation time of highly entangled states can be saturated with a constructive protocol, up to a factor logarithmic in the number of qubits.
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…
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…
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 propose a quantum dot architecture for enabling universal quantum information processing. Quantum registers, consisting of arrays of vertically stacked self-assembled semiconductor quantum dots, are connected by chains of in-plane self-assembled dots. We propose an entanglement distributor, a device for producing and distributing maximally entangled qubits on demand, communicated through in-plane dot chains. This enables the transmission of entanglement to spatially separated register stacks, providing a resource for the realisation of a sizeable quantum processor built from coupled registe…
Quantum technology relies on the utilization of resources, like quantum coherence and entanglement, which allow quantum information and computation processing. This achievement is however jeopardized by the detrimental effects of the environment surrounding any quantum system, so that finding strategies to protect quantum resources is essential. Non-Markovian and structured environments are useful tools to this aim. Here we show how a simple environmental architecture made of two coupled lossy cavities enables a switch between Markovian and non-Markovian regimes for the dynamics of a qubit emb…
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…
A central challenge for many quantum technologies concerns the generation of large entangled states of individually addressable quantum memories. Here, we show that percolation theory allows the rapid production of arbitrarily large graph states by heralded photonic entanglement in a lattice of atomic memories. This approach can greatly reduce the time required to produce large cluster resource states for quantum information processing, including states required for universal one-way quantum computing. This reduction puts our architecture in an operational regime where demonstrated collection,…
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;…
The past decade has seen tremendous progress in experimentally realizing the building blocks of quantum repeaters. Repeater architectures with multiplexed quantum memories have been proposed to increase entanglement distribution rates, but an open challenge is to maintain entanglement fidelity over long-distance links. Here, we address this with a quantum router architecture comprising many quantum memories connected in a photonic switchboard to broker entanglement flows across quantum networks. We compute the rate and fidelity of entanglement distribution under this architecture using an even…
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…
In this paper we propose a technique for distributing entanglement in architectures in which interactions between pairs of qubits are constrained to a fixed network $G$. This allows for two-qubit operations to be performed between qubits which are remote from each other in $G$, through gate teleportation. We demonstrate how adapting \emph{quantum linear network coding} to this problem of entanglement distribution in a network of qubits can be used to solve the problem of distributing Bell states and GHZ states in parallel, when bottlenecks in $G$ would otherwise force such entangled states to …
Since star network of spins was proposed, generating entanglement directly through spin interactions between distant parties became much possible. We propose an architecture which involves coupled spin chains based on nitrogen-vacancy centers and nitrogen defect spins to expand star network, the numerical analysis shows that the length of spin chains $M$ and spin noise can determine the maximally achievable entanglement $E_m$. The entanglement capability of this configuration under effect of disorder and spin loss is also studied. Moreover, it is shown that with this kind of architecture, star…
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…
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 report the experimental realization of heralded distribution of single-photon path entanglement at telecommunication wavelengths in a repeater-like architecture. The entanglement is established upon detection of a single photon, originating from one of two spontaneous parametric down conversion photon pair sources, after erasing the photon's which-path information. In order to certify the entanglement, we use an entanglement witness which does not rely on post-selection. We herald entanglement between two locations, separated by a total distance of 2 km of optical fiber, at a rate of 1.6 kH…
Josephson junctions have demonstrated enormous potential as qubits for scalable quantum computing architectures. Here we discuss the current approaches for making multi-qubit circuits and performing quantum information processing with them.
The outstanding progress in nanostructure fabrication and cooling technologies allows what was unthinkable a few decades ago: bringing single-mode mechanical vibrations to the quantum regime. The coupling between photon and phonon excitations is a natural source of nonclassical states of light and mechanical vibrations, and its study within the field of cavity optomechanics is developing lightning-fast. Photonic crystal cavities are highly integrable architectures that have demonstrated the strongest optomechanical coupling to date, and should therefore play a central role for such hybrid quan…
Lattice surgery for near-term experimental logical qubit entanglement creation in planar architectures
Institute for Theoretical Nanoelectronics (PGI-2), Forschungszentrum Jülich（于利希研究中心理论纳米电子学研究所）；Institute for Quantum Information, RWTH Aachen University（亚琛工业大学量子信息研究所）；Department of Physics, ETH Zurich（苏黎世联邦理工学院物理系）；ETH Zurich - PSI Quantum Computing Hub, Paul Scherrer Institute（保罗谢勒研究所苏黎世联邦理工学院-PSI量子计算中心）；Quantum Center, ETH Zurich（苏黎世联邦理工学院量子中心）
