On Quantum Annealing Without a Physical Quantum Annealer
- URL: http://arxiv.org/abs/2307.09695v1
- Date: Wed, 19 Jul 2023 00:37:34 GMT
- Title: On Quantum Annealing Without a Physical Quantum Annealer
- Authors: Ameya Bhave, Ajinkya Borle
- Abstract summary: We propose and evaluate a hybrid quantum classical: Quantum Accelerated Simulated Annealing (QASA)
Our simulation results show QASA performing comparably to SA but for a reduced amount of steps.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum annealing is an emerging metaheuristic used for solving combinatorial
optimisation problems. However, hardware based physical quantum annealers are
primarily limited to a single vendor. As an alternative, we can discretise the
quantum annealing process (discretised quantum annealing or DiQA) and use it on
gate-model quantum computers. In this work, we first benchmark DiQA against
simulated annealing for a similar number of steps. We then propose and evaluate
a hybrid quantum classical heuristic: Quantum Accelerated Simulated Annealing
(QASA), where the traditional classical annealing procedure can be sped up with
the use of (relatively) low depth DiQA circuits. This is done by (i) running a
partial annealing scheme with a fraction of the depth of the complete circuit
(ii) sampling the results from the circuit and fitting a Gibbs distribution on
it and (iii) Using the inverse temperature of the Gibbs distribution and the
best sample to initialise simulated annealing (SA). Our simulation results show
QASA performing comparably to SA but for a reduced amount of steps. With the
promising results of our work, we hope to generate interest for potential
future work in the area of fixed-parameter quantum optimisation.
Related papers
- Quantum many-body simulation of finite-temperature systems with sampling a series expansion of a quantum imaginary-time evolution [0.0]
Quantum computers are expected to enable us to simulate large systems at finite temperatures.
We propose a method suitable for quantum devices in this early stage to calculate the thermal-equilibrium expectation value of an observable at finite temperatures.
arXiv Detail & Related papers (2024-09-11T07:38:46Z) - Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
We present a model for parallelizing simulation of quantum circuit executions.
The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
arXiv Detail & Related papers (2024-06-05T17:16:07Z) - Simulating non-unitary dynamics using quantum signal processing with
unitary block encoding [0.0]
We adapt a recent advance in resource-frugal quantum signal processing to explore non-unitary imaginary time evolution on quantum computers.
We test strategies for optimising the circuit depth and the probability of successfully preparing the desired imaginary-time evolved states.
We find that QET-U for non-unitary dynamics is flexible, intuitive and straightforward to use, and suggest ways for delivering quantum advantage in simulation tasks.
arXiv Detail & Related papers (2023-03-10T19:00:33Z) - A self-consistent field approach for the variational quantum
eigensolver: orbital optimization goes adaptive [52.77024349608834]
We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE)
This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
arXiv Detail & Related papers (2022-12-21T23:15:17Z) - Hybrid Quantum Classical Simulations [0.0]
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 incremental communication between a classical central processing unit and a quantum processing unit to solve a problem.
arXiv Detail & Related papers (2022-10-06T10:49:15Z) - Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
We present an approach where the quantum computation is supplemented by a classical result.
Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative.
In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
arXiv Detail & Related papers (2022-09-12T15:47:44Z) - Probing finite-temperature observables in quantum simulators of spin
systems with short-time dynamics [62.997667081978825]
We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality.
We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
arXiv Detail & Related papers (2022-06-03T18:00:02Z) - Benchmarking Amplitude Estimation on a Superconducting Quantum Computer [0.0]
Amplitude Estimation (AE) is a critical subroutine in many quantum algorithms.
Newer methods have reduced the number of operations required on a quantum computer.
It is necessary to continue to benchmark the algorithm's performance on current quantum computers.
arXiv Detail & Related papers (2022-01-18T13:49:40Z) - Open-system modeling of quantum annealing: theory and applications [0.0]
We give derivations and numerical recipes for effective parallel simulation methods.
We consider the weak-coupling limit to an environment and also the case of $1/f$ noise.
arXiv Detail & Related papers (2021-07-15T10:12:41Z) - Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits
at Exascale [57.84751206630535]
We present a modernized version of the Quantum Virtual Machine (TNQVM) which serves as a quantum circuit simulation backend in the e-scale ACCelerator (XACC) framework.
The new version is based on the general purpose, scalable network processing library, ExaTN, and provides multiple quantum circuit simulators.
By combining the portable XACC quantum processors and the scalable ExaTN backend we introduce an end-to-end virtual development environment which can scale from laptops to future exascale platforms.
arXiv Detail & Related papers (2021-04-21T13:26:42Z) - Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
We propose a resource and runtime efficient scheme termed quantum architecture search (QAS)
QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates.
We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
arXiv Detail & Related papers (2020-10-20T12:06:27Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.