[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Hastings, 2018 - Google Patents

A short path quantum algorithm for exact optimization

Hastings, 2018

View PDF
Document ID
11030003399675292993
Author
Hastings M
Publication year
Publication venue
Quantum

External Links

Snippet

We give a quantum algorithm to exactly solve certain problems in combinatorial optimization, including weighted MAX-2-SAT as well as problems where the objective function is a weighted sum of products of Ising variables, all terms of the same degree $ D $; …
Continue reading at quantum-journal.org (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/12—Computer systems based on biological models using genetic models
    • G06N3/126—Genetic algorithms, i.e. information processing using digital simulations of the genetic system
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G06N99/002—Quantum computers, i.e. information processing by using quantum superposition, coherence, decoherence, entanglement, nonlocality, teleportation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/02—Computer systems based on biological models using neural network models
    • G06N3/08—Learning methods
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/18—Complex mathematical operations for evaluating statistical data, e.g. average values, frequency distributions, probability functions, regression analysis
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G06N5/02—Knowledge representation
    • G06N5/022—Knowledge engineering, knowledge acquisition
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N7/00—Computer systems based on specific mathematical models
    • G06N7/005—Probabilistic networks

Similar Documents

Publication Publication Date Title
US12033027B2 (en) Short path quantum procedures for solving combinatorial optimization problems
Blekos et al. A review on quantum approximate optimization algorithm and its variants
Macridin et al. Digital quantum computation of fermion-boson interacting systems
Van Dam et al. How powerful is adiabatic quantum computation?
US10417574B2 (en) Embedding electronic structure in controllable quantum systems
CA3102290C (en) Preparing superpositions of computational basis states on a quantum computer
Seeley et al. The Bravyi-Kitaev transformation for quantum computation of electronic structure
Hastings A short path quantum algorithm for exact optimization
US11640549B2 (en) Variational quantum Gibbs state preparation
Cho et al. Quantum computation: Algorithms and applications
Gharibian et al. Approximation algorithms for QMA-complete problems
Caha et al. Clocks in Feynman's computer and Kitaev's local Hamiltonian: Bias, gaps, idling, and pulse tuning
De Brugière et al. Gaussian elimination versus greedy methods for the synthesis of linear reversible circuits
Parekh et al. Beating random assignment for approximating quantum 2-local hamiltonian problems
Nghiem et al. Quantum algorithm for estimating largest eigenvalues
Sankar et al. Benchmark study of quantum algorithms for combinatorial optimization: Unitary versus dissipative
Whitfield et al. Quantum computing 2022
Robnik et al. Microcanonical Hamiltonian Monte Carlo
Roch et al. Cross entropy hyperparameter optimization for constrained problem Hamiltonians applied to QAOA
Dierckx et al. Fermionic quasifree states and maps in information theory
Chen et al. Quantum imaginary-time control for accelerating the ground-state preparation
Wu et al. Bayesian machine learning for Boltzmann machine in quantum-enhanced feature spaces
Hastings The short path algorithm applied to a toy model
Suzuki et al. Quantum annealing
Kulshrestha A Machine Learning Approach to Improve Scalability and Robustness of Variational Quantum Circuits