Related papers: Chiral Discrimination on Gate-Based Quantum Comput…
A central challenge in the successful implementation of adiabatic quantum algorithms is to maintain the quantum adiabaticity during the entire evolution. However, the energy gap between the ground and the excited states of interacting…
Adiabatic or slowly varying gate operations are typically required in order to remain within the qubit subspace in an anharmonic oscillator. However significant speed ups are possible by using the two quadrature…
Quantum optimal control plays a vital role in many quantum technologies, including quantum computation. One of the most important control parameters to optimise for is the evolution time (pulse duration). However, most existing works focus…
We describe the simulation of dihedral gauge theories on digital quantum computers. The nonabelian discrete gauge group $D_N$ -- the dihedral group -- serves as an approximation to $U(1)\times\mathbb{Z}_2$ lattice gauge theory. In order to…
Fast and robust quantum control protocols are often based on an idealised approximate description of the relevant quantum system. While this may provide a performance which is close to optimal, improvements can be made by incorporating…
Nonadiabatic holonomic quantum computation (NHQC) has attracted significant attention due to its fast evolution and the geometric nature induced resilience to local noises. However, its long operation time and complex physical…
A general time-dependent quantum system can be driven fast from its initial ground state to its final ground state without generating transitions by adding a steering term to the Hamiltonian. We show how this technique can be modified to…
Transitions out of the ground space limit the performance of quantum adiabatic algorithms, while hardware imperfections impose stringent limitations on the circuit depth. We propose an adiabatic echo verification protocol which mitigates…
The standard stimulated Raman adiabatic passage (STIRAP) protocol enables high-fidelity quantum state transfer in an ideal three-level system via adiabatic following of a dark state evolution. However, in practical systems with more energy…
Non-abelian gauge theories underlie our understanding of fundamental forces in nature, and developing tailored quantum hardware and algorithms to simulate them is an outstanding challenge in the rapidly evolving field of quantum simulation.…
A fundamental challenge in quantum computing is to increase the number of operations within the qubit coherence time. While this can be achieved by decreasing the gate duration, the use of shorter signals increases their bandwidth and can…
Extremely fast qubit controls can greatly reduce the calculation time in quantum computation, and potentially resolve the finite-time decoherence issues in many physical systems. Here, we propose and experimentally demonstrate pico-second…
Geometric phases are robust against certain types of local noises, and thus provide a promising way towards high-fidelity quantum gates. However, comparing with the dynamical ones, previous implementations of nonadiabatic geometric quantum…
Ultracold polar molecules in optical lattices or tweezer arrays offer a promising platform for quantum information processing and simulation, thanks to their rich internal structure and long-range dipolar interactions. Recent experimental…
Distributed quantum computing offers a potential solution to the complexity of superconducting chip hardware layouts and error correction algorithms. High-quality gates between distributed chips enable the simplification of existing error…
Quantum gates, which are the essential building blocks of quantum computers, are very fragile. Thus, to realize robust quantum gates with high fidelity is the ultimate goal of quantum manipulation. Here, we propose a nonadiabatic geometric…
Motivated by the quantum adiabatic algorithm (QAA), we consider the scaling of the Hamiltonian gap at quantum first order transitions, generally expected to be exponentially small in the size of the system. However, we show that a quantum…
For superconducting quantum processors, stable high-fidelity two-qubit operations depend on precise flux control of the tunable coupler. However, the pulse distortion poses a significant challenge to the control precision. Current…
One of the difficulties in adiabatic quantum computation is the limit on the computation time. Here we propose two schemes to speed-up the adiabatic evolution. To apply this controlled adiabatic evolution to adiabatic quantum computation,…
The preparation of quantum states using short quantum circuits is one of the most promising near-term applications of small quantum computers, especially if the circuit is short enough and the fidelity of gates high enough that it can be…