0 Computing with Highly Mixed States
نویسندگان
چکیده
We consider quantum computing in the one-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 kqubit model? We show that, under certain constraints, this is impossible, unless m = O(k + log n).
منابع مشابه
N ov 2 00 1 Random low rank mixed states are highly entangled Hao
We prove that for many low ranks r ≤ 2m − 3, random rank r mixed states in H A ⊗ H B have realtively high Schmidt numbers based on algebraic-geometric separability criterion proved in [1]. This also means that algebraic-geometric separability criterion can be used to detect all low rank entagled mixed states outside a measure zero set. Quantum entanglement was first noted as a feature of quantu...
متن کاملSecurity Challenges in Fog Computing in Healthcare
Background and Aim: The Fog Computing is a highly virtualized platform that provides storage, computing and networking services between the Cloud data centers and end devices. Fog computing fits the characteristics of real-time health monitoring systems. In such systems, a large amount of data is acquired from a multitude of bio and environmental sensors. On the other hand, its distribution and...
متن کاملAlgebraic-geometric separability criterion and low rank mixed state entanglement
We first propose a new separability criterion based on algebraicgeometric invariants of bipartite mixed states introduced in [1], then prove that for all low ranks r ≤ m+n−3, generic rank r mixed states in H A ⊗ H B have realtively high Schmidt numbers by this separability criterion (thus entangled). This also means that the algebraicgeometric separability criterion prposed here can be used to ...
متن کاملExperimental quantum computing without entanglement.
Deterministic quantum computation with one pure qubit (DQC1) is an efficient model of computation that uses highly mixed states. Unlike pure-state models, its power is not derived from the generation of a large amount of entanglement. Instead it has been proposed that other nonclassical correlations are responsible for the computational speedup, and that these can be captured by the quantum dis...
متن کاملua nt - p h / 99 11 06 1 v 1 1 5 N ov 1 99 9 Time dynamics in chaotic many - body systems : can chaos destroy a quantum computer ?
Highly excited many-particle states in quantum systems (nuclei, atoms, quantum dots, spin systems, quantum computers) can be " chaotic " superpositions of mean-field basis states (Slater determinants, products of spin or qubit states). This is a result of the very high energy level density of many-body states which can be easily mixed by a residual interaction between particles. We consider the...
متن کامل