Many promising ideas for quantum computing demand the experimental ability to directly switch 'on' and 'off' a physical coupling between the component qubits. This is typically the key difficulty in implementation, and precludes quantum computation in generic solid state systems, where interactions between the constituents are 'always on'. Here we show that quantum computation is possible in strongly coupled (Heisenberg) systems even when the interaction cannot be controlled. The modest ability of 'tuning' the transition energies of individual qubits proves to be sufficient, with a suitable encoding of the logical qubits, to generate universal quantum gates. Furthermore, by tuning the qubits collectively we provide a scheme with exceptional experimental simplicity: computations are controlled via a single 'switch' of only six settings. Our schemes are applicable to a wide range of physical implementations, from excitons and spins in quantum dots through to bulk magnets.
The working principles of linear optical quantum computing are based on photodetection, namely, projective measurements. The use of photodetection can provide efficient nonlinear interactions between photons at the single-photon level, which is technically problematic otherwise. We report an application of such a technique to prepare quantum correlations as an important resource for Heisenberg-limited optical interferometry, where the sensitivity of phase measurements can be improved beyond the usual shot-noise limit. Furthermore, using such nonlinearities, optical quantum nondemolition measur…
Quantum computing in terms of geometric phases, i.e. Berry or Aharonov-Anandan phases, is fault-tolerant to a certain degree. We examine its implementation based on Zeeman coupling with a rotating field and isotropic Heisenberg interaction, which describe NMR and can also be realized in quantum dots and cold atoms. Using a novel physical representation of the qubit basis states, we construct $π/8$ and Hadamard gates based on Berry and Aharonov-Anandan phases. For two interacting qubits in a rotating field, we find that it is always impossible to construct a two-qubit gate based on Berry phases…
We study quantum teleportation via a two-qubit Heisenberg XXZ chain under an inhomogeneous magnetic field. We first consider entanglement teleportation, and then focus on the teleportation fidelity under different conditions. The effects of anisotropy and the magnetic field, both uniform and inhomogeneous, are discussed. We also find that, though entanglement teleportation does require an entangled quantum channel, a nonzero critical value of minimum entanglement is not always necessary.
We ask which is the best strategy to reveal uncertainty relations between comple- mentary observables of a continuous variable system for coarse-grained measurements. This leads to the derivation of new uncertainty relations for coarse-grained measurements that are always valid, even for detectors with low precision. These relations should be particularly relevant in experimental demonstrations of squeezing in quantum optics, quantum state reconstruction, and the development of trustworthy entanglement criteria.
Entanglement, including ``quantum entanglement,'' is a consequence of correlation between objects. When the objects are subunits of pairs which in turn are members of an ensemble described by a wave function, a correlation among the subunits induces the mysterious properties of ``cat-states.'' However, correlation between subsystems can be present from purely non-quantum sources, thereby entailing no unfathomable behavior. Such entanglement arises whenever the so-called ``qubit space'' is not afflicted with Heisenberg Uncertainty. It turns out that all optical experimental realizations of EPR'…
We show that the quantum Fisher information attained in an adiabatic approach to critical quantum metrology cannot lead to the Heisenberg limit of precision and therefore regular quantum metrology under optimal settings is always superior. Furthermore, we argue that even though shortcuts to adiabaticity can arbitrarily decrease the time of preparing critical ground states, they cannot be used to achieve or overcome the Heisenberg limit for quantum parameter estimation in adiabatic critical quantum metrology. As case studies, we explore the application of counter-diabatic driving to the Landau-…
Blind quantum computing enables a client, who does not have enough quantum technologies, to delegate her quantum computing to a remote quantum server in such a way that her privacy is protected against the server. Some blind quantum computing protocols can be made verifiable, which means that the client can check the correctness of server's quantum computing. Can any blind protocol always be made verifiable? In this paper, we answer to the open problem affirmatively. We propose a plug-in that makes any universal blind quantum computing protocol automatically verifiable. The idea is that the cl…
We give a polynomial-time algorithm for computing upper bounds on some of the smaller energy eigenvalues in a spin-1/2 ferromagnetic Heisenberg model with any graph $G$ for the underlying interactions. An important ingredient is the connection between Heisenberg models and the symmetric products of $G$. Our algorithms for computing upper bounds are based on generalized diameters of graphs. Computing the upper bounds amounts to solving the minimum assignment problem on $G$, which has well-known polynomial-time algorithms from the field of combinatorial optimization. We also study the possibilit…
Universal quantum computation requiring only the Heisenberg exchange interaction and suppressing decoherence via an energy gap is presented. The combination of an always-on exchange interaction between the three physical qubits comprising the encoded qubit and a global magnetic field generates an energy gap between the subspace of interest and all other states. This energy gap suppresses decoherence. Always-on exchange couplings greatly simplify hardware specifications and the implementation of inter-logical-qubit gates. A controlled phase gate can be implemented using only three Heisenberg ex…
We study the optimal teleportation based on Bell measurements via the thermal states of a two-qubit Heisenberg XXX chain in the presence of Dzyaloshinsky-Moriya (DM) anisotropic antisymmetric interaction and obtain the optimal unitary transformation. The explicit expressions of the output state and the teleportation fidelity are presented and compared with those of the standard protocol. It is shown that in this protocol the teleportation fidelity is always larger and unit fidelity is achieved at zero temperature. The DM interaction can enhance the teleportation fidelity at finite temperatures…
An efficient and intuitive framework for universal quantum computation is presented that uses pairs of spin-1/2 particles to form logical qubits and a single physical interaction, Heisenberg exchange, to produce all gate operations. Only two Heisenberg gate operations are required to produce a controlled pi-phase shift, compared to 19 for exchange-only proposals employing three spins. Evolved from well-studied decoherence-free subspaces, this architecture inherits immunity from collective decoherence mechanisms. The simplicity and adaptability of this approach should make it attractive for spi…
The quantum Fisher information matrix provides us with a tool to determine the precision, in any multiparametric estimation protocol, through quantum Cramér-Rao bound. In this work, we study simultaneous and individual estimation strategies using the density matrix vectorization method. Two special Heisenberg $XY$ models are considered. The first one concerns the anisotropic $XY$ model in which the temperature $T$ and the anisotropic parameter $γ$ are estimated. The second situation concerns the isotropic $XY$ model submitted to an external magnetic field $B$ in which the temperature and the m…
We show that efficient quantum computation is possible using a disordered Heisenberg spin-chain with `always-on' couplings. Such disorder occurs naturally in nanofabricated systems. Considering a simple chain setup, we show that an arbitrary two-qubit gate can be implemented using just three relaxations of a controlled qubit, which amounts to switching the on-site energy terms at most twenty-one times.
We suggest using the method of quantum annealing for computing the ground state of the Heisenberg spin chains. Our initial Hamiltonian describes a spin system in a highly non-uniform magnetic field. The initial Hamiltonian gradually transforms into the Heisenberg Hamiltonian, which describes the exchange interaction and the Zeeman interaction with the uniform magnetic field. We demonstrate quantum annealing for 2-, 3-, and 9-spin systems. In particular, we consider the alternate (ferro- and antiferromagnetic) exchange integral. By changing the sign of the exchange integrals we switch from the …
It has recently been shown that one can perform quantum computation in a Heisenberg chain in which the interactions are 'always on', provided that one can abruptly tune the Zeeman energies of the individual (pseudo-)spins. Here we provide a more complete analysis of this scheme, including several generalizations. We generalize the interaction to an anisotropic form (incorporating the XY, or Forster, interaction as a limit), providing a proof that a chain coupled in this fashion tends to an effective Ising chain in the limit of far off-resonant spins. We derive the primitive two-qubit gate that…
We investigate the non-nearest-neighbor interaction effect in 1-D spin-1/2 chain model. In many previous schemes this long-range coupling is omitted because of its relative weak strength compared with the nearest-neighbor coupling. We show that the quantum gate deviation induced by the omitted long-range interaction depends on not only its strength but also the scale of the system. This implies that omitting the long-range interaction may challenge the scalability of previous schemes. We further consider how to suppress this unwanted effect. We propose a quantum computation scheme. In this sch…
We present a scheme for universal quantum computing using XY Heisenberg spin chains. Information is encoded into packets propagating down these chains, and they interact with each other to perform universal quantum computation. A circuit using g gate blocks on m qubits can be encoded into chains of length $O(g^{3+δ} m^{3+δ})$ for all $δ>0$ with vanishingly small error.
The quantum coherence of the two-site XYZ model with Dzyaloshinsky-Moriya (DM) interactions in an external inhomogenous magnetic field is studied. The DM interaction, the magnetic field and the measurement basis can be along different directions, and we examine the quantum coherence at finite temperature. With respect to the spin-spin interaction parameter, we find that the quantum coherence decreases when the direction of measurement basis is the same as that of the spin-spin interaction. When the spin-lattice interaction is varied, the coherence always increases irrespective of the relation …
It has been shown that, for the two-qubit Heisenberg XY model, anisotropy and magnetic field may together be used to produce entanglement for any finite temperature by adjusting the external magnetic field beyond some finite critical strength. This interesting result arises from an analysis employing the Wootters concurrence, a computable measure of entanglement for two-qubit states. Recently, Mintert {\em et al.} proposed generalizations of Wootters concurrence for multipartite states. These MKB concurrences possess a mathematical property that enables one to understand the origin of this cha…
Solid state quantum computing proposals rely on adiabatic operations of the exchange gate among localized spins in nanostructures. We study corrections to the Heisenberg interaction between lateral semiconductor quantum dots in an external magnetic field. Using exact diagonalization we obtain the regime of validity of the adiabatic approximation. We also find qualitative corrections to the Heisenberg model at high magnetic fields and in looped arrays of spins. Looped geometries of localized spins generate flux dependent, multi-spin terms which go beyond the basic Heisenberg model.
Being one of the centroidal concepts in quantum theory, the fundamental constraint imposed by Heisenberg uncertainty relations has always been a subject of immense attention and challenging in the context of joint measurements of general quantum mechanical observables. In particular, the recent extension of the original uncertainty relations has grabbed a distinct research focus and set a new ascendent target in quantum mechanics and quantum information processing. In the present work we explore the joint measurements of three incompatible observables, following the basic idea of a newly propo…
We present a new method to compute short-time expectation values in large collective spin systems with generic Markovian decoherence. Our method is based on a Taylor expansion of a formal solution to the equations of motion for Heisenberg operators. This expansion can be truncated at finite order to obtain virtually exact results at short times that are relevant for metrological applications such as spin squeezing. In order to evaluate the expansion for Heisenberg operators, we compute the relevant structure constants of a collective spin operator algebra. We demonstrate the utility of our met…
The change of a quantum state can generally only be fully monitored through simultaneous measurements of two non-commuting observables X and Y spanning a phase space. A measurement device that is coupled to the thermal environment provides at a time a pair of values that have a minimal uncertainty product set by the Heisenberg uncertainty relation, which limits the precision of the monitoring. Here we report on an optical measurement setup that is able to monitor the time dependent change of the quantum state's displacement in phase space (< X (t)>; < Y (t)>) with an imprecision 10\,dB below t…
Large optical nonlinearities can have numerous applications, ranging from the generation of cat-states for optical quantum computation, through to quantum sensing where the sensitivity exceeds Heisenberg scaling in the resources. However, the generation of ultra-large optical nonlinearities has proved immensely challenging experimentally. We describe a novel protocol where one can effectively generate large optical nonlinearities via the conditional application of a linear operation on an optical mode by an ancilla mode, followed by a measurement of the ancilla and corrective operation on the …
The well known interpretational difficulties with nonlinear Schrödinger and von Neumann equations can be reduced to the problem of computing multiple-time correlation functions in the absence of Heisenberg picture. Having no Heisenberg picture one often resorts to Zeno-type reasoning which explicitly involves the projection postulate as a means of computing conditional and joint probabilities. Although the method works well in linear quantum mechanics, it completely fails for nonlinear evolutions. We propose an alternative way of performing the same task in linear quantum mechanics and show th…
Recently there has been interest in the idea of quantum computing without control of the physical interactions between component qubits. This is highly appealing since the 'switching' of such interactions is a principal difficulty in creating real devices. It has been established that one can employ 'always on' interactions in a one-dimensional Heisenberg chain, provided that one can tune the Zeeman energies of the individual (pseudo-)spins. It is important to generalize this scheme to higher dimensional networks, since a real device would probably be of that kind. Such generalisations have be…
The term Clifford group was introduced in 1998 by D. Gottesmann in his investigation of quantum error-correcting codes. The simplest Clifford group in multiqubit quantum computation is generated by a restricted set of unitary Clifford gates - the Hadamard, $π/4$-phase and controlled-X gates. Because of this restriction the Clifford model of quantum computation can be efficiently simulated on a classical computer (the Gottesmann-Knill theorem). However, this fact does not diminish the importance of the Clifford model, since it may serve as a suitable starting point for a full-fledged quantum co…
Near-Heisenberg-limited parallel amplitude estimation with logarithmic depth circuit
Mizuho Research & Technologies, Ltd.（瑞穗研究与技术株式会社）；Quantum Computing Center, Keio University（庆应义塾大学量子计算中心）；Graduate School of Science and Technology, Keio University（庆应义塾大学理工学研究科）；Department of Applied Physics and Physico-Informatics, Keio University（庆应义塾大学应用物理与物性信息学系）
If the interaction between qubits in a quantum computer has a non-diagonal form (e.g. the Heisenberg interaction), then one must be able to "switch it off" in order to prevent uncontrolled propagation of states. Therefore, such QC schemes typically demand local control of the interaction strength between each pair of neighboring qubits. Here we demonstrate that this degree of control is not necessary: it suffices to switch the interaction collectively - something that can in principle be achieved by global fields rather than with local manipulations. This observation may offer a significant si…
Recently, universally valid uncertainty relations have been established to set a precision limit for any instruments given a disturbance constraint in a form more general than the one originally proposed by Heisenberg. One of them leads to a quantitative generalization of the Wigner-Araki-Yanase theorem on the precision limit of measurements under conservation laws. Applying this, a rigorous lower bound is obtained for the gate error probability of physical implementations of Hadamard gates on a standard qubit of a spin 1/2 system by interactions with control fields or ancilla systems obeying …
We address the issue of precisely estimating small parameters encoded in a general linear transformation of the modes of a bosonic quantum field. Such Bogoliubov transformations frequently appear in the context of quantum optics. We provide a set of instructions for computing the quantum Fisher information for arbitrary pure initial states. We show that the maximally achievable precision of estimation is inversely proportional to the squared average particle number and that such Heisenberg scaling requires non-classical, but not necessarily entangled states. Our method further allows us to qua…
We generalize past work on quantum sensor networks to show that, for $d$ input parameters, entanglement can yield a factor $\mathcal O(d)$ improvement in mean squared error when estimating an analytic function of these parameters. We show that the protocol is optimal for qubit sensors, and conjecture an optimal protocol for photons passing through interferometers. Our protocol is also applicable to continuous variable measurements, such as one quadrature of a field operator. We outline a few potential applications, including calibration of laser operations in trapped ion quantum computing.
Joint Quantum Institute, NIST/University of Maryland（马里兰大学与NIST联合量子研究所）；Joint Center for Quantum Information and Computer Science, NIST/University of Maryland（马里兰大学与NIST联合量子信息与计算机科学中心）
We investigate anisotropic $XXZ$ Heisenberg spin-1/2 chains with control fields acting on one of the end spins, with the aim of exploring local quantum control in arrays of interacting qubits. In this work, which uses a recent Lie-algebraic result on the local controllability of spin chains with "always-on" interactions, we determine piecewise-constant control pulses corresponding to optimal fidelities for quantum gates such as spin-flip (NOT), controlled-NOT (CNOT), and square-root-of-SWAP ($\sqrt{\textrm{SWAP}}$). We find the minimal times for realizing different gates depending on the aniso…
Heisenberg's uncertainty principle and recently derived many no-go theorems including the no-cloning theorem and the no-deleting theorem have corroborated the idea that we can never access quantum information without causing disturbance. Here we disprove this presumption by predicting a novel phenomenon, `quantum catalysis of information,' where a system enables an otherwise impossible task by exchanging information through a quantum communication channel. This fact implies that making use of quantum information does not always cause disturbance.
Does the Heisenberg uncertainty principle (HUP) apply along the time dimension in the same way it applies along the three space dimensions? Relativity says it should; current practice says no. With recent advances in measurement at the attosecond scale it is now possible to decide this question experimentally. The most direct test is to measure the time-of-arrival of a quantum particle: if the HUP applies in time, then the dispersion in the time-of-arrival will be measurably increased. We develop an appropriate metric of time-of-arrival in the standard case; extend this to include the case whe…
One of the most widely known building blocks of modern physics is Heisenberg's indeterminacy principle. Among the different statements of this fundamental property of the full quantum mechanical nature of physical reality, the uncertainty relation for energy and time has a special place. Its interpretation and its consequences have inspired continued research efforts for almost a century. In its modern formulation, the uncertainty relation is understood as setting a fundamental bound on how fast any quantum system can evolve. In this Topical Review we describe important milestones, such as the…
Quantum regression theorem is a very useful result in open quantum system and extensively used for computing multi-point correlation functions. Traditionally it is derived for two-time correlators in the Markovian limit employing the Schrödinger picture. In this paper we make use of the Heisenberg picture to derive quantum regression theorems for multi-time correlation functions which in the special limit reduce to the well known two-time regression theorem. For multi-time correlation function we find that the regression theorem takes the same form as it takes for two-time correlation function…
In this work, we provide an overview of circuits for quantum computing. We introduce gates used in quantum computation and then present resource cost measurements used to evaluate circuits made from these gates. We then illustrate how the gates shown are then combined into quantum circuits for basic arithmetic functions. Architectures for addition, subtraction, multiplication, and division are shown. We demonstrate how to calculate the resource costs of quantum circuits. We conclude this overview with by illustrating an application of the elementary quantum circuits for the image rotation oper…
Aaronson and Arkhipov recently used computational complexity theory to argue that classical computers very likely cannot efficiently simulate linear, multimode, quantum-optical interferometers with arbitrary Fock-state inputs [Aaronson and Arkhipov, Theory Comput. 9, 143 (2013)]. Here we present an elementary argument that utilizes only techniques from quantum optics. We explicitly construct the Hilbert space for such an interferometer and show that its dimension scales exponentially with all the physical resources. We also show in a simple example just how the Schrödinger and Heisenberg pictu…
Error correcting codes protect quantum information and form the basis of fault tolerant quantum computing. Leading proposals for fault-tolerant quantum computation require codes with an exceedingly rare property, a transverse non-Clifford gate. Codes with the desired property are presented for $d$-level, qudit, systems with prime $d$. The codes use $n=d-1$ qudits and can detect upto $\sim d/3$ errors. We quantify the performance of these codes for one approach to quantum computation, known as magic state distillation. Unlike prior work, we find performance is always enhanced by increasing $d$.
A strongly coupled spin chain can mediate long-distance effective couplings or entanglement between remote qubits, and can be used as a quantum data bus. We study how the fidelity of a spin-1/2 Heisenberg chain as a spin bus is affected by static random exchange couplings and magnetic fields. We find that, while non-uniform exchange couplings preserve the isotropy of the qubit effective couplings, they cause the energy levels, the eigenstates, and the magnitude of the couplings to vary locally. On the other hand, random local magnetic fields lead to an avoided level crossing for the bus ground…
Many exponential speedups that have been achieved in quantum computing are obtained via hidden subgroup problems (HSPs). We show that the HSP over Weyl-Heisenberg groups can be solved efficiently on a quantum computer. These groups are well-known in physics and play an important role in the theory of quantum error-correcting codes. Our algorithm is based on non-commutative Fourier analysis of coset states which are quantum states that arise from a given black-box function. We use Clebsch-Gordan decompositions to combine and reduce tensor products of irreducible representations. Furthermore, we…
Quantum computing and quantum communications are exciting new frontiers in computing and communications. Indeed, the massive investments made by the governments of the US, China, and EU in these new technologies are not a secret and are based on the expected potential of these technologies to revolutionize communications, computing, and security. In addition to several field trials and hero experiments, a number of companies such as Google and IBM are actively working in these areas and some have already reported impressive demonstrations in the past few years. While there is some skepticism a…
