We consider quantum computing in the k-qubit model where the starting state of a quantum computer consists of k qubits in a pure state and n-k qubits in a maximally mixed state. We ask the following question: is there a general method for simulating an arbitrary m-qubit pure state quantum computation by a quantum computation in the k-qubit model? We show that, under certain constraints, this is impossible, unless m=O(k+ log n).
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 efficient classical algorithms are known. We suggest a new implementation of quantum computation with initially mixed states in which an algorithm realization is achieved by means of optimal basis independent transformations of qubits.
We give a constructive proof that all mixed states of N qubits in a sufficiently small neighborhood of the maximally mixed state are separable. The construction provides an explicit representation of any such state as a mixture of product states. We give upper and lower bounds on the size of the neighborhood, which show that its extent decreases exponentially with the number of qubits. We also discuss the implications of the bounds for NMR quantum computing.
We show that a highly-mixed state in terms of a large min-entropy is useless as a resource state for measurement-based quantum computation in the sense that if a classically efficiently verifiable problem is efficiently solved with such a highly-mixed measurement-based quantum computation then such a problem can also be classically efficiently solved. We derive a similar result also for the DQC1$_k$ model, which is a generalized version of the DQC1 model where $k$ output qubits are measured. We also show that the measurement-based quantum computing on a highly-mixed resource state in terms of …
We study production of entanglement with highly-mixed states. We find that entanglement between highly mixed states can be generated via a direct unitary interaction even when both states have purities arbitrarily close to zero. This indicates that purity of a subsystem is not required for entanglement generation. Our result is in contrast to previous studies where the importance of the subsystem purity was emphasized.
We prove that for many ranks r<2m-2, random rank r mixed states in bipartite mxm systems have relatively high Schmidt numbers, which is based on algebraic-geometric separability criterion proved in [1]. This also means that the algebraic-geometric separability criterion can be used to detect all low rank entangled mixed states outside a measure zero set.
We prove that universal quantum computation is possible using only (i) the physically natural measurement on two qubits which distinguishes the singlet from the triplet subspace, and (ii) qubits prepared in almost any three different (potentially highly mixed) states. In some sense this measurement is a `more universal' dynamical element than a universal 2-qubit unitary gate, since the latter must be supplemented by measurement. Because of the rotational invariance of the measurement used, our scheme is robust to collective decoherence in a manner very different to previous proposals - in effe…
Spin chains have been proposed as quantum wires in many quantum information processing architectures. Coherent transmission of quantum information over short distances is enabled by their internal dynamics, which drives the transport of single-spin excitations in perfectly polarized chains. Given the practical challenge of preparing the chain in a pure state, we propose to use a chain that is initially in the maximally mixed state. We compare the transport properties of pure and mixed-state chains, finding similarities that enable the experimental study of pure-state transfer by its simulation…
A fundamental requirement for the emergence of classical behavior from an underlying quantum description is that certain observed quantum systems make a transition to chaotic dynamics as their action is increased relative to $\hbar$. While experiments have demonstrated some aspects of this transition, the emergence of quantum trajectories with a positive Lyapunov exponent has never been observed directly. Here, we remove a major obstacle to achieving this goal by showing that, for the Duffing oscillator, the transition to a positive Lyapunov exponent can be resolved clearly from observed traje…
It is known that a macroscopic quantum superposition (MQS), when it is exposed to environment, decoheres at a rate scaling with the separation of its component states in phase space. This is more or less consistent with the well known proposition that a more macroscopic quantum state is reduced more quickly to a classical state in general. Effects of initial mixedness, however, on the subsequent decoherence of MQSs have been less known. In this paper, we study the evolution of a highly mixed MQS interacting with an environment, and compare it with that of a pure MQS having the same size of the…
We revise the problem first addressed by Braunstein and co-workers (Phys. Rev. Lett. {\bf 83} (5) (1999) 1054) concerning the separability of very noisy mixed states represented by general density matrices with the form $ρ_ε= (1-ε)M_d+ερ_1$. From a detailed numerical analysis, it is shown that: (1) there exist infinite values in the interval taken for the density matrix expansion coefficients, $-1\le c_{α_1,...,α_N}\le 1$, which give rise to {\em non-physical density matrices}, with trace equal to 1, but at least one {\em negative} eigenvalue; (2) there exist entangled matrices outside the pre…
Recent development of mixed-state encoding (MSE) allows pure-state logical information to be encoded by a bosonic (continuous-variable) system in mixed physical state. Despite interest due to its counter-intuitiveness, the utility of the current MSE scheme is limited due to several operational drawbacks, namely redundant information carrier, probabilistic initialisation, and requirement of discrete-variable measurement. In this work, we present a simplified MSE that does not suffer from any of these drawbacks. Specifically, our protocol encodes each qubit by only one mixed-state bosonic mode, …
We report on progress towards implementing mixed ion species quantum information processing for a scalable ion trap architecture. Mixed species chains may help solve several problems with scaling ion trap quantum computation to large numbers of qubits. Initial temperature measurements of linear Coulomb crystals containing barium and ytterbium ions indicate that the mass difference does not significantly impede cooling at low ion numbers. Average motional occupation numbers are estimated to be $\bar{n} \approx 130$ quanta per mode for chains with small numbers of ions, which is within a factor …
Computing entanglement of an arbitrary bipartite or multipartite mixed state is in general not an easy task as it usually involves complex optimization. Here we show that exploiting symmetries of certain mixed states, we can compute a genuine multiparty entanglement measure, the generalized geometric measure for these classes of mixed states. The chosen states have different ranks and consist of an arbitrary number of parties.
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…
We investigate a scheme for topological quantum computing using optical hybrid qubits and make an extensive comparison with previous all-optical schemes. We show that the photon loss threshold reported by Omkar {\it et al}. [Phys. Rev. Lett. 125, 060501 (2020)] can be improved further by employing postselection and multi-Bell-state-measurement based entangling operation to create a special cluster state, known as Raussendorf lattice for topological quantum computation. In particular, the photon loss threshold is enhanced up to $5.7\times10^{-3}$, which is the highest reported value given a rea…
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…
The question of the generation of random mixed states is discussed, aiming for the computation of probabilistic characteristics of composite finite dimensional quantum systems. Particularly, we consider the generation of the random Hilbert-Schmidt and Bures ensembles of qubit and qutrit pairs and compute the corresponding probabilities to find a separable state among the states of a fixed rank.
Density Matrix Renormalization Group (DMRG) algorithm has been extremely successful for computing the ground states of one-dimensional quantum many-body systems. For problems concerned with mixed quantum states, however, it is less successful in that either such an algorithm does not exist yet or that it may return unphysical solutions. Here we propose a positive matrix product ansatz for mixed quantum states which preserves positivity by construction. More importantly, it allows to build a DMRG algorithm which, the same as the standard DMRG for ground states, iteratively reduces the global op…
We show that qubits coupled sequentially to a mesoscopic static completely mixed spin bath via the Heisenberg interaction can become highly entangled. Straightforward protocols for the generation of multipartite entangled (Greenberger-Horne-Zeilinger-)states are presented. We show the feasibility of an experimental realization in a quantum dot by the hyperfine interaction of an electron with the nuclear spins.
Quantum computing is quickly turning from a promise to a reality, witnessing the launch of several cloud-based, general-purpose offerings, and IDEs. Unfortunately, however, existing solutions typically implicitly assume intimate knowledge about quantum computing concepts and operators. This paper introduces Quantum Service-Oriented Computing (QSOC), including a model-driven methodology to allow enterprise DevOps teams to compose, configure and operate enterprise applications without intimate knowledge on the underlying quantum infrastructure, advocating knowledge reuse, separation of concerns,…
Distance measures are indispensable tools in quantum information processing and quantum computing. This since they can be used to quantify to what extent information is preserved, or altered, by quantum processes. In this paper we propose a new distance measure for mixed quantum states, that we call the dynamic distance measure, and show that it is a proper distance measure. The dynamic distance measure is defined in terms of a measurable quantity, which make it very suitable for applications. In a final section we compare the dynamical distance measure with the well-known Bures distance.
