Phase-space simulations of feedback coherent Ising machines
- URL: http://arxiv.org/abs/2105.04190v2
- Date: Tue, 11 Jan 2022 09:14:55 GMT
- Title: Phase-space simulations of feedback coherent Ising machines
- Authors: Simon Kiesewetter, Peter D Drummond (Swinburne University of
Technology, Melbourne, Australia)
- Abstract summary: A new technique is demonstrated for carrying out exact positive-P phase-space simulations of the coherent Ising machine quantum computer.
Results for success rates are obtained using this scalable phase-space algorithm for quantum simulations of quantum feedback devices.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: A new technique is demonstrated for carrying out exact positive-P phase-space
simulations of the coherent Ising machine quantum computer. By suitable design
of the coupling matrix, general hard optimization problems can be solved. Here,
computational quantum simulations of a feedback type of photonic parametric
network are carried out, which is the implementation of the coherent Ising
machine. Results for success rates are obtained using this scalable phase-space
algorithm for quantum simulations of quantum feedback devices.
Related papers
- Compact quantum algorithms that can potentially maintain quantum advantage for solving time-dependent differential equations [0.0]
We present algorithms for solving time-dependent PDEs governing fluid flow problems.
We build on an idea based on linear combination of unitaries to simulate non-unitary, non-Hermitian quantum systems.
These algorithms lead to low-depth quantum circuits that protect quantum advantage.
arXiv Detail & Related papers (2024-05-16T02:14:58Z) - Quantum Tunneling: From Theory to Error-Mitigated Quantum Simulation [49.1574468325115]
This study presents the theoretical background and the hardware aware circuit implementation of a quantum tunneling simulation.
We use error mitigation techniques (ZNE and REM) and multiprogramming of the quantum chip for solving the hardware under-utilization problem.
arXiv Detail & Related papers (2024-04-10T14:27:07Z) - Tensor Networks or Decision Diagrams? Guidelines for Classical Quantum
Circuit Simulation [65.93830818469833]
tensor networks and decision diagrams have independently been developed with differing perspectives, terminologies, and backgrounds in mind.
We consider how these techniques approach classical quantum circuit simulation, and examine their (dis)similarities with regard to their most applicable abstraction level.
We provide guidelines for when to better use tensor networks and when to better use decision diagrams in classical quantum circuit simulation.
arXiv Detail & Related papers (2023-02-13T19:00:00Z) - Evaluating the Convergence of Tabu Enhanced Hybrid Quantum Optimization [58.720142291102135]
We introduce the Tabu Enhanced Hybrid Quantum Optimization metaheuristic approach useful for optimization problem solving on a quantum hardware.
We address the theoretical convergence of the proposed scheme from the viewpoint of the collisions in the object which stores the tabu states, based on the Ising model.
arXiv Detail & Related papers (2022-09-05T07:23:03Z) - Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs)
We propose a new protocol for approximating TN states using realistic quantum circuits.
Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
arXiv Detail & Related papers (2022-09-01T17:08:41Z) - Low-rank tensor decompositions of quantum circuits [14.531461873576449]
We show how MPOs can be used to express certain quantum states, quantum gates, and entire quantum circuits as low-rank tensors.
This enables the analysis and simulation of complex quantum circuits on classical computers.
arXiv Detail & Related papers (2022-05-19T22:09:15Z) - Recompilation-enhanced simulation of electron-phonon dynamics on IBM
Quantum computers [62.997667081978825]
We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems.
We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling.
Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
arXiv Detail & Related papers (2022-02-16T19:00:00Z) - QuOp_MPI: a framework for parallel simulation of quantum variational
algorithms [0.0]
QuOp_MPI is a Python package designed for parallel simulation of quantum variational algorithms.
It presents an object-orientated approach to quantum variational algorithm design.
arXiv Detail & Related papers (2021-10-08T08:26:09Z) - Variational Quantum Anomaly Detection: Unsupervised mapping of phase
diagrams on a physical quantum computer [0.0]
We propose variational quantum anomaly detection, an unsupervised quantum machine learning algorithm to analyze quantum data from quantum simulation.
The algorithm is used to extract the phase diagram of a system with no prior physical knowledge.
We show that it can be used with readily accessible devices nowadays and perform the algorithm on a real quantum computer.
arXiv Detail & Related papers (2021-06-15T06:54:47Z) - Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
We present a constructive algorithm for generating quantum circuits with time-independent depth.
We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model.
In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
arXiv Detail & Related papers (2021-04-01T19:06:00Z) - Randomizing multi-product formulas for Hamiltonian simulation [2.2049183478692584]
We introduce a scheme for quantum simulation that unites the advantages of randomized compiling on the one hand and higher-order multi-product formulas on the other.
Our framework reduces the circuit depth by circumventing the need for oblivious amplitude amplification.
Our algorithms achieve a simulation error that shrinks exponentially with the circuit depth.
arXiv Detail & Related papers (2021-01-19T19:00:23Z)
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.