Quantum computation offers the potential to solve fundamental yet otherwise intractable problems across a range of active fields of research. Recently, universal quantum-logic gate sets - the building blocks for a quantum computer - have been demonstrated in several physical architectures. A serious obstacle to a full-scale implementation is the sheer number of these gates required to implement even small quantum algorithms. Here we present and demonstrate a general technique that harnesses higher dimensions of quantum systems to significantly reduce this number, allowing the construction of key quantum circuits with existing technology. We are thereby able to present the first implementation of two key quantum circuits: the three-qubit Toffoli and the two-qubit controlled-unitary. The gates are realised in a linear optical architecture, which would otherwise be absolutely infeasible with current technology.
Shortcuts to adiabaticity are well-known methods for controlling the quantum dynamics beyond the adiabatic criteria, where counter-diabatic (CD) driving provides a promising means to speed up quantum many-body systems. In this work, we show the applicability of CD driving to enhance the digitized adiabatic quantum computing paradigm in terms of fidelity and total simulation time. We study the state evolution of an Ising spin chain using the digitized version of the standard CD driving and its variants derived from the variational approach. We apply this technique in the preparation of Bell and…
The quantum perceptron is a fundamental building block for quantum machine learning. This is a multidisciplinary field that incorporates abilities of quantum computing, such as state superposition and entanglement, to classical machine learning schemes. Motivated by the techniques of shortcuts to adiabaticity, we propose a speed-up quantum perceptron where a control field on the perceptron is inversely engineered leading to a rapid nonlinear response with a sigmoid activation function. This results in faster overall perceptron performance compared to quasi-adiabatic protocols, as well as in en…
Adiabatic evolution is a powerful technique in quantum information and computation. However, its performance is limited by the adiabatic theorem of quantum mechanics. In this scenario, shortcuts to adiabaticity, such as provided by the superadiabatic theory, constitute a valuable tool to speed up the adiabatic quantum behavior. In this dissertation we introduce two different models to perform universal superadiabatic quantum computing, which are based on the use of shortcuts to adiabaticity by counter-diabatic Hamiltonians. The first model is based on the use of superadiabatic quantum teleport…
Shortcuts to adiabaticity (STA) are fast methods to realize the same final state evolution of quantum adiabatic process. We develop a general theory to construct a new kind of STA by solely sampling the points of the adiabatic path of the original adiabatic Hamiltonian. In contrast to previous methods, our approach does not require any additional control resources, has inherent robustness, and does not use any complicated unitary transformation. Based on path sampling, the resulting STA protocols are simple and can avoid points of adiabatic path that are challenging to implement. As applicatio…
Envariance is a symmetry exhibited by correlated quantum systems. Inspired by this "quantum fact of life," we propose a novel method for shortcuts to adiabaticity which enables the system to evolve through the adiabatic manifold at all times, solely by controlling the environment. As main results, we construct the unique form of the driving on the environment that enables such dynamics, for a family of composite states of arbitrary dimension. We compare the cost of this environment-assisted technique with that of counterdiabatic driving, and we illustrate our results for a two-qubit model.
We engineer the fast rotation of a quantum particle confined in an effectively one-dimensional, harmonic trap, for a predetermined rotation angle and time, avoiding final excitation. Different schemes are proposed with different speed limits that depend on the control capabilities. We also make use of trap rotations to create squeezed states without manipulating the trap frequencies.
Theoretical studies of coherent atom transport have as yet mainly been restricted to one-dimensional model systems with harmonic trapping potentials. Here we investigate this important phenomenon -- a prerequisite for a variety of quantum-technology applications based on cold neutral atoms -- under much more complex physical circumstances. More specificially yet, we study fast atomic transport in a moving {\em double-well optical lattice}, whose three-dimensional (anharmonic) potential is nonseparable in the $x-y$ plane. We first propose specific configurations of acousto-optic modulators that…
The adiabatic theorem and "shortcuts to adiabaticity" for the adiabatic dynamics of time-dependent decoherence-free subspaces are explored in this paper. Starting from the definition of the dynamical stable decoherence-free subspaces, we show that, under a compact adiabatic condition, the quantum state follows time-dependent decoherence-free subspaces (the adiabatic decoherence free subspaces) into the target subspace with extremely high purity, even though the dynamics of the quantum system may be non-adiabatic. The adiabatic condition mentioned in the adiabatic theorem is very similar with t…
We propose a mean to obtain computationally useful resource states also known as cluster states, for measurement-based quantum computation, via transitionless quantum driving algorithm. The idea is to cool the system to its unique ground state and tune some control parameters to arrive at computationally useful resource state, which is in one of the degenerate ground states. Even though there is set of conserved quantities already present in the model Hamiltonian, which prevents the instantaneous state to go to any other eigenstate subspaces, one cannot quench the control parameters to get the…
We study the environment assisted local transitionless dynamics in closed spin systems driven through quantum critical points. In general shortcut to adaiabaticity (STA) in quantum critical systems requires highly non-local control Hamiltonians. In this work we develop an approach to achieve local shortcuts to adiabaticity (LSTA) in spin chains, using local control fields which scale polynomially with the system size, following universal critical exponents. We relate the control fields to reduced fidelity susceptibility and use transverse Ising model in one dimension to exemplify our generic r…
Rapid preparation, manipulation, and correction of spin states with high fidelity are requisite for quantum information processing and quantum computing. In this paper, we propose a fast and robust approach for controlling two spins with Heisenberg and Ising interactions. By using the concept of shortcuts to adiabaticity, we first inverse design the driving magnetic fields for achieving fast spin flip or generating the entangled Bell state, and further optimize them with respect to the error and fluctuation. In particular, the designed shortcut protocols can efficiently suppress the unwanted t…
We propose a systematic method based on reinforcement learning (RL) techniques to find the optimal path that can minimize the total entropy production between two equilibrium states of open systems at the same temperature in a given fixed time period. Benefited from the generalization of the deep RL techniques, our method can provide a powerful tool to address this problem in quantum systems even with two-dimensional continuous controllable parameters. We successfully apply our method on the classical and quantum two-level systems.
A quantum network promises to enable long distance quantum communication, and assemble small quantum devices into a large quantum computing cluster. Each network node can thereby be seen as a small few qubit quantum computer. Qubits can be sent over direct physical links connecting nearby quantum nodes, or by means of teleportation over pre-established entanglement amongst distant network nodes. Such pre-shared entanglement effectively forms a shortcut - a virtual quantum link - which can be used exactly once. Here, we present an abstraction of a quantum network that allows ideas from computer…
Shortcuts to adiabaticity constitute a powerful alternative that speed up time-evolution while mimicking adiabatic dynamics. They are also relevant to clarify fundamental questions such as a precise quantification of the third principle of thermodynamics and quantum speed limits. In this letter we describe, for the first time, how to implement shortcuts to adiabaticity in quantum field theory, for the particular case of a massless scalar field inside a cavity with a moving wall, in 1 + 1 dimensions. The approach is based on the known solution to the problem that exploits the conformal symmetry…
Quantum coherence and counterdiabatic quantum computing
Facultad de Ciencias, Universidad Nacional Autónoma de México (UNAM)（墨西哥国立自治大学）；Departamento de Física, Universidad de Santiago de Chile (USACH)（智利圣地亚哥大学）；Kipu Quantum（Kipu量子）；Universidad Diego Portales（迭戈·波特莱斯大学）
Engineering dissipation and control pulses for high-fidelity fault-tolerance quantum computing
Fujian Key Laboratory of Quantum Information and Quantum Optics, Fuzhou University（福州大学）；Department of Physics, Fuzhou University（福州大学）；Quantum Information Physics Theory Research Team, Center for Quantum Computing, RIKEN（理化学研究所）；Institute of Quantum Science and Technology, Yanbian University（延边大学）
Quantum integer factorization is a potential quantum computing solution that may revolutionize cryptography. Nevertheless, a scalable and efficient quantum algorithm for noisy intermediate-scale quantum computers looks far-fetched. We propose an alternative factorization method, within the digitized-adiabatic quantum computing paradigm, by digitizing an adiabatic quantum factorization algorithm enhanced by shortcuts to adiabaticity techniques. We find that this fast factorization algorithm is suitable for available gate-based quantum computers. We test our quantum algorithm in an IBM quantum c…
Boson sampling, thought to be intractable classically, can be solved by a quantum machine composed of merely generation, linear evolution and detection of single photons. Such an analog quantum computer for this specific problem provides a shortcut to boost the absolute computing power of quantum computers to beat classical ones. However, the capacity bound of classical computers for simulating boson sampling has not yet been identified. Here we simulate boson sampling on the Tianhe-2 supercomputer which occupied the first place in the world ranking six times from 2013 to 2016. We computed the…
