基于绝热捷径快速实现远距离的四维纠缠态的制备

作为量子信息处理的载体,量子纠缠态一直以来都是量子信息领域的研究热点.相比于低维纠缠态,高维纠缠态使得量子通信具有更快的传输速度、更强的安全性、更高的噪声容忍阈值等特点.另外,绝热技术因其对实验参数起伏不敏感而被广泛应用于纠缠态的制备,然而绝热过程需要相当长的演化时间,因此绝热捷径应运而生.本文提出了一种采用无跃迁量子驱动构建绝热捷径实现快速制备两个原子的四维纠缠态的理论方案,该系统中的两个原子分别被囚禁在两个由光纤连接的双模腔中.为了获得一个技术上可操作的物理系统,本方案采用能级失谐设计出一个可精确驱动系统沿着某一个系统的瞬时本征态演化的哈密顿.该方案所采用的无跃迁量子驱动构建绝热捷径不仅大大缩短了演化时间,而且在实验上也比较容易实现.本文还数值模拟了消相干因素对四维纠缠态保真度的影响,结果表明,只要脉冲参数选取在一定范围内,光纤耗散、腔场耗散和原子自发辐射等不利因素都会被大大抑制.     

基于超绝热捷径技术快速制备超导三量子比特Greenberger-Horne-Zeilinger态

本文提出了一个基于超绝热捷径技术快速制备超导三量子比特Greenberger-Horne-Zeilinger态的理论方案.该方案首先在量子Zeno动力学的帮助下得到系统的有效哈密顿量,之后通过引入与有效哈密顿量具有相同形式的反向导热哈密顿量来构建绝热捷径,加速了整个系统的演化过程.该方案不需要初态和目标态之间的直接耦合,在实验上也更容易实现.数值模拟结果表明该方案对超导量子比特的自发辐射、波导谐振腔的泄漏以及超导量子比特的退相位是鲁棒的.     

Effect of local minima on adiabatic quantum optimization

We present a perturbative method to estimate the spectral gap for adiabatic quantum optimization, based on the structure of the energy levels in the problem Hamiltonian. We show that, for problems that have an exponentially large number of local minima close to the global minimum, the gap becomes exponentially small making the computation time exponentially long. The quantum advantage of adiabatic quantum computation may then be accessed only via the local adiabatic evolution, which requires phase coherence throughout the evolution and knowledge of the spectrum. Such problems, therefore, are not suitable for adiabatic quantum computation.     

Symmetry-Protected Quantum Adiabatic Evolution in Spontaneous Symmetry-Breaking Transitions

Quantum adiabatic evolution describes the dynamical evolution of a slowly driven Hamiltonian. In most systems undergoing spontaneous symmetry-breaking transitions, the symmetry-protected quantum adiabatic evolution can still appear, even when the two lowest eigenstates become degenerate. Here, a general derivation to revisit the symmetry-dependent transition and the symmetry-dependent adiabatic condition (SDAC) is given. Further, based on the SDAC, an adiabatic-parameter-fixed sweeping scheme is used for achieving fast adiabatic evolution, which is more efficient than the linear sweeping scheme. In the limit of small adiabatic parameter, an analytic inequality is obtained for the ground state fidelity only dependent on the adiabatic parameter. The general statements are then demonstrated via two typical systems. Besides, the robustness of the symmetry-dependent adiabatic evolution against weak symmetry-breaking sources is studied. The findings can be tested via the techniques in quantum annealing and may provide promising applications in practical quantum technologies.     

Highly efficient charging and discharging of three-level quantum batteries through shortcuts to adiabaticity

Quantum batteries are energy storage devices that satisfy quantum mechanical principles. How to improve the battery’s performance such as stored energy and power is a crucial element in the quantum battery. Here, we investigate the charging and discharging dynamics of a three-level counterdiabatic stimulated Raman adiabatic passage quantum battery via shortcuts to adiabaticity, which can compensate for undesired transitions to realize a fast adiabatic evolution through the application of an additional control field to an initial Hamiltonian. The scheme can significantly speed up the charging and discharging processes of a three-level quantum battery and obtain more stored energy and higher power compared with the original stimulated Raman adiabatic passage. We explore the effect of both the amplitude and the delay time of driving fields on the performances of the quantum battery. Possible experimental implementation in superconducting circuit and nitrogen–vacancy center is also discussed.     

