Vertex coloring of graphs via phase dynamics of coupled oscillatory networks
|
journal
|
April 2017 |
A deceptive step towards quantum speedup detection
|
journal
|
July 2018 |
The pitfalls of planar spin-glass benchmarks: raising the bar for quantum annealers (again)
|
journal
|
July 2017 |
Gaussian optical Ising machines
|
journal
|
October 2017 |
Quantum Optics
|
journal
|
May 1995 |
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations
|
journal
|
July 2008 |
Quantum optics
|
journal
|
September 1975 |
Evidence for quantum annealing with more than one hundred qubits
|
journal
|
February 2014 |
Application of statistical mechanics to NP-complete problems in combinatorial optimisation
|
journal
|
June 1986 |
A Coherent Ising Machine Based On Degenerate Optical Parametric Oscillators
|
text
|
January 2013 |
Gaussian Optical Ising Machines
|
text
|
January 2017 |
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
|
journal
|
November 1995 |
Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
|
journal
|
October 2010 |
Adiabatic quantum programming: minor embedding with hard faults
|
journal
|
November 2013 |
Solvable Model of a Spin-Glass
|
journal
|
December 1975 |
Neuromorphic photonic networks using silicon photonic weight banks
|
journal
|
August 2017 |
Efficient Analog Circuits for Boolean Satisfiability
|
preprint
|
January 2016 |
Quantum annealing in the transverse Ising model
|
journal
|
November 1998 |
Defining and detecting quantum speedup
|
journal
|
June 2014 |
Random MAX SAT, random MAX CUT, and their phase transitions
|
journal
|
January 2004 |
A case study in programming a quantum annealer for hard operational planning problems
|
text
|
January 2014 |
Topological defect formation in 1D and 2D spin chains realized by network of optical parametric oscillators
|
text
|
January 2016 |
Uncertain behaviours of integrated circuits improve computational performance
|
journal
|
November 2015 |
Network of time-multiplexed optical parametric oscillators as a coherent Ising machine
|
journal
|
October 2014 |
Quantum optics
|
journal
|
August 1971 |
A fully programmable 100-spin coherent Ising machine with all-to-all connections
|
journal
|
October 2016 |
A coherent Ising machine for 2000-node optimization problems
|
journal
|
October 2016 |
On the computational complexity of Ising spin glass models
|
journal
|
October 1982 |
Strengths and weaknesses of weak-strong cluster problems: A detailed overview of state-of-the-art classical heuristics vs quantum approaches
|
text
|
January 2016 |
Optimization using quantum mechanics: quantum annealing through adiabatic evolution
|
journal
|
May 2008 |
Minor-Embedding in Adiabatic Quantum Computation: I. The Parameter Setting Problem
|
text
|
January 2008 |
Intrinsic optimization using stochastic nanomagnets
|
journal
|
March 2017 |
Optimization using quantum mechanics: quantum annealing through adiabatic evolution
|
journal
|
August 2006 |
Computational Principle and Performance Evaluation of Coherent Ising Machine Based on Degenerate Optical Parametric Oscillator Network
|
journal
|
April 2016 |
Fast clique minor generation in Chimera qubit connectivity graphs
|
journal
|
October 2015 |
Deep learning with coherent nanophotonic circuits
|
journal
|
June 2017 |
Truncated Wigner function theory of coherent Ising machines based on degenerate optical parametric oscillator network
|
text
|
January 2016 |
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
|
journal
|
April 2001 |
Strengths and weaknesses of weak-strong cluster problems: A detailed overview of state-of-the-art classical heuristics versus quantum approaches
|
journal
|
August 2016 |
Production of squeezed states in a degenerate parametric amplifier
|
journal
|
November 1981 |
Large-scale Ising spin network based on degenerate optical parametric oscillators
|
text
|
January 2016 |
Large-scale Ising spin network based on degenerate optical parametric oscillators
|
journal
|
April 2016 |
Breakout Local Search for the Max-Cutproblem
|
journal
|
March 2013 |
Reducibility among Combinatorial Problems
|
book
|
January 1972 |
Theory of Quantum Annealing of an Ising Spin Glass
|
journal
|
March 2002 |
Hybrid quantum annealing via molecular dynamics
|
journal
|
April 2021 |
A 16-bit Coherent Ising Machine for One-Dimensional Ring and Cubic Graph Problems
|
text
|
January 2016 |
Quantum Speedup by Quantum Annealing
|
journal
|
July 2012 |
Topological defect formation in 1D and 2D spin chains realized by network of optical parametric oscillators
|
journal
|
September 2016 |
Quantum Optics
|
book
|
January 1994 |
A case study in programming a quantum annealer for hard operational planning problems
|
journal
|
December 2014 |
Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
|
text
|
January 2010 |
Quantum Optics
|
book
|
January 2008 |
Generation of Squeezed States by Parametric Down Conversion
|
journal
|
November 1986 |
Random MAX SAT, Random MAX CUT, and Their Phase Transitions
|
preprint
|
January 2003 |
Deep Learning with Coherent Nanophotonic Circuits
|
text
|
January 2016 |
Coherent Ising machine based on degenerate optical parametric oscillators
|
journal
|
December 2013 |
A 16-bit Coherent Ising Machine for One-Dimensional Ring and Cubic Graph Problems
|
journal
|
September 2016 |
Optimization by Simulated Annealing
|
journal
|
May 1983 |
Quantum Optics
|
journal
|
June 1995 |
Coherent Ising machines—optical neural networks operating at the quantum limit
|
journal
|
December 2017 |
Efficient Analog Circuits for Boolean Satisfiability
|
journal
|
January 2018 |
A deceptive step towards quantum speedup detection
|
text
|
January 2017 |
Truncated Wigner theory of coherent Ising machines based on degenerate optical parametric oscillator network
|
journal
|
July 2016 |
Defects in Quantum Computers
|
journal
|
March 2018 |
Minor-embedding in adiabatic quantum computation: I. The parameter setting problem
|
journal
|
September 2008 |
Vertex coloring of graphs via phase dynamics of coupled oscillatory networks
|
journal
|
April 2017 |
Neuromorphic photonic networks using silicon photonic weight banks
|
journal
|
August 2017 |
Uncertain behaviours of integrated circuits improve computational performance
|
journal
|
November 2015 |
On the computational complexity of Ising spin glass models
|
journal
|
October 1982 |
The pitfalls of planar spin-glass benchmarks: raising the bar for quantum annealers (again)
|
journal
|
July 2017 |
Quantum dynamics of the parametric oscillator
|
journal
|
June 1991 |
Theory of Quantum Annealing of an Ising Spin Glass
|
journal
|
March 2002 |
Optimization by Simulated Annealing
|
journal
|
May 1983 |
A coherent Ising machine for 2000-node optimization problems
|
journal
|
October 2016 |
A fully programmable 100-spin coherent Ising machine with all-to-all connections
|
journal
|
October 2016 |
10 GHz clock time-multiplexed degenerate optical parametric oscillators for a photonic Ising spin network
|
journal
|
January 2016 |
Computational Principle and Performance Evaluation of Coherent Ising Machine Based on Degenerate Optical Parametric Oscillator Network
|
journal
|
April 2016 |
Quantum Speedup by Quantum Annealing
|
text
|
January 2012 |
A Coherent Ising Machine Based On Degenerate Optical Parametric Oscillators
|
text
|
January 2013 |
A practical heuristic for finding graph minors
|
preprint
|
January 2014 |
Topological defect formation in 1D and 2D spin chains realized by network of optical parametric oscillators
|
text
|
January 2016 |
Truncated Wigner function theory of coherent Ising machines based on degenerate optical parametric oscillator network
|
text
|
January 2016 |
Demonstration of a scaling advantage for a quantum annealer over simulated annealing
|
text
|
January 2017 |
Gaussian Optical Ising Machines
|
text
|
January 2017 |
Defects in Quantum Computers
|
text
|
January 2017 |
Random MAX SAT, Random MAX CUT, and Their Phase Transitions
|
preprint
|
January 2003 |
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
|
text
|
January 2001 |