Shortcuts to adiabaticity are well-known methods for controlling the quantum dynamics beyond the adiabatic criteria, where counterdiabatic (CD) driving provides a promising means to speed up quantum many-body systems. In this work, we show the applicability of CD driving to enhance the digitized adiabatic quantum computing paradigm in terms of fidelity and total simulation time. We study the state evolution of an Ising spin chain using the digitized version of the standard CD driving and its variants derived from the variational approach. We apply this technique in the preparation of Bell and Greenberger-Horne-Zeilinger states with high fidelity using a very shallow quantum circuit. We implement this proposal on the IBM quantum computer, proving its usefulness for the speed up of adiabatic quantum computing in noisy intermediate-scale quantum devices.
In the noisy intermediate-scale quantum era, optimal digitized pulses are requisite for efficient quantum control. This goal is translated into dynamic programming, in which a deep reinforcement learning (DRL) agent is gifted. As a reference, shortcuts to adiabaticity (STA) provide analytical approaches to adiabatic speedup by pulse control. Here, we select the single-component control of qubits, resembling the ubiquitous two-level Landau-Zener problem for gate operation. We aim at obtaining fast and robust digital pulses by combining the STA and DRL algorithm. In particular, we find that DRL leads to robust digital quantum control with the operation time bounded by quantum speed limits dictated by STA. In addition, we demonstrate that robustness against systematic errors can be achieved by DRL without any input from STA. Our results introduce a general framework of digital quantum control, leading to a promising enhancement in quantum information processing.
The prediction of financial crashes in a complex financial network is known to be an NP-hard problem, which means that no known algorithm can efficiently find optimal solutions. We experimentally explore a novel approach to this problem by using a D-Wave quantum annealer, benchmarking its performance for attaining a financial equilibrium. To be specific, the equilibrium condition of a nonlinear financial model is embedded into a higher-order unconstrained binary optimization (HUBO) problem, which is then transformed into a spin- Hamiltonian with at most, two-qubit interactions. The problem is thus equivalent to finding the ground state of an interacting spin Hamiltonian, which can be approximated with a quantum annealer. The size of the simulation is mainly constrained by the necessity of a large number of physical qubits representing a logical qubit with the correct connectivity. Our experiment paves the way for the codification of this quantitative macroeconomics problem in quantum annealers.
Active learning is a machine learning method aiming at optimal design for model training. At variance with supervised learning, which labels all samples, active learning provides an improved model by labeling samples with maximal uncertainty according to the estimation model. Here, we propose the use of active learning for efficient quantum information retrieval, which is a crucial task in the design of quantum experiments. Meanwhile, when dealing with large data output, we employ active learning for the sake of classification with minimal cost in fidelity loss. Indeed, labeling only 5% samples, we achieve almost 90% rate estimation. The introduction of active learning methods in the data analysis of quantum experiments will enhance applications of quantum technologies.