How to decompose arbitrary continuous-variable quantum operations

We present a general, systematic, and efficient method for decomposing any given exponential operator of bosonic mode operators, describing an arbitrary multimode Hamiltonian evolution, into a set of universal unitary gates. Although our approach is mainly oriented towards continuous-variable quantum computation, it may be used more generally whenever quantum states are to be transformed deterministically, e.g., in quantum control, discrete-variable quantum computation, or Hamiltonian simulation. We illustrate our scheme by presenting decompositions for various nonlinear Hamiltonians including quartic Kerr interactions. Finally, we conclude with two potential experiments utilizing offline-prepared optical cubic states and homodyne detections, in which quantum information is processed optically or in an atomic memory using quadratic light-atom interactions.     

Quantum-Classical Correspondence for Adiabatic Shortcut in Two- and Three-Level Atoms

The methods of quickly achieving the adiabatic effect through a non-adiabatic process has recently drawn widely attention both in quantum and classical regime. In this work ,we study the classical adiabatic shortcut for two- and three-Level atoms by transforming the quantum version into classical one via quantum-classical corresponding theory. The results shows that, the additional couplings between the oscillators can be used to speed up the adiabatic evolution of coupled oscillators. Furthermore, we find that the quantum-classical correspondence theory still holds for the couter-adiabatic driving Hamiltonian for the TQD. This means that, we can obtain the counter-adiabatic driving Hamiltonian for a classical system by averaging over its quantum correspondence in a quantum system. This provides a feasible way to study the classical adiabatic shortcut and the simulation for the quantum adiabatic shortcut in a classical system.

     

Quantum Adiabatic Evolution for Pattern Recognition Problem

Quantum pattern recognition algorithm for two-qubit systems has been implemented by quantum adiabatic evolution.We will estimate required running time for this algorithm by means of an analytical solution of timedependent Hamiltonian since the time complexity of adiabatic quantum evolution is a limitation on the quantum computing.These results can be useful for experimental implementation.     

Experimental implementation of local adiabatic evolution algorithms by an NMR quantum information processor

