Related papers: Optimizing NMR quantum information processing via …
Efficient control schemes that enable fast, high-fidelity operations are essential for any practical quantum computation. However, current optimization protocols are intractable due to stringent requirements imposed by the microscopic…
We develop a quantum computing scheme utilizing McLachlan variational principle in a hybrid quantum-classical algorithm to accurately calculate the transition dynamics of a closed quantum system with many excited states subject to a strong…
The Suzuki-Trotter decomposition, which digitalizes quantum time evolution, provides a promising framework for simulating quantum dynamics on quantum hardware and exploring quantum advantage over classical computation. However, conventional…
Suppression of diabatic transitions in quantum adiabatic evolution stands as a significant challenge for ground state preparations. Counterdiabatic driving has been proposed to compensate for diabatic losses and achieve shortcut to…
Nonadiabatic geometric quantum computation (NGQC) has emerged as an excellent proposal for achieving fast and robust quantum control against control errors. However, previous NGQC protocols could not be strongly resilient against the noise…
We demonstrate how quantum optimal control can be used to enhance quantum resources for bipartite one-way protocols, specifically EPR-steering with qubit measurements. Steering is relevant for one-sided device-independent key distribution,…
Quantum annealing is a general strategy for solving difficult optimization problems with the aid of quantum adiabatic evolution. Both analytical and numerical evidence suggests that under idealized, closed system conditions, quantum…
We study the assisted adiabatic passage, and equivalently the transitionless quantum driving, as a quantum brachistochrone trajectory. The optimal Hamiltonian for given constraints is constructed from the quantum brachistochrone equation.…
Berry's approach on "transitionless quantum driving" shows how to set a Hamiltonian which drives the dynamics of a system along instantaneous eigenstates of a reference Hamiltonian to reproduce the same final result of an adiabatic process…
When parameters are varied periodically, charge can be pumped through a mesoscopic conductor without applied bias. Here, we consider the inverse effect in which a transport current drives a periodic variation of an adiabatic degree of…
The fast forward scheme of adiabatic quantum dynamics is applied to finite regular spin clusters with various geometries and the nature of driving interactions is elucidated. The fast forward is the quasi-adiabatic dynamics guaranteed by…
Quantum algorithms are prominent in the pursuit of achieving quantum advantage in various computational tasks. However, addressing challenges, such as limited qubit coherence and high error rate in near-term devices, requires extensive…
The techniques of shortcuts to adiabaticity have been proposed to accelerate the "slow" adiabatic processes in various quantum systems with the applications in quantum information processing. In this paper, we study the counter-diabatic…
We assess the prospects for algorithms within the general framework of quantum annealing (QA) to achieve a quantum speedup relative to classical state of the art methods in combinatorial optimization and related sampling tasks. We argue for…
Quantum adiabatic evolutions find a broad range of applications in quantum physics and quantum technologies. The traditional form of the quantum adiabatic theorem limits the speed of adiabatic evolution by the minimum energy gaps of the…
Noise in quantum devices is generally considered detrimental to computational accuracy. However, the recent proposal of noise-assisted simulation has demonstrated that noise can be an asset in digital quantum simulations of open systems on…
Finite-time quantum heat engines (QHEs) typically extract less work than their quasistatic counterparts because fast driving generates coherences and non-adiabatic transitions during the work strokes, a phenomenon commonly referred to as…
Gradient descent is a fundamental algorithm in both theory and practice for continuous optimization. Identifying its quantum counterpart would be appealing to both theoretical and practical quantum applications. A conventional approach to…
The existence of quantum correlation (as revealed by quantum discord), other than entanglement and its role in quantum-information processing (QIP), is a current subject for discussion. In particular, it has been suggested that this…
We use analytic (current) density-potential maps of time-dependent (current) density functional theory (TD(C)DFT) to inverse engineer analytically solvable time-dependent quantum problems. In this approach the driving potential (the control…