Computational Phase Transitions: Benchmarking Ising Machines and Quantum Optimisers

• URL: http://arxiv.org/abs/2009.05579v2
• Date: Wed, 30 Dec 2020 12:36:37 GMT
• Title: Computational Phase Transitions: Benchmarking Ising Machines and Quantum Optimisers
• Authors: Hariphan Philathong and Vishwa Akshay and Ksenia Samburskaya and Jacob Biamonte
• Abstract summary: Hardest instances appear to be well-concentrated in a narrow region, with a control parameter allowing uniform random distributions. It has been established that one could observe a computational phase transition in a distribution produced from coherent Ising machine(s)
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: While there are various approaches to benchmark physical processors, recent findings have focused on computational phase transitions. This is due to several factors. Importantly, the hardest instances appear to be well-concentrated in a narrow region, with a control parameter allowing uniform random distributions of problem instances with similar computational challenge. It has been established that one could observe a computational phase transition in a distribution produced from coherent Ising machine(s). In terms of quantum approximate optimisation, the ability for the quantum algorithm to function depends critically on the ratio of a problems constraint to variable ratio (called density). The critical density dependence on performance resulted in what was called, reachability deficits. In this perspective we recall the background needed to understand how to apply computational phase transitions in various bench-marking tasks and we survey several such contemporary findings.

Related papers

• Evaluation of phase shifts for non-relativistic elastic scattering using quantum computers [39.58317527488534]
  This work reports the development of an algorithm that makes it possible to obtain phase shifts for generic non-relativistic elastic scattering processes on a quantum computer.
  arXiv  Detail & Related papers  (2024-07-04T21:11:05Z)
• Predicting Probabilities of Error to Combine Quantization and Early Exiting: QuEE [68.6018458996143]
  We propose a more general dynamic network that can combine both quantization and early exit dynamic network: QuEE. Our algorithm can be seen as a form of soft early exiting or input-dependent compression. The crucial factor of our approach is accurate prediction of the potential accuracy improvement achievable through further computation.
  arXiv  Detail & Related papers  (2024-06-20T15:25:13Z)
• Unveiling quantum phase transitions from traps in variational quantum algorithms [0.0]
  We introduce a hybrid algorithm that combines quantum optimization with classical machine learning. We use LASSO for identifying conventional phase transitions and the Transformer model for topological transitions. Our protocol significantly enhances efficiency and precision, opening new avenues in the integration of quantum computing and machine learning.
  arXiv  Detail & Related papers  (2024-05-14T09:01:41Z)
• Robust Experimental Signatures of Phase Transitions in the Variational Quantum Eigensolver [0.0]
  Variational Quantum Eigensolver (VQE) is widely considered to be a promising candidate for a quantum-classical algorithm. In this work, we use several IBM devices to explore a finite-size spin model with multiple phase-like' regions.
  arXiv  Detail & Related papers  (2024-02-29T08:34:11Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Phase transition in Random Circuit Sampling [0.6361671146004758]
  Incoherent noise is an outstanding challenge to fully leverage the computation power of near-term quantum processors. We show that there are two phase transitions observable with XEB, which we explain theoretically with a statistical model. Our work establishes the existence of transitions to a stable computationally complex phase that is reachable with current quantum processors.
  arXiv  Detail & Related papers  (2023-04-21T16:41:13Z)
• Majorization-based benchmark of the complexity of quantum processors [105.54048699217668]
  We numerically simulate and characterize the operation of various quantum processors. We identify and assess quantum complexity by comparing the performance of each device against benchmark lines. We find that the majorization-based benchmark holds as long as the circuits' output states have, on average, high purity.
  arXiv  Detail & Related papers  (2023-04-10T23:01:10Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Quantum Computational Phase Transition in Combinatorial Problems [0.966840768820136]
  Quantum Approximate Optimization algorithm (QAOA) aims to search for approximate solutions to discrete optimization problems with near-term quantum computers. We identify a computational phase transition of QAOA when solving hard problems such as SAT. We show that the high problem density region, which limits QAOA's performance in hard optimization problems, is actually a good place to utilize QAOA.
  arXiv  Detail & Related papers  (2021-09-27T20:46:52Z)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)
• On estimating the entropy of shallow circuit outputs [49.1574468325115]
  Estimating the entropy of probability distributions and quantum states is a fundamental task in information processing. We show that entropy estimation for distributions or states produced by either log-depth circuits or constant-depth circuits with gates of bounded fan-in and unbounded fan-out is at least as hard as the Learning with Errors problem.
  arXiv  Detail & Related papers  (2020-02-27T15:32:08Z)

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.