What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? We provide an efficient algorithm to simulate any desired two-body Hamiltonian evolution using any fixed two-body entangling n-qubit Hamiltonian and local unitaries. It follows that universal quantum computation can be performed using any entangling interaction and local unitary operations.
The problem of conditions on the initial correlations between the system and the environment that lead to completely positive (CP) or not-completely positive (NCP) maps has been studied by various authors. Two lines of study may be discerned: one concerned with families of initial correlations that induce CP dynamics under the application of an arbitrary joint unitary on the system and environment; the other concerned with specific initial states that may be highly entangled. Here we study the latter problem, and highlight the interplay between the initial correlations and the unitary applied.…
Distinguishability is a fundamental and operational task generally connected to information applications. In quantum information theory, from the postulates of quantum mechanics it often has an intrinsic limitation, which then dictates and also characterises capabilities of related information tasks. In this work, we consider discrimination between bipartite two-qubit unitary transformations by local operations and classical communication (LOCC) and its relations to entangling capabilities of given unitaries. We show that a pair of entangling unitaries which do not contain local parts, if they…
We consider two capacity quantities associated with bipartite unitary gates: the entangling and the disentangling power. For two-qubit unitaries these two capacities are always the same. Here we prove that these capacities are different in general. We do so by constructing an explicit example of a qubit-qutrit unitary whose entangling power is maximal (2 ebits), but whose disentangling power is strictly less. A corollary is that there can be no unique ordering for unitary gates in terms of their ability to perform non-local tasks. Finally we show that in large dimensions, almost all bipartite …
We define the disentangling power of a unitary operator in a similar way as the entangling power defined by Zanardi, Zalka and Faoro [PRA, 62, 030301]. A general formula is derived and it is shown that both quantities are directly proportional. All results concerning the entangling power can simply be translated into similar statements for the disentangling power. In particular, the disentangling power is maximal for certain permutations derived from orthogonal latin squares. These permutations can therefore be interpreted as those that distort entanglement in a maximal way.
The notion of entangling power of unitary matrices was introduced by Zanardi, Zalka and Faoro [PRA, 62, 030301]. We study the entangling power of permutations, given in terms of a combinatorial formula. We show that the permutation matrices with zero entangling power are, up to local unitaries, the identity and the swap. We construct the permutations with the minimum nonzero entangling power for every dimension. With the use of orthogonal latin squares, we construct the permutations with the maximum entangling power for every dimension. Moreover, we show that the value obtained is maximum over…
It is known that any bipartite unitary operator of Schmidt rank three is equivalent to a controlled unitary under local unitaries. We propose a standard form of such operators. Using the form we improve the upper bound for the entanglement cost to implement such operators under local operations and classical communications (LOCC), and provide a corresponding protocol. A part of our protocol is based on a recursive-control protocol which is helpful for implementing other unitary operators. We show that any bipartite permutation unitary of Schmidt rank three can be implemented using LOCC and two…
Maximally entangled bipartite unitary operators or gates find various applications from quantum information to being building blocks of minimal models of many-body quantum chaos, and have been referred to as "dual unitaries". Dual unitary operators that can create the maximum average entanglement when acting on product states have to satisfy additional constraints. These have been called "2-unitaries" and are examples of perfect tensors that can be used to construct absolutely maximally entangled states of four parties. Hitherto, no systematic method exists, in any local dimension, which resul…
What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? Dodd et al. (quant-ph/0106064) provided a partial solution to this problem in the form of an efficient algorithm to simulate any desired two-body Hamiltonian evolution using any fixed two-body entangling N-qubit Hamiltonian, and local unitaries. We extend this result to the case where the component systems have D dimensions. As a consequence we explain how universal quantum computation can be performed with any fixed two-body entangling N-qudit Hamiltonian, and local unitaries.
This note proves that arbitrary local gates together with any entangling bipartite gate V are universal. Previously this was known only when access to both V and V^{-1} was given, or when approximate universality was demanded.
We show that entangling capacities based on the Jamiolkowski isomorphism may be used to place lower bounds on the communication capacities of arbitrary bipartite unitaries. Therefore, for these definitions, the relations which have been previously shown for two-qubit unitaries also hold for arbitrary dimensions. These results are closely related to the theory of the entanglement-assisted capacity of channels. We also present more general methods for producing ensembles for communication from initial states for entanglement creation.
We give a definition of asymmetric universal entangling machine which entangles a system in an unknown state to a specially prepared ancilla. The machine produces a fixed state-independent amount of entanglement in exchange to a fixed degradation of the system state fidelity. We describe explicitly such a machine for any quantum system having $d$ levels and prove its optimality. We show that a $d^2$-dimensional ancilla is sufficient for reaching optimality. The introduced machine is a generalization to a number of widely investigated universal quantum devices such as the symmetric and asymmetr…
What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? It has been shown that all two-body Hamiltonian evolutions can be simulated using \emph{any} fixed two-body entangling $n$-qubit Hamiltonian and fast local unitaries. By \emph{entangling} we mean that every qubit is coupled to every other qubit, if not directly, then indirectly via intermediate qubits. We extend this study to the case where interactions may involve more than two qubits at a time. We find necessary and sufficient conditions for an arbitrary $n$-qubit Hamiltonian to be \emph{dy…
Entangling an unknown qubit with one type of reference state is generally impossible. However, entangling an unknown qubit with two types of reference states is possible. To achieve this, we introduce a new class of states called zero sum amplitude (ZSA) multipartite, pure entangled states for qubits and study their salient features. Using shared-ZSA state, local operation and classical communication we give a protocol for creating multipartite entangled states of an unknown quantum state with two types of reference states at remote places. This provides a way of encoding an unknown pure qubit…
We extend the model of Ancilla Driven Quantum Computation (ADQC) by considering gates with arbitrary entangling power. By giving up stepwise determinism, universal QC can still be achieved through a variable length sequence of single qubit gates and probabilistic "repeat-until-success" entangling operations. This opens up a new range of possible physical implementations as well as shedding light on the sets of resources sufficient for universal QC.
Universal quantum entangling gates are a crucial building block in the large-scale quantum computation and quantum communication, and it is an important task to find simple ways to implement them. Here an effective quantum circuit for the implementation of a controlled-NOT (CNOT) gate is constructed by introducing a non-computational quantum state in the auxiliary space. Furthermore, the method is extended to the construction of a general n-control-qubit Toffoli gate with (2n-1) qubit-qudit gates and (2n-2) single-qudit gates. Based on the presented quantum circuits, the polarization CNOT and …
Producing and maintaining entanglement reside at the heart of the optimal construction of quan- tum operations and are fundamental issues in the realization of universal quantum computation. We here introduce a setup of spin qubits that allows for geometric implementation of entangling gates between the register qubits with any arbitrary entangling power. We show this by demon- strating a circuit through a spin chain, which performs universal nonadiabatic holonomic two-qubit entanglers. The proposed gates are all electric and geometric, which would help to realize fast and robust entangling ga…
Quantum logic gates must perform properly when operating on their standard input basis states, as well as when operating on complex superpositions of these states. Experiments using superconducting qubits have validated the truth table for particular implementations of e.g. the controlled-NOT gate [1,2], but have not fully characterized gate operation for arbitrary superpositions of input states. Here we demonstrate the use of quantum process tomography (QPT) [3,4] to fully characterize the performance of a universal entangling gate between two superconducting quantum bits. Process tomography …
Hierarchies among genuine multipartite entangling capabilities of quantum gates
Harish-Chandra Research Institute, A CI of Homi Bhabha National Institute（哈里什-钱德拉研究所，霍米·巴巴国立学院下属机构）；Gandhi Institute of Technology and Management (Deemed to be University)（甘地科技与管理学院（视为大学））
We present the first experimental demonstration of the ''optimal'' and ''universal'' quantum entangling process involving qubits encoded in the polarization of single photons. The structure of the ''quantum entangling machine'' consists of the quantum injected optical parametric amplifier by which the contextual realization of the 1->2 universal quantum cloning and of the universal NOT (U-NOT) gate has also been achieved.
Universal gate sets for quantum computing have been known for decades, yet no universal gate set has been proposed for particle-conserving unitaries, which are the operations of interest in quantum chemistry. In this work, we show that controlled single-excitation gates in the form of Givens rotations are universal for particle-conserving unitaries. Single-excitation gates describe an arbitrary $U(2)$ rotation on the two-qubit subspace spanned by the states $|01\rangle, |10\rangle$, while leaving other states unchanged -- a transformation that is analogous to a single-qubit rotation on a dual-…
We first devise a scheme to perform a universal entangling gate via controlled collisions between pairs of atomic qubits trapped with optical tweezers. Second, we present a modification to this scheme to allow the preparation of atomic Bell pairs via selective excitation, suitable for quantum information processing applications that do not require universality. Both these schemes are enabled by the inherent symmetries of identical composite particles, as originally proposed by Hayes et al. Our scheme provides a technique for producing weighted graph states, entangled resources for quantum comm…
Many well-known and well-studied four by four universal quantum logic gates in the literature are of a specific form, the so called eight-vertex form \eqref{8vertexform} \cite{kaufman etal 05-1,kaufman etal 05-2}, or {\it similar} to it. We present a formalism for universal quantum logic gates of such a form. First, we provide explicit formulas in terms of matrix entries, which are the necessary and sufficient conditions for such a matrix to be a solution to the Yang-Baxter equation \eqref{byb}. Then, combining this with the conditions needed for being unitary \eqref{unitarycond} and being ent…
Which gates are universal for quantum computation? Although it is well known that certain gates on two-level quantum systems (qubits), such as the controlled-not (CNOT), are universal when assisted by arbitrary one-qubit gates, it has only recently become clear precisely what class of two-qubit gates is universal in this sense. Here we present an elementary proof that any entangling two-qubit gate is universal for quantum computation, when assisted by one-qubit gates. A proof of this important result for systems of arbitrary finite dimension has been provided by J. L. and R. Brylinski [arXiv:q…
Motivated by experimental limitations commonly met in the design of solid state quantum computers, we study the problems of non-local Hamiltonian simulation and non-local gate synthesis when only homogeneous local unitaries are performed in order to tailor the available interaction. Homogeneous (i.e. identical for all subsystems) local manipulation implies a more refined classification of interaction Hamiltonians than the inhomogeneous case, as well as the loss of universality in Hamiltonian simulation. For the case of symmetric two-qubit interactions, we provide time-optimal protocols for bot…
When can a quantum system of finite dimension be used to simulate another quantum system of finite dimension? What restricts the capacity of one system to simulate another? In this paper we complete the program of studying what simulations can be done with entangling many-qudit Hamiltonians and local unitary control. By entangling we mean that every qudit is coupled to every other qudit, at least indirectly. We demonstrate that the only class of finite-dimensional entangling Hamiltonians that aren't universal for simulation is the class of entangling Hamiltonians on qubits whose Pauli operator…
Interaction-resolved decomposition of multi-qubit unitaries via computational-basis phases
Forschungszentrum Jülich（于利希研究中心）；Institute for Theoretical Physics, University of Cologne（科隆大学理论物理研究所）；Dipartimento di Fisica e Astronomia, Università di Bologna（博洛尼亚大学物理与天文学系）
Our goal is to provide a new approach to the construction of geometry-induced entanglement between a pair of $Λ$ type atoms in a system consists of $N$ identical atoms by means of nonadiabatic quantum holonomies. By employing the quantum Zeno effect, we introduce a tripod type interaction Hamiltonian between two selected atoms trapped in an optical cavity, which allows arbitrary geometric entangling power. This would be a substantial step toward resolving the feasibility of realizing universal nonadiabatic holonomic entangling two-qubit gates.
Characterizing quantum channels from local-unitary invariants
Institute for Quantum Inspired and Quantum Optimization, Hamburg University of Technology（汉堡工业大学量子启发与量子优化研究所）；University of Tsukuba（筑波大学）；Center for Artificial Intelligence Research (C-AIR), University of Tsukuba（筑波大学人工智能研究中心）
The quantum baker map possesses two symmetries: a canonical "spatial" symmetry, and a time-reversal symmetry. We show that, even when these features are taken into account, the asymptotic entangling power of the baker's map does not always agree with the predictions of random matrix theory. We have verified that the dimension of the Hilbert space is the crucial parameter which determines whether the entangling properties of the baker are universal or not. For power-of-two dimensions, i.e., qubit systems, an anomalous entangling power is observed; otherwise the behavior of the baker is consiste…
Recently de La Torre et al. [1] reconstructed Quantum Theory from its local structure on the basis of local discriminability and the existence of a one-parameter group of bipartite transformations containing an entangling gate. This result relies on universality of an entangling gate for quantum computation. Here we prove universality of C-NOT with local gates for Real Quantum Theory (RQT), showing that such universality would not be sufficient for the result, whereas local discriminability and the qubit structure play a crucial role. For reversible computation, generally an extra rebit is nee…
The realization of robust universal quantum computation with any platform ultimately requires both the coherent storage of quantum information and (at least) one entangling operation between individual elements. The use of continuous-variable bosonic modes as the quantum element is a promising route to preserve the coherence of quantum information against naturally-occurring errors. However, operations between bosonic modes can be challenging. In analogy to the exchange interaction between discrete-variable spin systems, the exponential-SWAP unitary [$\mathbf{U}_{\mathrm{E}}\left(θ_c\right)$] …
The decomposition of large unitary matrices into smaller ones is important, because it provides ways to realization of classical and quantum information processing schemes. Today, most of the methods use planar meshes of tunable two-channel blocks, however, the schemes turn out to be sensitive to fabrication errors. We study a novel decomposition method based on multi-channel blocks. We have shown that the scheme is universal even when the block`s transfer matrices are chosen at random, making it virtually insensitive to errors. Moreover, the placement of the variable elements can be arbitrary…
We provide an analytic way to implement any arbitrary two-qubit unitary operation, given an entangling two-qubit gate together with local gates. This is shown to provide explicit construction of a universal quantum circuit that exactly simulates arbitrary two-qubit operations in SU(4). Each block in this circuit is given in a closed form solution. We also provide a uniform upper bound of the applications of the given entangling gates, and find that exactly half of all the Controlled-Unitary gates satisfy the same upper bound as the CNOT gate. These results allow for the efficient implementatio…
The three-spin-$1/2$ decoherence-free subsystem defines a logical qubit protected from collective noise and supports exchange-only universal gates. Such logical qubits are well-suited for implementation with electrically-defined quantum dots. Exact exchange-only entangling logical gates exist but are challenging to construct and understand. We use a decoupling strategy to obtain straightforward approximate entangling gates. A benefit of the strategy is that if the physical spins are aligned, then it can implement evolution under entangling Hamiltonians. Hamiltonians expressible as linear combi…
The circuit model of a quantum computer consists of sequences of gate operations between quantum bits (qubits), drawn from a universal family of discrete operations. The ability to execute parallel entangling quantum gates offers clear efficiency gains in numerous quantum circuits as well as for entire algorithms such as Shor's factoring algorithm and quantum simulations. In cases such as full adders and multiple-control Toffoli gates, parallelism can provide an exponential improvement in overall execution time. More importantly, quantum gate parallelism is essential for the practical fault-to…
We investigate an approach to universal quantum computation based on the modulation of longitudinal qubit-oscillator coupling. We show how to realize a controlled-phase gate by simultaneously modulating the longitudinal coupling of two qubits to a common oscillator mode. In contrast to the more familiar transversal qubit-oscillator coupling, the magnitude of the effective qubit-qubit interaction does not rely on a small perturbative parameter. As a result, this effective interaction strength can be made large, leading to short gate times and high gate fidelities. We moreover show how the gate …
We describe how any two-party quantum computation, specified by a unitary which simultaneously acts on the registers of both parties, can be privately implemented against a quantum version of classical semi-honest adversaries that we call specious. Our construction requires two ideal functionalities to garantee privacy: a private SWAP between registers held by the two parties and a classical private AND-box equivalent to oblivious transfer. If the unitary to be evaluated is in the Clifford group then only one call to SWAP is required for privacy. On the other hand, any unitary not in the Cliff…
Quantum compiling, where a parameterized quantum circuit is trained to learn a target unitary, is an important primitive for quantum computing that can be used as a subroutine to obtain optimal circuits or as a tomographic tool to study the dynamics of an experimental system. While much attention has been paid to quantum compiling on discrete variable hardware, less has been paid to compiling in the continuous variable paradigm. Here we motivate several, closely related, short depth continuous variable algorithms for quantum compilation. We analyse the trainability of our proposed cost functio…
We present an approach to one-way quantum computation (1WQC) that can compensate for single-qubit errors, by encoding the logical information residing on physical qubits into five-qubit error-correcting code states. A logical two-qubit cluster state that is the fundamental resource for encoded quantum teleportation is then described by a graph state containing ten vertices with constant degree seven. Universal 1WQC that incorporates error correction requires only multiple copies of this logical two-qubit state and a logical four-qubit linear cluster state, which are prepared only just in advan…
The model of open quantum systems is adopted to describe the non-local dynamical behaviour of qubits processed by entangling gates. The analysis gets to the conclusion that a distinction between evaluation steps and task-oriented computing steps is justified only within classical computation. In fact, the use of entangling gates permits to reduce two steps (evaluation and calculation) to a single computational one, and this determines an effective computational speed-up. The application of the open quantum systems model suggests that the reduction to one-computational step is strongly related …
Performing entangling gates between physical qubits is necessary for building a large-scale universal quantum computer, but in some physical implementations - for example, those that are based on linear optics or networks of ion traps - entangling gates can only be implemented probabilistically. In this work, we study the fault-tolerant performance of a topological cluster state scheme with local non-deterministic entanglement generation, where failed entangling gates (which correspond to bonds on the lattice representation of the cluster state) lead to a defective three-dimensional lattice wi…
The required set of operations for universal continuous-variable quantum computation can be divided into two primary categories: Gaussian and non-Gaussian operations. Furthermore, any Gaussian operation can be decomposed as a sequence of phase-space displacements and symplectic transformations. Although Gaussian operations are ubiquitous in quantum optics, their experimental realizations generally are approximations of the ideal Gaussian unitaries. In this work, we study different performance criteria to analyze how well these experimental approximations simulate the ideal Gaussian unitaries. …
