Optimal simulation of two-qubit Hamiltonians using general local operations
C. H. Bennett, J. I. Cirac, M. S. Leifer, D. W. Leung, N. Linden, S. Popescu, G. Vidal
备注：
(1) References to related work, (2) protocol to simulate one two-qudit Hamiltonian with another, and (3) other related results added. Some proofs are simplified
We consider the simulation of the dynamics of one nonlocal Hamiltonian by another, allowing arbitrary local resources but no entanglement nor classical communication. We characterize notions of simulation, and proceed to focus on deterministic simulation involving one copy of the system. More specifically, two otherwise isolated systems $A$ and $B$ interact by a nonlocal Hamiltonian $H \neq H_A+H_B$. We consider the achievable space of Hamiltonians $H'$ such that the evolution $e^{-iH't}$ can be simulated by the interaction $H$ interspersed with local operations. For any dimensions of $A$ and $B$, and any nonlocal Hamiltonians $H$ and $H'$, there exists a scale factor $s$ such that for all times $t$ the evolution $e^{-iH'st}$ can be simulated by $H$ acting for time $t$ interspersed with local operations. For 2-qubit Hamiltonians $H$ and $H'$, we calculate the optimal $s$ and give protocols achieving it. The optimal protocols do not require local ancillas, and can be understood geometrically in terms of a polyhedron defined by a partial order on the set of 2-qubit Hamiltonians.
Suppose we can apply a given 2-qubit Hamiltonian H to any (ordered) pair of qubits. We say H is n-universal if it can be used to approximate any unitary operation on n qubits. While it is well known that almost any 2-qubit Hamiltonian is 2-universal (Deutsch, Barenco, Ekert 1995; Lloyd 1995), an explicit characterization of the set of non-universal 2-qubit Hamiltonians has been elusive. Our main result is a complete characterization of 2-non-universal 2-qubit Hamiltonians. In particular, there are three ways that a 2-qubit Hamiltonian H can fail to be universal: (1) H shares an eigenvector wit…
Quantum state on Bloch sphere for superconducting charge qubit, phase qubit and flux qubit for all time in absence of external drive is stable to initial state. By driving the qubits, approximation of charge and flux Hamiltonian lead to quantum state rotation in Bloch sphere around an axis completely differ from rotation vector of exact Hamiltonian. The trajectory of quantum state for phase qubit for approximated and exact Hamiltonian is the same but the expectation of quantum observable has considerable errors as two other qubits. microwave drive control is designed for approximated Hamiltoni…
We examine the problem of determining if a 2-local Hamiltonian is stoquastic by local basis changes. We analyze this problem for two-qubit Hamiltonians, presenting some basic tools and giving a concrete example where using unitaries beyond Clifford rotations is required in order to decide stoquasticity. We report on simple results for $n$-qubit Hamiltonians with identical 2-local terms on bipartite graphs. Our most significant result is that we give an efficient algorithm to determine whether an arbitrary $n$-qubit XYZ Heisenberg Hamiltonian is stoquastic by local basis changes.
An open question in designing superconducting quantum circuits is how best to reduce the full circuit Hamiltonian which describes their dynamics to an effective two-level qubit Hamiltonian which is appropriate for manipulation of quantum information. Despite advances in numerical methods to simulate the spectral properties of multi-element superconducting circuits, the literature lacks a consistent and effective method of determining the effective qubit Hamiltonian. Here we address this problem by introducing a novel local basis reduction method. This method does not require any ad hoc assumpt…
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…
We examine the problem of determining whether a multi-qubit two-local Hamiltonian can be made stoquastic by single-qubit unitary transformations. We prove that when such a Hamiltonian contains one-local terms, then this task can be NP-hard. This is shown by constructing a class of Hamiltonians for which performing this task is equivalent to deciding $3$-SAT. In contrast, we show that when such a Hamiltonian contains no one-local terms then this task is easy, namely we present an algorithm which decides, in a number of arithmetic operations over $\mathbb{R}$ which is polynomial in the number of…
We show that, for even n, evolving n qubits according to a simple Hamiltonian can be used to exactly implement an (n+1)-qubit parity gate, which is equivalent in constant depth to an (n+1)-qubit fanout gate. We also observe that evolving the Hamiltonian for three qubits results in an inversion-on-three-way-equality gate, which together with single-qubit operations is universal for quantum computation.
We investigate the inverse problem concerning the evolution of a qubit system, specifically we consider how one can establish the Hamiltonians that account for the evolution of a qubit along a prescribed path in the projected Hilbert space. For a given path, there are infinite Hamiltonians which can realize the same evolution. A general form of the Hamiltonians is constructed in which one may select the desired one for implementing a prescribed evolution. This scheme can be generalized to higher dimensional systems.
We consider a qubit subject to various independent control mechanisms and present a general strategy to identify both the internal Hamiltonian and the interaction Hamiltonian for each control mechanism, relying only on a single, fixed readout process such as $σ_z$ measurements.
We develop qubit Hamiltonian single parameter estimation techniques using a Bayesian approach. The algorithms considered are restricted to projective measurements in a fixed basis, and are derived under the assumption that the qubit measurement is much slower than the characteristic qubit evolution. We optimize a non-adaptive algorithm using particle swarm optimization (PSO) and compare with a previously-developed locally-optimal scheme.
What is the time-optimal way of using a set of control Hamiltonians to obtain a desired interaction? Vidal, Hammerer and Cirac [Phys. Rev. Lett. 88 (2002) 237902] have obtained a set of powerful results characterizing the time-optimal simulation of a two-qubit quantum gate using a fixed interaction Hamiltonian and fast local control over the individual qubits. How practically useful are these results? We prove that there are two-qubit Hamiltonians such that time-optimal simulation requires infinitely many steps of evolution, each infinitesimally small, and thus is physically impractical. A pro…
The construction of two-qubit gates appropriate for universal quantum computation is of enormous importance to quantum information processing. Building such gates is dependent on accurate knowledge of the interaction dynamics between two qubit systems. This letter will present a systematic method for reconstructing the full two-qubit interaction Hamiltonian through experimental measures of concurrence. This not only gives a convenient method for constructing two qubit quantum gates, but can also be used to experimentally determine various Hamiltonian parameters in physical systems. We show exp…
We present an empirical strategy to determine the Hamiltonian dynamics of a two-qubit system using only initialization and measurement in a single fixed basis. Signal parameters are estimated from measurement data using Bayesian methods from which the underlying Hamiltonian is reconstructed, up to three unobservable phase factors. We extend the method to achieve full control Hamiltonian tomography for controllable systems via a multi-step approach. The technique is demonstrated and evaluated by analyzing data from simulated experiments including projection noise.
In this paper, we show that the ability to switch globally between two 2-local Hamiltonians on n qubits is sufficient for achieving universal unitary dynamics on those n qubits. Of the two Hamiltonians used in the construction, one is comprised of nearest-neighbour two-qubit interactions on a one-dimensional chain, the other is comprised of single-qubit interactions. We describe a scheme for choosing the switching times in order to generate arbitrary one- and two-qubit gates on the n qubits. However the switching scheme is inefficient, and we leave as an open problem the question of whether th…
We provide a novel approach for characterization of quantum Hamiltonian systems via utilizing a single measurement device. Specifically, we demonstrate how external quantum correlations can be used for Hamiltonian identification tasks. We explicitly introduce experimental procedures for direct estimation of single- and two-qubit Hamiltonian parameters, and also for simultaneous estimation of transverse and longitudinal relaxation rates, using a single Bell-state analyzer. An advantage of our method over the earlier approaches is that it has a built-in feature which makes it suitable for partia…
Quantum gates (unitary gates) on physical systems are usually implemented by controlling the Hamiltonian dynamics. When full descriptions of the Hamiltonians parameters is available, the set of implementable quantum gates is easily characterised by quantum control theory. In many real systems, however, the Hamiltonians may include unknown parameters due to the difficulty of precise measurements or instability of the system. In this paper, we consider the situation that some parameters of the Hamiltonian are unknown, but we still want to perform a robust control of a quantum gate irrespectively…
The ability to simulate one Hamiltonian with another is an important primitive in quantum information processing. In this paper, a simulation method for arbitrary $σ_z \otimes σ_z$ interaction based on Hadamard matrices (quant-ph/9904100) is generalized for any pairwise interaction. We describe two applications of the generalized framework. First, we obtain a class of protocols for selecting an arbitrary interaction term in an n-qubit Hamiltonian. This class includes the scheme given in quant-ph/0106064v2. Second, we obtain a class of protocols for inverting an arbitrary, possibly unknown n-qu…
The problem of finding the ground state of a frustration-free Hamiltonian carrying only two-body interactions between qubits is known to be solvable in polynomial time. It is also shown recently that, for any such Hamiltonian, there is always a ground state that is a product of single- or two-qubit states. However, it remains unclear whether the whole ground space is of any succinct structure. Here, we give a complete characterization of the ground space of any two-body frustration-free Hamiltonian of qubits. Namely, it is a span of tree tensor network states of the same tree structure. This c…
Learning Hamiltonian of a quantum system is indispensable for prediction of the system dynamics and realization of high fidelity quantum gates. However, it is a significant challenge to efficiently characterize the Hamiltonian when its Hilbert space dimension grows exponentially with the system size. Here, we experimentally demonstrate an adaptive method to learn the effective Hamiltonian of an 11-qubit quantum system consisting of one electron spin and ten nuclear spins associated with a single Nitrogen-Vacancy center in a diamond. We validate the estimated Hamiltonian by designing universal …
We show that it is possible to initialize and manipulate in a deterministic manner protected qubits using time varying Hamiltonians. Taking advantage of the symmetries of the system, we predict the effect of the noise during the initialization and manipulation. These predictions are in good agreement with numerical simulations. Our study shows that the topological protection remains efficient under realistic experimental conditions.
Qubitization is a modern approach to estimate Hamiltonian eigenvalues without simulating its time evolution. While in this way approximation errors are avoided, its resource and gate requirements are more extensive: qubitization requires additional qubits to store information about the Hamiltonian, and Toffoli gates to probe them throughout the routine. Recently, it was shown that storing the Hamiltonian in a unary representation can alleviate the need for such gates in one of the qubitization subroutines. Building on that principle, we develop an entirely new decomposition of the entire algor…
We show that intrinsic fluctuations in system control parameters impose limits on the ability of two-qubit (exchange) Hamiltonians to generate entanglement starting from mixed initial states. We find three classes for Gaussian and Laplacian fluctuations. For the Ising and XYZ models there are qualitatively distinct sharp entanglement-generation transitions, while the class of Heisenberg, XY, and XXZ Hamiltonians is capable of generating entanglement for any finite noise level. Our findings imply that exchange Hamiltonians are surprisingly robust in their ability to generate entanglement in the…
A simple protocol based on low-weight Pauli Hamiltonians is introduced for performing quantum gates that are robust to control noise. Gates are implemented by an adiabatic sequence of single-qubit fields and two-qubit interactions with a single ancillary qubit, whereas related techniques require three-qubit interactions, perturbation gadgets, higher dimensional subsystems, and/or more ancilla qubits. Low-weight interactions and low qubit overhead open a viable path to experimental investigation, while operation in a degenerate ground space allows for physical qubit designs that are immune to e…
This work proposes numerical tests which determine whether a two-qubit operator has an atypically simple quantum circuit. Specifically, we describe formulae, written in terms of matrix coefficients, characterizing operators implementable with exactly zero, one, or two controlled-not (CNOT) gates and all other gates being one-qubit. We give an algorithm for synthesizing two-qubit circuits with optimal number of CNOT gates, and illustrate it on operators appearing in quantum algorithms by Deutsch-Josza, Shor and Grover. In another application, our explicit numerical tests allow timing a given Ha…
It is natural to measure the observables from the Hamiltonian-based quantum dynamics, and its inverse process that Hamiltonians are estimated from the measured data also is a vital topic. In this work, we propose a recurrent neural network to learn the parameters of the target Hamiltonians from the temporal records of single-qubit measurements. The method does not require the assumption of ground states and only measures single-qubit observables. It is applicable on both time-independent and time-dependent Hamiltonians and can simultaneously capture the magnitude and sign of Hamiltonian parame…
We will construct a simple four qubits Hamiltonian of the Rs. molischianum purple bacteria light harvesting complex II (LH-II) ring which yields energy levels that carry the ring's oscillator strength. In an excitonic representation, these levels are associated with the second and the third lowest electronic excitations of the ring. We will assume that qubits form a closed loop lattice and the interaction between qubits is only due to the exchange effect. As we will show, eigenstates are constructed in a such way that as we subsequently divide qubits of the Rs. molischianum LH-II ring into the…
We show that the general Heisenberg Hamiltonian with non-uniform couplings can be characterised by mapping the entanglement it generates as a function of time. Identification of the Hamiltonian in this way is possible as the coefficients of each operator control the oscillation frequencies of the entanglement function. The number of measurements required to achieve a given precision in the Hamiltonian parameters is determined and an efficient measurement strategy designed. We derive the relationship between the number of measurements, the resulting precision and the ultimate discrete error pro…
Universal quantum computing relies on high-fidelity entangling operations. Here we demonstrate that four coupled qubits can operate as a quantum gate, where two qubits control the operation on two target qubits (a four-qubit gate). This configuration can implement four different controlled two-qubit gates: two different entangling swap and phase operations, a phase operation distinguishing states of different parity, and the identity operation (idle quantum gate), where the choice of gate is set by the state of the control qubits. The device exploits quantum interference to control the operati…
We discuss encodings of fermionic many-body systems by qubits in the presence of symmetries. Such encodings eliminate redundant degrees of freedom in a way that preserves a simple structure of the system Hamiltonian enabling quantum simulations with fewer qubits. First we consider $U(1)$ symmetry describing the particle number conservation. Using a previously known encoding based on the first quantization method a system of $M$ fermi modes with $N$ particles can be simulated on a quantum computer with $Q=N\log{(M)}$ qubits. We propose a new version of this encoding tailored to variational quan…
The structure of all completely positive quantum operations is investigated which transform pure two-qubit input states of a given degree of entanglement in a covariant way. Special cases thereof are quantum NOT operations which transform entangled pure two-qubit input states of a given degree of entanglement into orthogonal states in an optimal way. Based on our general analysis all covariant optimal two-qubit quantum NOT operations are determined. In particular, it is demonstrated that only in the case of maximally entangled input states these quantum NOT operations can be performed perfectl…
We consider the computational complexity of Hamiltonians which are sums of commuting terms acting on plaquettes in a square lattice of qubits, and we show that deciding whether the ground state minimizes the energy of each local term individually is in the complexity class NP. That is, if the ground states has this property, this can be proven using a classical certificate which can be efficiently verified on a classical computer. Different to previous results on commuting Hamiltonians, our certificate proves the existence of such a state without giving instructions on how to prepare it.
Superconducting quantum circuit is a promising system for building quantum computer. With this system we demonstrate the universal quantum computations, including the preparing of initial states, the single-qubit operations, the two-qubit universal gate operations between arbitrary qubits, the multiple pairs of two-qubit gate operations in parallel, the coupling operations on a group of qubits in parallel, the coupling operations on multiple groups of qubits in parallel, the coupling operations on multiple pairs and multiple groups of qubits in parallel. Within available technology, a universa…
We show how to perform universal Hamiltonian and adiabatic computing using a time-independent Hamiltonian on a 2D grid describing a system of hopping particles which string together and interact to perform the computation. In this construction, the movement of one particle is controlled by the presence or absence of other particles, an effective quantum field effect transistor that allows the construction of controlled-NOT and controlled-rotation gates. The construction translates into a model for universal quantum computation with time-independent 2-qubit ZZ and XX+YY interactions on an (almo…
We present a Hamiltonian quantum computation scheme universal for quantum computation (BQP). Our Hamiltonian is a sum of a polynomial number (in the number of gates L in the quantum circuit) of time-independent, constant-norm, 2-local qubit-qubit interaction terms. Furthermore, each qubit in the system interacts only with a constant number of other qubits. The computer runs in three steps - starts in a simple initial product-state, evolves it for time of order L^2 (up to logarithmic factors) and wraps up with a two-qubit measurement. Our model differs from the previous universal 2-local Hamilt…
A six-qubit quantum network consisting of conditional unitary gates is presented which is capable of implementing a large class of covariant two-qubit quantum operations. Optimal covariant NOT operations for one and two-qubit systems are special cases contained in this class. The design of this quantum network exploits basic algebraic properties which also shed new light onto these covariant quantum processes.
We provide a systematic analysis of the physical generation of single- and two-qubit quantum operations from Hamiltonians available in various quantum systems for scalable quantum information processing. We show that generation of one-qubit operations can be transformed into a steering problem on the Bloch sphere, whereas the two-qubit problem can be generally transformed into a steering problem in a tetrahedron representing all the local equivalence classes of two-qubit operations (the Weyl chamber). We use this approach to investigate several physical examples for the generation of two-qubit…
Large-scale universal quantum computing requires the implementation of quantum error correction (QEC). While the implementation of QEC has already been demonstrated for quantum memories, reliable quantum computing requires also the application of nontrivial logical gate operations to the encoded qubits. Here, we present examples of such operations by implementing, in addition to the identity operation, the NOT and the Hadamard gate to a logical qubit encoded in a five qubit system that allows correction of arbitrary single qubit errors. We perform quantum process tomography of the encoded gate…
We obtain the analytical expression for the Kraus decomposition of the quantum map of an environment modeled by an arbitrary quadratic fermionic Hamiltonian acting on one or two qubits, and derive simple functions to check the non-positivity of the intermediate map. These functions correspond to two different sufficient criteria for non-Markovianity. In the particular case of an environment represented by the Ising Hamiltonian, we discuss the two sources of non-Markovianity in the model, one due to the finite size of the lattice, and another due to the kind of interactions.
Universal quantum computation requires the implementation of arbitrary control operations on the quantum register. In most cases, this is achieved by external control fields acting selectively on each qubit to drive single-qubit operations. In combination with a drift Hamiltonian containing interactions between the qubits, this allows the implementation of any required gate operation. Here, we demonstrate an alternative scheme that does not require local control for all qubits: we implement one- and two-qubit gate operations on a set of target qubits indirectly, through a combination of gates …
We establish a novel procedure to analyze the entanglement properties of extremal density matrices depending on the parameters of a finite dimensional Hamiltonian. It was applied to a general 2-qubit Hamiltonian which could exhibit Kramers degeneracy. This is done through the extremal density matrix formalism, which allows to extend the conventional variational principle to mixed states. By applying the positive partial transpose criterion in terms of the Correlation and Schlienz-Mahler matrices on the extremal density matrices, we demonstrate that it is possible to reach both pure and mixed e…
A scheme of universal quantum computation on a chain of qubits is described that does not require local control. All the required operations, an Ising-type interaction and spatially uniform simultaneous one-qubit gates, are translation-invariant.
We consider the problem of selectively controlling couplings in a practical quantum processor with always-on interactions that are diagonal in the computational basis, using sequences of local NOT gates. This methodology is well-known in NMR implementations, but previous approaches do not scale efficiently for the general fully-connected Hamiltonian, where the complexity of finding time-optimal solutions makes them only practical up to a few tens of qubits. Given the rapid growth in the number of qubits in cutting-edge quantum processors, it is of interest to investigate the applicability of t…
The generation of Greenberger-Horne-Zeilinger (GHZ) states is a crucial problem in quantum information. We derive general conditions for obtaining GHZ states as eigenstates of a Hamiltonian. In general, degeneracy cannot be avoided if the Hamiltonian contains m-body interaction terms with m<=2 and a number of qubits strictly larger than 4. As an application, we explicitly construct a two-body 4-qubit Hamiltonian and a three-body 5-qubit Hamiltonian that exhibit a GHZ as a nondegenerate eigenstate.
We show that the entanglement of a $2\times 2$ bipartite state can be improved and maximized probabilistically through single-qubit operations only. An experiment is proposed and it is numerically simulated.
Since simulating quantum computers requires exponentially more classical resources, efficient algorithms are extremely helpful. We analyze algorithms that create single qubit and specific controlled qubit matrix representations of gates. Additionally, we use the simulator to investigate errors based on different probability distributions and to investigate the robustness of different 2-qubit multiplier circuits in the presence of operational errors.
Estimation of a sparse multi-qubit Hamiltonian via compressed sensing
State Key Laboratory of Mathematical Sciences, Academy of Mathematics and Systems Science, Chinese Academy of Sciences（中国科学院数学与系统科学研究院）；School of Mathematical Sciences, University of Chinese Academy of Sciences（中国科学院大学数学科学学院）；College of Electronic and Information Engineering, Tongji University（同济大学电子与信息工程学院）；Shanghai Research Institute for Intelligent Autonomous Systems, Tongji University（同济大学上海智能无人驾驶系统研究院）；Institute for Advanced Study, Tongji University（同济大学高等研究院）；Department of Electrical and Electronic Engineering, University of Melbourne（墨尔本大学电气与电子工程系）；Laboratory of Quantum Information, University of Science and Technology of China（中国科学技术大学量子信息实验室）；CAS Center For Excellence in Quantum Information and Quantum Physics, University of Science and Technology of China（中国科学技术大学中科院量子信息与量子物理卓越创新中心）；Hefei National Laboratory（合肥国家实验室）
Characterizing the interactions and dynamics of quantum mechanical systems is an essential task in the development of quantum technologies. We propose an efficient protocol based on the estimation of the time derivatives of few qubit observables using polynomial interpolation for characterizing the underlying Hamiltonian dynamics and Markovian noise of a multi-qubit device. For finite range dynamics, our protocol exponentially relaxes the necessary time resolution of the measurements and quadratically reduces the overall sample complexity compared to previous approaches. Furthermore, we show t…
L. Lamata et al. have presented an entanglement classification of four qubits under stochastic local operation and classical communication (SLOCC) based on inductive approach [Phys. Rev. A \textbf{75}, 022318 (2007)]. While it works well for three qubits, we show that some of the families for four qubits have overlaps and hence this approach is not valid for entanglement classification of four or more qubits under SLOCC.
We present a fast quantum entangling operation on superconducting qubits assisted by a resonator in the quasi-dispersive regime with a new effect --- the selective resonance coming from the amplified qubit-state-dependent resonator transition frequency and the tunable period relation between a wanted quantum Rabi oscillation and an unwanted one. This operation does not require any kind of drive fields and the interaction between qubits. More interesting, the non-computational third excitation states of the charge qubits can play an important role in shortening largely the operation time of the…
Optimal construction of quantum operations is a fundamental problem in the realization of quantum computation. We here introduce a newly discovered quantum gate, B, that can implement any arbitrary two-qubit quantum operation with minimal number of both two- and single-qubit gates. We show this by giving an analytic circuit that implements a generic nonlocal two-qubit operation from just two applications of the B gate. We also demonstrate that for the highly scalable Josephson junction charge qubits, the B gate is also more easily and quickly generated than the CNOT gate for physically feasibl…
In contrast to classical systems, actual implementation of non-Hermitian Hamiltonian dynamics for quantum systems is a challenge because the processes of energy gain and dissipation are based on the underlying Hermitian system-environment dynamics that is trace preserving. Recently, a scheme for engineering non-Hermitian Hamiltonians as a result of repetitive measurements on an anicillary qubit has been proposed. The induced conditional dynamics of the main system is described by the effective non-Hermitian Hamiltonian arisng from the procedure. In this paper we demonstrate the effectiveness o…
We obtain the most general ensemble of qubits, for which it is possible to design a universal Hadamard gate. These states when geometrically represented on the Bloch sphere, give a new trajectory. We further consider some Hadamard `type' of operations and find ensembles of states for which such transformations hold. Unequal superposition of a qubit and its orthogonal complement is also investigated.
Bipartite operations underpin both classical communication and entanglement generation. Using a superposition of classical messages, we show that the capacity of a two-qubit operation for error-free entanglement-assisted bidirectional classical communication can not exceed twice the entanglement capability. In addition we show that any bipartite two-qubit operation can increase the communication that may be performed using an ensemble by twice the entanglement capability.
