Related papers: Reexamining classical and quantum models for the D…
We review the recent quantum advantage experiments by IBM, D-Wave, and Google, focusing on cases where efficient classical simulations of the experiment were demonstrated or attempted using tensor network methods. We assess the strengths…
We report on two major hybrid applications of quantum computing, namely, the quantum approximate optimisation algorithm (QAOA) and the variational quantum eigensolver (VQE). Both are hybrid quantum classical algorithms as they require…
Quantum computation offers exciting new possibilities for statistics. This paper explores the use of the D-Wave machine, a specialized type of quantum computer, which performs quantum annealing. A general description of quantum annealing…
We introduce the reinforcement quantum annealing (RQA) scheme in which an intelligent agent interacts with a quantum annealer that plays the stochastic environment role of learning automata and tries to iteratively find better Ising…
We present a comparison study of state-of-the-art classical optimisation methods to a D-Wave 2000Q quantum annealer for the planning of Earth observation missions. The problem is to acquire high value images while obeying the attitude…
Deterministic quantum computation with one quantum bit (DQC1) is a model of quantum computing where the input restricted to containing a single qubit in a pure state and with all other qubits in a completely-mixed state, with only a single…
Restricted Boltzmann Machines trained with different numbers of iterations were used to provide a diverse set of energy functions each containing many local valleys (LVs) with different energies, widths, escape barrier heights, etc. They…
Variational Quantum Eigensolver (VQE) provides a lucrative platform to determine molecular energetics in near-term quantum devices. While the VQE is traditionally tailored to determine the ground state wavefunction with the underlying…
The availability of quantum annealing devices with hundreds of qubits has made the experimental demonstration of a quantum speedup for optimization problems a coveted, albeit elusive goal. Going beyond earlier studies of random Ising…
We consider a k=0 Friedman-Robertson-Walker (FRW) model within loop quantum cosmology (LQC) and explore the issue of its semiclassical limit. The model is exactly solvable and allows us to construct analytical (Gaussian) coherent-state…
We present a hybrid classical-quantum computing paradigm where the quantum part strictly runs within the coherence time of a quantum annealer, a method we call variational coherent quantum annealing (VCQA). It involves optimizing the…
Coherent states offer a promising path for near-term quantum computing due to their inherent protection against bit-flip noise. However, their large photon numbers can be challenging for numerical simulation. This paper introduces an…
A finite length ferromagnetic chain with opposite spin polarisation imposed at its two ends is one of the simplest frustrated spin models. In the clean classical limit the domain wall inserted on account of the boundary conditions resides…
Quantum annealing is a novel type of analog computation that aims to use quantum mechanical fluctuations to search for optimal solutions of Ising problems. Quantum annealing in the Transverse Ising model, implemented on D-Wave QPUs, are…
Variational quantum algorithms (VQAs) are promising tools for demonstrating quantum utility on near-term quantum hardware, with applications in optimisation, quantum simulation, and machine learning. While researchers have studied how easy…
The development of quantum-classical hybrid (QCH) algorithms is critical to achieve state-of-the-art computational models. A QCH variational autoencoder (QVAE) was introduced in Ref. [1] by some of the authors of this paper. QVAE consists…
We show strong positive spatial correlations in the qubits of a D-Wave 2000Q quantum annealing chip that are connected to qubits outside their own unit cell. By simulating the dynamics of spin networks, we then show that correlation between…
Using quantum devices supported by classical computational resources is a promising approach to quantum-enabled computation. One example of such a hybrid quantum-classical approach is the variational quantum eigensolver (VQE) built to…
Ground state counting plays an important role in several applications in science and engineering, from estimating residual entropy in physical systems, to bounding engineering reliability and solving combinatorial counting problems. While…
Quantum annealing is an innovative idea and method for avoiding the increase of the calculation cost of the combinatorial optimization problem. Since the combinatorial optimization problems are ubiquitous, quantum annealing machine with…