Usually models for quantum computations deal with unitary gates on pure states. In this paper we generalize the usual model. We consider a model of quantum computations in which the state is an operator of density matrix and the gates are quantum operations, not necessarily unitary. A mixed state (operator of density matrix) of n two-level quantum systems is considered as an element of $4^{n}$-dimensional operator Hilbert space. Unitary quantum gates and nonunitary quantum operations for n-qubit system are considered as generalized quantum gates acting on mixed state. In this paper we study universality for quantum computations by quantum operations on mixed states.
We study the physical resources required to implement general quantum operations, and provide new bounds on the minimum possible size which an environment must be in order to perform certain quantum operations. We prove that contrary to a previous conjecture, not all quantum operations on a single-qubit can be implemented with a single-qubit environment, even if that environment is initially prepared in a mixed state. We show that a mixed single-qutrit environment is sufficient to implement a special class of operations, the generalized depolarizing channels.
We introduce an operational entanglement classification of symmetric mixed states for an arbitrary number of qubits based on stochastic local operations assisted with classical communication (SLOCC operations). We define families of SLOCC entanglement classes successively embedded into each other, we prove that they are of non-zero measure, and we construct witness operators to distinguish them. Moreover, we discuss how arbitrary symmetric mixed states can be realized in the lab via a one-to-one correspondence between well-defined sets of controllable parameters and the corresponding entanglem…
It is shown that the observability of a large class of operations on mixed states is fundamentally limited. We consider trace preserving, unital operations. This class includes unitary and perfect premeasurement operations. An upper bound on the trace distance between an untransformed state and a state transformed by one of these operations is derived. The bound is dependent only on the purity of the state. In the case of maximal mixedness, the bound implies all operations of this class are unobservable.
We present a general theoretical method to generate maximally entangled mixed states of a pair of photons initially prepared in the singlet polarization state. This method requires only local operations upon a single photon of the pair and exploits spatial degrees of freedom to induce decoherence. We report also experimental confirmation of these theoretical results.
We extend the concept of the relative error to mixed-state cloning and related physical operations, in which the ancilla contains some a priori information about the input state. The lower bound on the relative error is obtained. It is shown that this result contributes to the stronger no-cloning theorem.
We experimentally demonstrate optimal entanglement distillation from two forms of two-qubit mixed states under local filtering operations according to the constructive method intruduced by F. Verstraete et al. [Phys. Rev. A 64, 010101(R) (2001)]. In principle, our set-up can be easily applied to distilling entanglement from arbitrary two-qubit partially mixed states. We also test the violation of the Clauser-Horne-Shinmony-Holt (CHSH) inequality for the distilled state from the first form of mixed state to show its "hidden non-locality".
We show that the classification of bi-partite pure entangled states when local quantum operations are restricted yields a structure that is analogous in many respects to that of mixed-state entanglement. Specifically, we develop this analogy by restricting operations through local superselection rules, and show that such exotic phenomena as bound entanglement and activation arise using pure states in this setting. This analogy aids in resolving several conceptual puzzles in the study of entanglement under restricted operations. In particular, we demonstrate that several types of quantum optica…
To implement any quantum operation (a.k.a. ``superoperator'' or ``CP map'') on a d-dimensional quantum system, it is enough to apply a suitable overall unitary transformation to the system and a d^2-dimensional environment which is initialized in a fixed pure state. It has been suggested that a d-dimensional environment might be enough if we could initialize the environment in a mixed state of our choosing. In this note we show with elementary means that certain explicit quantum operations cannot be realized in this way. Our counterexamples map some pure states to pure states, giving strong an…
In the task of assisted coherence distillation via the set of operations X, where X is either local incoherent operations and classical communication (LICC), local quantum-incoherent operations and classical communication (LQICC), separable incoherent operations (SI), or separable quantum incoherent operations (SQI), two parties, namely Alice and Bob, share many copies of a bipartite joint state. The aim of the process is to generate the maximal possible coherence on the subsystem of Bob. In this paper, we investigate the assisted coherence distillation of some special mixed states, the states…
Unambiguous state discrimination of two mixed bipartite states via local operations and classical communications (LOCC) is studied and compared with the result of a scheme realized via global measurement. We show that the success probability of a global scheme for mixed-state discrimination can be achieved perfectly by the local scheme. In addition, we simulate this discrimination via a pair of pure entangled bipartite states. This simulation is perfect for local rather than global schemes due to the existence of entanglement and global coherence in the pure states. We also prove that LOCC pro…
Quantum states transformation under free operations plays a central role in the resource theory of coherence. In this paper, we investigate the transformation from a mixed coherent state into a pure one by using both incoherent operations and stochastic incoherent operations. We show that contrary to the strictly incoherent operations and the stochastic strictly incoherent operations, both the incoherent operations and the stochastic incoherent operations can increase the dimension of the maximal pure coherent subspace of a state. This means that the incoherent operations are generally stronge…
We consider entanglement-assisted remote quantum state manipulation of bi-partite mixed states. Several aspects are addressed: we present a class of mixed states of rank two that can be transformed into another class of mixed states under entanglement-assisted local operations with classical communication, but for which such a transformation is impossible without assistance. Furthermore, we demonstrate enhancement of the efficiency of purification protocols with the help of entanglement-assisted operations. Finally, transformations from one mixed state to mixed target states which are sufficie…
The remarkable phenomenon of catalyst tells us that adding a catalyst could help state transformation. In this paper, we consider the problem of catalyst-assisted probabilistic coherence distillation for mixed states under strictly incoherent operations. To this end, we first present the necessary and sufficient conditions for distilling a target pure coherent state from an initial mixed state via stochastic strictly incoherent operations and the maximal probability of obtaining the target pure state from the initial state. With the help of these results, we present the necessary and sufficien…
In the framework of quantum computation with mixed states, a fuzzy representation of CNOT gate is introduced. In this representation, the incidence of non-factorizability is specially investigated.
Nielsen characterized in full those 2-party quantum protocols of local operations and classical communication that transform, with probability one, a pure global initial state into a pure global final state. The present work considers the generalization of Nielsen's characterization to n-party protocols. It presents a sweeping generalization of the only if part of Nielsen's result. The result presented here pertains also to protocols that do not generate a final state for sure, it considers arbitrary mixed initial states instead of pure states and n-party protocols for an arbitrary n. In this …
For manipulations of multipartite quantum systems, it was well known that all local operations assisted by classical communication (LOCC) constitute a proper subset of the class of separable operations. Recently, Gheorghiu and Griffiths found that LOCC and general separable operations are equally powerful for transformations between bipartite pure states. In this letter we extend this comparison to mixed states and show that in general separable operations are strictly stronger than LOCC when transforming a mixed state to a pure entangled state. A remarkable consequence of our finding is the e…
We derive necessary and sufficient conditions for local unitary (LU) operators to leave invariant the set of 1-qubit reduced density matrices of a multi-qubit state. LU operators with this property are tensor products of {\it cyclic local} operators, and form a subgroup, the centralizer subgroup of the set of reduced states, of the Lie group $SU(2)^{\otimes n}$. The dimension of this subgroup depends on the type of reduced density matrices. It is maximum when all reduced states are maximally mixed and it is minimum when none of them is maximally mixed. For any given multi-qubit state, pure or …
The Groverian entanglement measure introduced earlier for pure quantum states [O. Biham, M.A. Nielsen and T. Osborne, Phys. Rev. A 65, 062312 (2002)] is generalized to the case of mixed states, in a way that maintains its operational interpretation. The Groverian measure of a mixed state of n qubits is obtained by a purification procedure into a pure state of 2n qubits, followed by an optimization process based on Uhlmann's theorem, before the resulting state is fed into Grover's search algorithm. The Groverian measure, expressed in terms of the maximal success probability of the algorithm, pr…
We consider a single copy of a mixed state of two qubits and derive the optimal trace-preserving local operations assisted by classical communication (LOCC) such as to maximize the fidelity of teleportation that can be achieved with this state. These optimal local operations turn out to be implementable by one-way communication, and always yields a teleportation fidelity larger than 2/3 if the original state is entangled. This maximal achievable fidelity is an entanglement measure and turns out to quantify the minimal amount of mixing required to destroy the entanglement in a quantum state.
Using an algebraic framework we solve a problem posed in [5] and [7] about the axiomatizability of a quantum computational type logic related to fuzzy logic. A Hilbert-style calculus is developed obtaining an algebraic strong completeness theorem.
Entanglement of two parts of a quantum system is a non-local property unaffected by local manipulations of these parts. It is described by quantities invariant under local unitary transformations. Here we present, for a system of two qubits, a set of invariants which provides a complete description of non-local properties. The set contains 18 real polynomials of the entries of the density matrix. We prove that one of two mixed states can be transformed into the other by single-bit operations if and only if these states have equal values of all 18 invariants. Corresponding local operations can …
In a quantum computation with pure states, the generation of large amounts of entanglement is known to be necessary for a speedup with respect to classical computations. However, examples of quantum computations with mixed states are known, such as the deterministic computation with one quantum qubit (DQC1) model [Knill and Laflamme, Phys. Rev. Lett. 81, 5672 (1998)], in which entanglement is at most marginally present, and yet a computational speedup is believed to occur. Correlations, and not entanglement, have been identified as a necessary ingredient for mixed-state quantum computation spe…
Geometric phase has found a broad spectrum of applications in both classical and quantum physics, such as condensed matter and quantum computation. In this paper we introduce an operational geometric phase for mixed quantum states, based on spectral weighted traces of holonomies, and we prove that it generalizes the standard definition of geometric phase for mixed states, which is based on quantum interferometry. We also introduce higher order geometric phases, and prove that under a fairly weak, generically satisfied, requirement, there is always a well-defined geometric phase of some order. …
We consider one single copy of a mixed state of two qubits and investigate how its entanglement changes under local quantum operations and classical communications (LQCC) of the type $ρ'\sim (A\otimes B)ρ(A\otimes B)^{\dagger}$. We consider a real matrix parameterization of the set of density matrices and show that these LQCC operations correspond to left and right multiplication by a Lorentz matrix, followed by normalization. A constructive way of bringing this matrix into a normal form is derived. This allows us to calculate explicitly the optimal local filterin operations for concentrating …
We report on an experiment to detect non-classical correlations in a highly mixed state. The correlations are characterized by the quantum discord and are observed using four qubits in a liquid state nuclear magnetic resonance quantum information processor. The state analyzed is the output of a DQC1 computation, whose input is a single quantum bit accompanied by n maximally mixed qubits. This model of computation outperforms the best known classical algorithms, and although it contains vanishing entanglement it is known to have quantum correlations characterized by the quantum discord. This ex…
There exist several graphical languages for quantum information processing, like quantum circuits, ZX-Calculus, ZW-Calculus, etc. Each of these languages forms a dagger-symmetric monoidal category (dagger-SMC) and comes with an interpretation functor to the dagger-SMC of (finite dimension) Hilbert spaces. In the recent years, one of the main achievements of the categorical approach to quantum mechanics has been to provide several equational theories for most of these graphical languages, making them complete for various fragments of pure quantum mechanics. We address the question of the extens…
In this paper, we show how to use low-fidelity operations to control the dynamics of quantum systems. Noisy operations usually drive a system to evolve into a mixed state and damage the coherence. Sometimes frequent noisy operations result in the coherent evolution of a subsystem, and the dynamics of the subsystem is controlled by tuning noisy operations. Based on this, we find that universal quantum computation can be carried out by low-fidelity (fidelity $<90\%$) operations.
For multiqubit density operators in a suitable tensorial basis, we show that a number of nonunitary operations used in the detection and synthesis of entanglement are classifiable as reflection symmetries, i.e., orientation changing rotations. While one-qubit reflections correspond to antiunitary symmetries, as is known for example from the partial transposition criterion, reflections on the joint density of two or more qubits are not accounted for by the Wigner Theorem and are well-posed only for sufficiently mixed states. One example of such nonlocal reflections is the unconditional NOT oper…
We describe quantum-octave package of functions useful for simulations of quantum algorithms and protocols. Presented package allows to perform simulations with mixed states. We present numerical implementation of important quantum mechanical operations - partial trace and partial transpose. Those operations are used as building blocks of algorithms for analysis of entanglement and quantum error correction codes. Simulation of Shor's algorithm is presented as an example of package capabilities.
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 provide a unifying framework for exact, probabilistic, and approximate conversions by local operations and classical communication (LOCC) between bipartite states. This framework allows us to formulate necessary and sufficient conditions for LOCC conversions from pure states to mixed states and it provides necessary conditions for LOCC conversions between mixed states. The central idea is the introduction of convex sets for exact, probabilistic, and approximate conversions, which are closed under LOCC operations and which are largely characterized by simple properties of pure states.
Nonlocal quantum correlation is at the heart of bizarre nature of quantum physics. While there are various classes of nonlocal quantum correlation, steerability of a quantum state by local measurements provides unique operational features. Here, we theoretically and experimentally investigate the hidden quantum steerability. In particular, we find that there are initially unsteerable states which can reveal the steerability by using local filters on individual quantum systems. It is remarkable that a certain set of local filters are more effective on revealing steerability than Bell nonlocalit…
A relevant problem regarding entanglement measures is the following: Given an arbitrary mixed state, how does a measure for multipartite entanglement change if general local operations are applied to the state? This question is nontrivial as the normalization of the states has to be taken into account. Here we answer it for pure-state entanglement measures which are invariant under determinant 1 local operations and homogeneous in the state coefficients, and their convex-roof extension which quantifies mixed-state entanglement. Our analysis allows to enlarge the set of mixed states for which t…
Topological Quantum Compilation Using Mixed-Integer Programming
Czech Technical University in Prague（布拉格捷克理工大学）；University College Dublin（都柏林大学学院）；University of Sheffield（谢菲尔德大学）；Maynooth University（梅努斯大学）；Dublin Institute for Advanced Studies（都柏林高等研究院）；Tyndall National Institute（廷德尔国家研究所）
We present a quantum algorithm to estimate parameters at the quantum metrology limit using deterministic quantum computation with one bit. When the interactions occurring in a quantum system are described by a Hamiltonian $H= θH_0$, we estimate $θ$ by zooming in on previous estimations and by implementing an adaptive Bayesian procedure. The final result of the algorithm is an updated estimation of $θ$ whose variance has been decreased in proportion to the time of evolution under H. For the problem of estimating several parameters, we implement dynamical-decoupling techniques and use the result…
We consider mixed states of two qubits and show under which global unitary operations their entanglement is maximized. This leads to a class of states that is a generalization of the Bell states. Three measures of entanglement are considered: entanglement of formation, negativity and relative entropy of entanglement. Surprisingly all states that maximize one measure also maximize the others. We will give a complete characterization of these generalized Bell states and prove that these states for fixed eigenvalues are all equivalent under local unitary transformations. We will furthermore chara…
A strong entanglement monotone, which never increases under local operations and classical communications (LOCC), restricts quantum entanglement manipulation more strongly than the usual monotone since the usual one does not increase on average under LOCC. We propose new strong monotones in mixed-state entanglement manipulation under LOCC. These are related to the decomposability and 1-positivity of an operator constructed from a quantum state, and reveal geometrical characteristics of entangled states. These are lower bounded by the negativity or generalized robustness of entanglement.
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 present computable criterion for completely classifying multi-qubit quantum states under local unitary operations. The criterion can be used to detect whether two quantum states in multi-qubit systems are local unitary equivalent or not. Once obtaining the positive answer, we are further able to compute the corresponding unitary operators precisely. Since the scheme is based on the mean values of some quantum mechanical observables, it supplies an experimental way to judge the local equivalence of quantum states.
We define the model of quantum circuits with density matrices, where non-unitary gates are allowed. Measurements in the middle of the computation, noise and decoherence are implemented in a natural way in this model, which is shown to be equivalent in computational power to standard quantum circuits. The main result in this paper is a solution for the subroutine problem: The general function that a quantum circuit outputs is a probabilistic function, but using pure state language, such a function can not be used as a black box in other computations. We give a natural definition of using genera…
We operationally introduce mixed quantum t-designs as the most general arbitrary-rank extension of projective quantum t-designs which preserves indistinguishability from the uniform distribution for t copies. First, we derive upper bounds on the classical communication capacity of any mixed t-design measurement for t in [1,5]. Second, we explicitly compute the classical communication capacity of several mixed t-design measurements, including the depolarized version of any qubit and qutrit symmetric, informationally complete (SIC) measurement and complete mutually unbiased bases, the qubit icos…
Quantum coherence is a key element in topical research on quantum resource theories and a primary facilitator for design and implementation of quantum technologies. However, the resourcefulness of quantum coherence is severely restricted by environmental noise, which is indicated by the loss of information in a quantum system, measured in terms of its purity. In this work, we derive the limits imposed by the mixedness of a quantum system on the amount of quantum coherence that it can possess. We obtain an analytical trade-off between the two quantities that upperbound the maximum quantum coher…
In this paper we discuss a model of quantum computer in which a state is an operator of density matrix and gates are general quantum operations, not necessarily unitary. A mixed state (operator of density matrix) of n two-level quantum systems is considered as an element of 4^n-dimensional operator Hilbert space (Liouville space). It allows to use a quantum computer model with four-valued logic. The gates of this model are general superoperators which act on n-ququat state. Ququat is a quantum state in a four-dimensional (operator) Hilbert space. Unitary two-valued logic gates and quantum oper…
Quantum computing is in an era of limited resources. Current hardware lacks high fidelity gates, long coherence times, and the number of computational units required to perform meaningful computation. Contemporary quantum devices typically use a binary system, where each qubit exists in a superposition of the $\ket{0}$ and $\ket{1}$ states. However, it is often possible to access the $\ket{2}$ or even $\ket{3}$ states in the same physical unit by manipulating the system in different ways. In this work, we consider automatically encoding two qubits into one four-state qu\emph{quart} via a \emph…
We present a second-order recursive Fermi-operator expansion scheme using mixed precision floating point operations to perform electronic structure calculations using tensor core units. A performance of over 100 teraFLOPs is achieved for half-precision floating point operations on Nvidia's A100 tensor core units. The second-order recursive Fermi-operator scheme is formulated in terms of a generalized, differentiable deep neural network structure, which solves the quantum mechanical electronic structure problem. We demonstrate how this network can be accelerated by optimizing the weight and bia…
This paper considers the following problem. Two mixed-state quantum circuits Q and R are given, and the goal is to determine which of two possibilities holds: (i) Q and R act nearly identically on all possible quantum state inputs, or (ii) there exists some input state that Q and R transform into almost perfectly distinguishable outputs. This problem may be viewed as an abstraction of the following problem: given two physical processes described by sequences of local interactions, are the processes effectively the same or are they different? We prove that this problem is a complete promise pro…
The notion of entanglement has been useful for characterizing universal properties of quantum phases of matter. From the perspective of quantum information theory, it is tempting to ask whether their entanglement structures possess any operational meanings, e.g., quantifying the cost of preparing an entangled system via free operations such as the local operations and classical communication (LOCC). While the answer is affirmative for pure states in that entanglement entropy coincides with entanglement cost, the case for mixed states is less understood. To this end, we study the entanglement c…
