相关论文: Digitized counterdiabatic quantum critical dynamic…
Quantum annealing is a contender to solve combinatorial optimization problems based on quantum dynamics. While significant efforts have been undertaken to investigate the quality of the solutions and the required runtimes, much less…
Quantum adiabatic transfer is widely used in quantum computation and quantum simulation. However, the transfer speed is limited by the quantum adiabatic approximation condition, which hinders its application in quantum systems with a short…
Efficient error-mitigation techniques demanding minimal resources is key to quantum information processing. We propose a generic protocol to mitigate quantum errors using detection-based quantum autoencoders. In our protocol, the quantum…
Geometric quantum computation relies on the geometric phase that arises in adiabatic cyclic evolutions of non-degenerate quantum systems, enabling the design of robust quantum gates. However, the adiabatic condition requires long evolution…
Effective quantum communication between remote quantum nodes requires high fidelity quantum state transfer and remote entanglement generation. Recent experiments have demonstrated that microwave photons, as well as phonons, can be used to…
We inspect signatures of dynamical quantum phase transitions driven by two types of quenches acting on a correlated quantum dot embedded between superconducting and metallic reservoirs. Under stationary conditions the proximity induced…
Medium-scale quantum devices that integrate about hundreds of physical qubits are likely to be developed in the near future. However, such devices will lack the resources for realizing quantum fault tolerance. Therefore, the main challenge…
There are a number of tasks in quantum information science that exploit non-transitional adiabatic dynamics. Such a dynamics is bounded by the adiabatic theorem, which naturally imposes a speed limit in the evolution of quantum systems.…
Adiabatic quantum algorithms solve computational problems by slowly evolving a trivial state to the desired solution. On an ideal quantum computer, the solution quality improves monotonically with increasing circuit depth. By contrast,…
Quantum computation, a completely different paradigm of computing, benefits from theoretically proven speed-ups for certain problems and opens up the possibility of exactly studying the properties of quantum systems. Yet, because of the…
We propose a protocol for bosonic binomial-code nonadiabatic holonomic quantum computation in a system composed of an artificial atom ultrastrongly coupled to a cavity resonator. In our protocol, the binomial codes, formed by superpositions…
A quantum control protocol is proposed for the creation of NOON states with $N$ ultracold bosonic atoms on two modes, corresponding to the coherent superposition $\vert N,0\rangle + \vert 0,N\rangle$. This state can be prepared by using a…
Characterization of equilibrium topological quantum phases by non-equilibrium quench dynamics provides a novel and efficient scheme in detecting topological invariants defined in equilibrium. Nevertheless, most of the previous studies have…
Standard adiabatic protocols for superconducting qubits often face a trade-off between gate speed and decoherence. In this work, using IBM Quantum 127-qubit processors (ibm_fez and ibm_kingston), we report the discovery of a fundamental…
Manipulating quantum systems undergoing non-Gaussian dynamics in a fast and accurate manner is becoming fundamental to many quantum applications. Here, we focus on classical and quantum protocols transferring a state across a double-well…
Using the adiabatic perturbation theory of driven dynamics [Phys. Rev. A 78, 052508 (2008)] we design a hierarchy of quantum state preparation protocols that systematically increase the fidelity at very long driving times. We test these and…
Local counterdiabatic driving (CD) provides a feasible approach for realizing approximate reversible/adiabatic processes like quantum state preparation using only local controls and without demanding excessively long protocol times.…
Quantum computing as a promising technology can utilize stochastic solutions instead of deterministic approaches for complicated scenarios for which classical computing is inefficient, provided that both the concerns of the error-prone…
Integer factorization is a computational problem of fundamental importance in cybersecurity and secure communications, as its difficulty form the basis of modern public-key cryptography. While Shor's algorithm can solve this problem…
The quantum speed limit specifies a universal bound of the fidelity between the initial state and the time-evolved state. We apply this method to find a bound of the fidelity between the adiabatic state and the time-evolved state. The bound…