Related papers: Geometric tools of the adiabatic complex WKB metho…
Quantum mechanical WKB-method is elaborated for the known quantum Kepler problem in curved 3-space models Euclide, Riemann and Lobachevsky in the framework of the complex variable function theory. Generalized Schr\"{o}dinger, Klein-Fock…
We introduce the prodiabatic elimination, a powerful approximation technique that systematically extends the adiabatic elimination of fast degrees of freedom in light-matter coupled systems. Through a controlled expansion of operators, the…
A major challenge in quantum computing is to solve general problems with limited physical hardware. Here, we implement digitized adiabatic quantum computing, combining the generality of the adiabatic algorithm with the universality of the…
Nonadiabatic geometric phases are only dependent on the evolution path of a quantum system but independent of the evolution details, and therefore quantum computation based on nonadiabatic geometric phases is robust against control errors.…
We consider elliptic solutions of the semi-discrete BKP equation and derive equations of motion for their poles. The basic tool is the auxiliary linear problem for the wave function.
Shortcuts to adiabaticity is a general method for speeding up adiabatic quantum protocols, and has many potential applications in quantum information processing. Unfortunately, analytically constructing shortcuts to adiabaticity for systems…
In these lectures, we provide an introduction to the complex WKB method, using as a guiding example a class of anharmonic oscillators that appears in the ODE/IM correspondence. In the first three lectures, we introduce the main objects of…
In this article, we provide an introduction to an algorithm for constructing Weinstein handlebodies for complements of certain smoothed toric divisors using explicit coordinates and a simple example. This article also serves to welcome…
Quantum computing promises significant improvements of computation capabilities in various fields such as machine learning and complex optimization problems. Recent technological advancements suggest that the adiabatic quantum computing…
By using the effective Hamiltonian approach, we present a self-consistent framework for the analysis of geometric phases and dynamically stable decoherence-free subspaces in open systems. Comparisons to the earlier works are made. This…
The quantum geometric tensor has established itself as a general framework for the analysis and detection of equilibrium phase transitions in isolated quantum systems. We propose a novel generalization of the quantum geometric tensor, which…
Adiabatic techniques offer some of the most promising tools to achieve high-fidelity control of the centre-of-mass degree of freedom of single atoms. As their main requirement is to follow an eigenstate of the system, constraints on timing…
The effect due to the inter-subsystem coupling on the off-diagonal geometric phase in a composite system is investigated. We analyze the case where the system undergo an adiabatic evolution. Two coupled qubits driven by time-dependent…
Nonadiabatic geometric quantum computation in decoherence-free subspaces has received increasing attention due to the merits of its high-speed implementation and robustness against both control errors and decoherence. However, all the…
We study the fault tolerance of quantum computation by adiabatic evolution, a quantum algorithm for solving various combinatorial search problems. We describe an inherent robustness of adiabatic computation against two kinds of errors,…
A single-loop scenario is proposed to realize nonadiabatic geometric quantum computation. Conventionally, a so-called multi-loop approach is used to remove the dynamical phase accumulated in the operation process for geometric quantum…
Recently, nonadiabatic geometric quantum computation has been received great attentions, due to its fast operation and intrinsic error resilience. However, compared with the corresponding dynamical gates, the robustness of implemented…
Many artificial intelligence (AI) problems naturally map to NP-hard optimization problems. This has the interesting consequence that enabling human-level capability in machines often requires systems that can handle formally intractable…
Pedagogical introduction to counterdiabatic formalism of shortcuts to adiabaticity is given so that the readers are accessible to some of more specialized articles in the rest of this theme issue without a much barrier. A guide to…
A simple proof of quantum adiabatic theorem is provided. Quantum adiabatic approximation is divided into two kinds. For Hamiltonian H(t/T), a relation between the size of the error caused by quantum adiabatic approximation and the parameter…