Quantum adiabatic algorithm is a method of solving computational problems by evolving the ground state of a slowly varying Hamiltonian. The technique uses evolution of the ground state of a slowly varying Hamiltonian to reach the required output state. In some cases, such as the adiabatic versions of Grover's search algorithm and Deutsch-Jozsa algorithm, applying the global adiabatic evolution yields a complexity similar to their classical algorithms. However, using the local adiabatic evolution, the algorithms given by J. Roland and N.J. Cerf for Grover's search [J. Roland, N.J. Cerf, Quantum search by local adiabatic evolution, Phys. Rev. A 65 (2002) 042308] and by Saurya Das, Randy Kobes, and Gabor Kunstatter for the Deutsch-Jozsa algorithm [S. Das, R. Kobes, G. Kunstatter, Adiabatic quantum computation and Deutsh's algorithm, Phys. Rev. A 65 (2002) 062301], yield a complexity of order N (where N=2(n) and n is the number of qubits). In this paper, we report the experimental implementation of these local adiabatic evolution algorithms on a 2-qubit quantum information processor, by Nuclear Magnetic Resonance.     

Noncyclic nonadiabatic holonomic quantum gates via shortcuts to adiabaticity

High-fidelity quantum gates are essential for large-scale quantum computation. However, any quantum manipulation will inevitably affected by noises, systematic errors and decoherence effects, which lead to infidelity of a target quantum task. Therefore, implementing high-fidelity, robust and fast quantum gates is highly desired. Here, we propose a fast and robust scheme to construct high-fidelity holonomic quantum gates for universal quantum computation based on resonant interaction of three-level quantum systems via shortcuts to adiabaticity. In our proposal, the target Hamiltonian to induce noncyclic non-Abelian geometric phases can be inversely engineered with less evolution time and demanding experimentally, leading to high-fidelity quantum gates in a simple setup. Besides, our scheme is readily realizable in physical system currently pursued for implementation of quantum computation. Therefore, our proposal represents a promising way towards fault-tolerant geometric quantum computation.     

Fast and Robust Quantum Information Transfer in Annular and Radial Superconducting Networks

In this paper, we propose a protocol to achieve fast and robustness quantum information transfer (QIT) in annular and radial superconducting networks, where each quantum node is composed of a superconducting quantum interference device (SQUID) inside a coplanar waveguide resonator (CPWR). The process is based on reversely constructing time‐dependent control Hamiltonian by designing evolution operator. With the protocol, the maximal population of lossy intermediate states and the amplitudes of pulses can be easily controlled by two corresponding control parameters. Therefore, one can design feasible pulses for QIT with great flexibility. Besides, the speed of the QIT here is much faster compared with that with adiabatic QIT. Moreover, numerical simulations show that the protocol still possesses high fidelity when lossy factors and imperfect operations are taken into account. Therefore, the protocol may provide a useful way to manipulate quantum information networks.     

Transitionless driving on local adiabatic quantum search algorithm

We apply the transitionless driving on the local adiabatic quantum search algorithm to speed up the adiabatic process.By studying quantum dynamics of the adiabatic search algorithm with the equivalent two-level system, we derive the transitionless driving Hamiltonian for the local adiabatic quantum search algorithm. We found that when adding a transitionless quantum driving term H_D(t) on the local adiabatic quantum search algorithm, the success rate is 1 exactly with arbitrary evolution time by solving the time-dependent Schr odinger equation in eigen-picture. Moreover, we show the reason for the drastic decrease of the evolution time is that the driving Hamiltonian increases the lowest eigenvalues to a maximum of ON~(1/2).     

Adiabatic theorems and applications to the quantum hall effect

We study an adiabatic evolution that approximates the physical dynamics and describes a natural parallel transport in spectral subspaces. Using this we prove two folk theorems about the adiabatic limit of quantum mechanics: 1. For slow time variation of the Hamiltonian, the time evolution reduces to spectral subspaces bordered by gaps. 2. The eventual tunneling out of such spectral subspaces is smaller than any inverse power of the time scale if the Hamiltonian varies infinitly smoothly over a finite interval. Except for the existence of gaps, no assumptions are made on the nature of the spectrum. We apply these results to charge transport in quantum Hall Hamiltonians and prove that the flux averaged charge transport is an integer in the adiabatic limit.     

Quantum speed-up capacity in different types of quantum channels for two-qubit open systems

A potential acceleration of a quantum open system is of fundamental interest in quantum computation, quantum communication, and quantum metrology. In this paper, we investigate the "quantum speed-up capacity" which reveals the potential ability of a quantum system to be accelerated. We explore the evolutions of the speed-up capacity in different quantum channels for two-qubit states. We find that although the dynamics of the capacity is varying in different kinds of channels, it is positive in most situations which are considered in the context except one case in the amplitude-damping channel. We give the reasons for the different features of the dynamics. Anyway, the speed-up capacity can be improved by the memory effect. We find two ways which may be used to control the capacity in an experiment: selecting an appropriate coefficient of an initial state or changing the memory degree of environments.     

Experimental preparation of topologically ordered states via adiabatic evolution

Topological orders are a class of exotic states of matter characterized by patterns of long-range entanglement. Certain topologically ordered systems are proposed as potential realization of fault-tolerant quantum computation. Topological orders can arise in two-dimensional spin-lattice models. In this paper, we engineer a time-dependent Hamiltonian to prepare a topologically ordered state through adiabatic evolution. The other sectors in the degenerate ground-state space of the model are obtained by applying nontrivial operations corresponding to closed string operators. Each sector is highly entangled, as shown from the completely reconstructed density matrices. This paves the way towards exploring the properties of topological orders and the application of topological orders in topological quantum memory.     

Multiphonon-resonance quantum Rabi model and adiabatic passage in a cavity-optomechanical system

In this paper,we propose a scheme to achieve a multiphonon-resonance quantum Rabi model and adiabatic passage in a strong-coupling cavity optomechanical system.In the scheme,when the driving bichromatic laser beam is adjusted to the off-resonant j-order red-and blue-sideband,the interaction between the cavity and mechanical oscillator leads to a j-phonon resonance quantum Rabi model.Moreover,we show that there exists a resonant multi-phonon coupling via intermediate states connected by counter-rotating processes when the frequency of the simulated bosonic mode is near a fraction of the transition frequency of the simulated two-level system.As a typical example,we theoretically analyze the two-phonon resonance quantum Rabi model,and derive an effective Hamiltonian of the six-phonon coupling.Finally,we present a method of six-phonon generation based on adiabatic passage across the resonance.Numerical simulations confirm the validity of the proposed scheme.Theoretically,the proposed scheme can be extended to the realization of 3j-phonon state.     

On Models of Nonlinear Evolution Paths in Adiabatic Quantum Algorithms

In this paper,we study two different nonlinear interpolating paths in adiabatic evolution algorithms for solving a particular class of quantum search problems where both the initial and final Hamiltonian are one-dimensional projector Hamiltonians on the corresponding ground state.If the overlap between the initial state and final state of the quantum system is not equal to zero,both of these models can provide a constant time speedup over the usual adiabatic algorithms by increasing some another corresponding "complexity".But when the initial state has a zero overlap with the solution state in the problem,the second model leads to an infinite time complexity of the algorithm for whatever interpolating functions being applied while the first one can still provide a constant running time.However,inspired by a related reference,a variant of the first model can be constructed which also fails for the problem when the overlap is exactly equal to zero if we want to make up the "intrinsic" fault of the second model - an increase in energy.Two concrete theorems are given to serve as explanations why neither of these two models can improve the usual adiabatic evolution algorithms for the phenomenon above.These just tell us what should be noted when using certain nonlinear evolution paths in adiabatic quantum algorithms for some special kind of problems.     

Intramolecular Hamiltonian logic gates

An intramolecular computing model is presented that is based on the quantum time evolution of a single molecule driven by the preparation of a non-stationary single-electron state. In our scheme, the input bits are encoded into the coupling constants of the Hamiltonian that governs the molecular quantum dynamics. The results of the computation are obtained by carrying out a quantum measurement on the molecule. We design reliable , , and logic gates. This opens new avenues for the design of more complex logic circuits at a single-molecular scale.     

Strong Analog Classical Simulation of Coherent Quantum Dynamics

A strong analog classical simulation of general quantum evolution is proposed, which serves as a novel scheme in quantum computation and simulation. The scheme employs the approach of geometric quantum mechanics and quantum informational technique of quantum tomography, which applies broadly to cases of mixed states, nonunitary evolution, and infinite dimensional systems. The simulation provides an intriguing classical picture to probe quantum phenomena, namely, a coherent quantum dynamics can be viewed as a globally constrained classical Hamiltonian dynamics of a collection of coupled particles or strings. Efficiency analysis reveals a fundamental difference between the locality in real space and locality in Hilbert space, the latter enables efficient strong analog classical simulations. Examples are also studied to highlight the differences and gaps among various simulation methods.     

On the usefulness of an assisted driving Hamiltonian for quantum adiabatic evolution

In our recent work we showed, by investigating the initialization of some unusual forms of assisted driving Hamiltonians, that the addition of an assisted driving Hamiltonian is not always useful in quantum adiabatic evolution. These unusual forms are those that are not the relatively fixed ones that are widely used in the literature. In this paper, we continue this study, providing further evidence for the validity of the conclusion above by researching some relatively more complex forms of assisted driving scheme, which generalize the ones studied in our previous work.