2017 International Joint Conference on Neural Networks (IJCNN) 2017
DOI: 10.1109/ijcnn.2017.7966350
|View full text |Cite
|
Sign up to set email alerts
|

Quadratic Unconstrained Binary Optimization (QUBO) on neuromorphic computing system

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 23 publications
(10 citation statements)
references
References 14 publications
0
10
0
Order By: Relevance
“…When implemented on neuromorphic architectures, these algorithms promise speed and efficiency gains by exploiting fine-grain parallelism and event-based computation. Examples include computational primitives, such as sorting, max, min, and median operations [70], a wide range of graph algorithms [71]- [74], NP-complete/hard problems, such as constraint satisfaction [75], boolean satisfiability [76], dynamic programming [77], and quadratic unconstrained binary optimization [78], [79], and novel Turing-complete computational frameworks, such as Stick [80] and SN P [81].…”
Section: C O M P U T I N G W I T H T I M Ementioning
confidence: 99%
“…When implemented on neuromorphic architectures, these algorithms promise speed and efficiency gains by exploiting fine-grain parallelism and event-based computation. Examples include computational primitives, such as sorting, max, min, and median operations [70], a wide range of graph algorithms [71]- [74], NP-complete/hard problems, such as constraint satisfaction [75], boolean satisfiability [76], dynamic programming [77], and quadratic unconstrained binary optimization [78], [79], and novel Turing-complete computational frameworks, such as Stick [80] and SN P [81].…”
Section: C O M P U T I N G W I T H T I M Ementioning
confidence: 99%
“…Neuromorphic computing has also been used to find approximate solutions to NP-complete problems: several studies have shown that neuromorphic systems can achieve a similar performance in terms of time-to-solution and solution accuracy when compared with other conventional approaches, which use CPUs and GPUs to approximately solve NP-complete problems. For instance, Alom and co-workers used the IBM TrueNorth Neurosynaptic system to approximately solve the quadratic unconstrained binary optimization (QUBO) problem 96 . Mniszewski 97 converted the NP-complete graph partitioning problem to the QUBO problem and used the IBM TrueNorth system to solve it approximately: in some cases, neuromorphic solutions were more accurate than the solutions returned by the D-Wave quantum computer.…”
Section: Box 1 | Spiking Neural Networkmentioning
confidence: 99%
“…QUBO is an NP-hard problem, used to solve many applications and suitable to algorithms implementation in quantum annealing (Alom et al 2017;Tran et al 2016). Adiabatic quantum computers can aid to solve a QUBO problem, using the quantum mechanical process called quantum annealing, therefore being able to solve any NPhard problem like graph coloring (Date et al 2019b).…”
Section: Quadratic Unconstrained Binary Optimizationmentioning
confidence: 99%