A central challenge in quantum computing is to identify more computational problems for which utilization of quantum resources can offer significant speedup. Here, we propose a hybrid quantum-classical scheme to tackle the quantum optimal control problem. We show that the most computationally demanding part of gradient-based algorithms, namely, computing the fitness function and its gradient for a control input, can be accomplished by the process of evolution and measurement on a quantum simulator. By posing queries to and receiving answers from the quantum simulator, classical computing devices update the control parameters until an optimal control solution is found. To demonstrate the quantum-classical scheme in experiment, we use a seven-qubit nuclear magnetic resonance system, on which we have succeeded in optimizing state preparation without involving classical computation of the large Hilbert space evolution.
A central challenge in quantum computing is to identify more computational problems for which utilization of quantum resources can offer significant speedup. Here, we propose a hybrid quantum-classical scheme to tackle the quantum optimal control problem. We show that the most computationally demanding part of gradient-based algorithms, namely, computing the fitness function and its gradient for a control input, can be accomplished by the process of evolution and measurement on a quantum simulator. By posing queries to and receiving answers from the quantum simulator, classical computing devices update the control parameters until an optimal control solution is found. To demonstrate the quantum-classical scheme in experiment, we use a seven-qubit nuclear magnetic resonance system, on which we have succeeded in optimizing state preparation without involving classical computation of the large Hilbert space evolution.
We develop a hybrid quantum-classical algorithm to solve an optimal population transfer problem for a molecule subject to a laser pulse. The evolution of the molecular wave function under the laser pulse is simulated on a quantum computer, while the optimal pulse is iteratively shaped via a machine learning (evolutionary) algorithm. A method to encode on the quantum computer the n-electrons wave function is discussed, the circuits accomplishing its quantum simulation are derived and the scalability in terms of number of operations is discussed. Performance on noisy intermediate-scale quantum devices (IBM Q X2) is provided to assess the current technological gap. Furthermore the hybrid algorithm is tested on a quantum emulator to compare performance of the evolutionary algorithm with standard ones. Our results show that such algorithms are able to outperform the optimization with a downhill simplex method and provide performance comparable to more advanced (but quantum-computer unfriendly) algorithms such as Rabitz's or gradient-based optimization.
This paper introduces a novel system for dynamically adjusting the parameters of a quantum-classical hybrid computation, focusing on optimizing both accuracy and computational cost. We propose a gradient-based optimization algorithm to systematically explore the parameter space, effectively balancing these two key factors. The system's adaptability allows for tailored computations across a broad range of problems, offering a significant advancement over traditional fixed parameter approaches. This research addresses a critical challenge in hybrid quantum computing – the need for flexible and efficient parameter control – with a practical and mathematically grounded solution.
Quantum optimal control can play a crucial role in realizing a set of universal quantum logic gates with error rates below the threshold required for fault tolerance. Open-loop quantum optimal control relies on accurate modeling of the quantum system under control and does not scale efficiently with system size. These problems can be avoided in closed-loop quantum optimal control, which utilizes feedback from the system to improve control fidelity. In this paper, two gradient-based closed-loop quantum optimal control algorithms, the hybrid quantum-classical approach (HQCA) described by Li et al. [Phys. Rev. Lett. 118, 150503 (2017)] and the finite-difference (FD) method, are experimentally investigated and compared to the open-loop quantum optimal control utilizing the gradient ascent method. We employ a solid-state ensemble of coupled electron-nuclear spins serving as a two-qubit system. Specific single-qubit and two-qubit state preparation gates are optimized using the closed-loop and open-loop methods. The experimental results demonstrate the implemented closed-loop quantum control outperforms the open-loop control in our system. Furthermore, simulations reveal that HQCA is more robust than the FD method to gradient noise which originates from measurement noise in this experimental setting. On the other hand, the FD method is more robust to control field distortions coming from nonideal hardware.
Computational methods are central to modern physics, yet many problems, especially those involving Quantum Many-Body Systems (QMBSs), remain challenging at scale. The core difficulty of simulating QMBSs is the exponential growth of the solution space with system size. This renders exact treatments intractable and pushes approximate methods to their limits when tackling two- and higher-dimensional systems and long-time dynamics. Quantum computers offer a quantum-native platform for representing and manipulating such systems. Recent algorithmic and technological advancements have enabled experiments on quantum processors in the quantum utility regime, a scale at which exact classical reproduction is no longer feasible. This represents the first step towards realizing quantum advantage, where quantum computers solve specific, practically relevant problems more efficiently than any classical approach. While advancing towards the goal of quantum advantage, useful computations on quantum processors are expected to be realised through hybrid quantum-classical algorithms, which combine quantum experiments and classical computational resources. A prominent example are variational quantum algorithms, where a Parametrized Quantum Circuit (PQC) prepares a trial quantum state whose parameters are iteratively updated by a classical optimisation routine to minimize a target cost function (e.g., the energy of a target Hamiltonian). However, the optimisation of such PQCs is affected by trainability issues, such as barren plateaus in the parameter landscape, which can render the optimisation increasingly difficult for larger system sizes. This motivates the development of novel hybrid approaches overcoming the limits of PQCs. In this thesis, we introduce a new class of approaches based on hybrid Tensor Networks (TNs). A hybrid TN is obtained by integrating quantum states prepared on a quantum processor within TNs -- one of the state-of-the-art approaches for simulating quantum systems. We first show how hybrid TNs can be used for ground-state searches within a variational setting. Then, we further extend the framework to non-variational hybrid TN ansätze for which the quantum tensors are prepared via quantum annealing and subsequently post-processed by classical TNs. In the context of quantum machine learning, which also relies on PQCs, we further investigate heuristic best practices that mitigate the same exponential concentration effects in kernel-based models for anomaly detection. Another class of hybrid algorithms are quantum error-mitigation workflows, where classical post-processing is used to reconstruct expectation values from noise-affected circuit executions. Such methods generally feature a trade-off between the bias and the variance: the price to pay for mitigating noise in a bias-free fashion is that the number of measurements usually grows exponentially with the depth of the circuit in order to achieve a fixed accuracy. In this thesis, we develop a low-resource error-mitigation strategy that reduces the measurement overhead in practical digital Hamiltonian-simulation workflows. We apply this method to Trotterized dynamics in a lattice-gauge-theory model, enabling the extraction of expectation values with improved accuracy at time-scales that allow the observation of post-collision scattering dynamics.
Working on quantum systems entail different interests, for example, working on fundamental \nunderstanding of quantum systems also lay foundation for better quantum computation \ntechniques. A test for whether a system is behaving quantum mechanically or \nclassically is devised by Leggett and Garg in form of inequalities, called Leggett-Garg Inequalities \n(LGI). Such Inequalities are violated by a system whose evolution is governed \nby quantum mechanics. A precise experiment to violate LGIs require a guarantee that the \nmeasurement does not affect the system or its future dynamics. These Inequalities were \nproposed for dichotomic systems,systems which can have two outcomes. Here we present \nan LG experiment on a three-level quantum system, which theoretically have larger quantum \nupper bound than that of a two-level quantum system. This larger violation also \nprovides a bigger buffer to taking in account of the various experimental imperfections. \nPerforming a quantum computing task requires precise level of control to initialize, \nperform and measure the quantum system. With increasing size of the quantum processor \nthe challenge is to maintain optimal control. Nuclear Magnetic Resonance (NMR) has \nalways been a very faithful test-bed for quantum processing ideas. In NMR, we perform \nRadio Frequency (RF) pulses to control and steer the system to the desired state. Most \nused method to derive the exact frequency and amplitude of these pulses for a given \ntask is based on gradient. Although systematic, one have to simulate these pulses on \na classical computer first, which makes the task very inefficient. We report a a way of \nperforming optimization with a hybrid quantum-classical scheme. This scheme helps us \nperform classically harder computational tasks on the quantum processor. We optimize \npulses which drive our system from 7-coherence state to 12-coherence state on a 12-qubit \nNMR processor. \nElectron Spin Resonance (ESR) employs the same techniques as of NMR but having \nadvantage in larger polarization compared to later. Although this does not imply better \ncontrol, cause the frequency at which pulses are required to control an ESR system fall into \nmicrowave region. Microwave frequency are harder to control electronically, thus making \nit harder for performing ESR quantum computing. The hybrid scheme used in NMR \nexperiment relies on some ideal pulses which are needed to be optimized classically. We \nalleviate this requirement by using finite difference method of calculating gradient. We \ncompare these methods with the earlier methods to show the superiority of such a scheme. \nState-to-state transfer pulses are sufficient for most of the quantum computing task, \nbut, an universal quantum information implementation requires state independent pulses. \nThe techniques used in optimizing state-to-state pulses can be modified to optimize for a \nstate independent pulse. We show that this methods scale polynomially with the number \nof qubits and is general in terms of its implementation. We further reduce the resource \nrequirement by using a NMR related implementation.
The increasing complexity of real-world optimization problems highlights the importance of this research since classical algorithms are unable to provide efficient answers in these cases. Innovative methods for fast and scalable resolution of nonlinear optimization problems are required because these problems are prevalent in many fields. The potential for quantum computing to speed up optimization processes and overcome classical limitations is great, owing to its superposition principles and intrinsic parallelism. The integration of quantum algorithms (I-QA) into real-world applications, however, will not always be smooth sailing. There are significant challenges associated with preserving quantum coherence, correcting errors, and working within hardware limits. To enable the simultaneous exploration of solution spaces through quantum parallelism, this research proposes the Hybrid Quantum Gradient -Classical Approach (HQG-CA), which makes use of parameterized quantum circuits to represent probable solutions. Additionally, improves convergence rates through applying quantum gradient information to direct optimization in the quantum state space. Optimization of portfolios in finance, adjustment of model parameters in machine learning, and optimization of routes in logistics are a few examples of the many industries that find use for HQG-CA. These applications are explored in this abstract, which highlights the revolutionary potential of HQG-CA to solve optimization problems in the real world. The effectiveness of HQG-CA is assessed through a thorough simulation experiment. Performance measures such algorithmic speedup, solution accuracy, and scalability are discussed, which is based on extensive testing and comparison with classical alternatives. The present research provides a comprehensive evaluation of HQG-CA's potential for tackling nonlinear optimization problems.