☆ 4.7 Article

Parallel quantum annealing

SCIENTIFIC REPORTS (2022)

相关参考文献

注意：仅列出部分参考文献，下载原文获取全部文献信息。

Article Multidisciplinary Sciences

Quantum annealing algorithms for Boolean tensor networks

Elijah Pelofske et al.

Summary: This contribution explores the potential and effectiveness of quantum annealers for solving Boolean tensor network problems. By decomposing the tensor and minimizing the distance between the high-dimensional input and the tensor network representation, the computation can be reduced to a sequence of Boolean matrix factorizations. The study introduces three general algorithms and demonstrates the efficient decomposition of Boolean tensors using parallel quantum annealing.

SCIENTIFIC REPORTS (2022)

添加到收藏夹

Article Engineering, Electrical & Electronic

Massively parallel probabilistic computing with sparse Ising machines

Navid Anjum Aadit et al.

Summary: Solving hard problems using conventional computing architectures is slow and inefficient, but quantum computing is still in early stages. An alternative is to build domain-specific architectures with classical hardware. A sparse Ising machine is reported here, which achieves massive parallelism and is prototyped on a field-programmable gate array. It is significantly faster than standard methods by six orders of magnitude.

NATURE ELECTRONICS (2022)

添加到收藏夹

Article Computer Science, Information Systems

Decomposition Algorithms for Solving NP-hard Problems on a Quantum Annealer

Elijah Pelofske et al.

Summary: This paper investigates a general framework for a decomposition algorithm for NP-hard graph problems aiming to identify an optimal set of vertices. By recursively dividing an instance and proposing several pruning and reduction techniques to speed up the recursive decomposition, the framework is applied to the maximum clique and minimum vertex cover problems.

JOURNAL OF SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY (2021)

添加到收藏夹

Article Computer Science, Artificial Intelligence

Using Machine Learning for Quantum Annealing Accuracy Prediction

Aaron Barbosa et al.

Summary: This paper explores the application of quantum annealers in solving NP-hard problems and utilizes machine learning models to predict the accuracy of the annealer and the difficulty of the problems. By training classification and regression models, it is possible to analyze problem characteristics and the effectiveness of D-Wave in solving them.

ALGORITHMS (2021)

添加到收藏夹

Article Computer Science, Hardware & Architecture

Quantum Computers for High-Performance Computing

Travis S. Humble et al.

Summary: Quantum computing systems are rapidly advancing as powerful tools for solving real-world calculations. Pairing quantum computing systems with modern HPC infrastructure presents challenges but is achievable with current technology.

IEEE MICRO (2021)

添加到收藏夹

Article Multidisciplinary Sciences

Parallel in time dynamics with quantum annealers

Konrad Jalowiecki et al.

SCIENTIFIC REPORTS (2020)

添加到收藏夹

Article Computer Science, Information Systems

Finding Maximum Cliques on the D-Wave Quantum Annealer

Guillaume Chapuis et al.

JOURNAL OF SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY (2019)

添加到收藏夹

Article Multidisciplinary Sciences

Experimental investigation of performance differences between coherent Ising machines and a quantum annealer

Ryan Hamerly et al.

SCIENCE ADVANCES (2019)

添加到收藏夹

Article Computer Science, Software Engineering

Parallel Seed-Based Approach to Multiple Protein Structure Similarities Detection

Guillaume Chapuis et al.

SCIENTIFIC PROGRAMMING (2015)

添加到收藏夹

Proceedings Paper Computer Science, Artificial Intelligence

Category-blind Human Action Recognition: A Practical Recognition System

Wenbo Li et al.

2015 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV) (2015)

添加到收藏夹

Article Physics, Multidisciplinary

Ising formulations of many NP problems

Andrew Lucas

FRONTIERS IN PHYSICS (2014)

添加到收藏夹

Article Genetics & Heredity

Graph-Based Data Selection for the Construction of Genomic Prediction Models

Steven Maenhout et al.

GENETICS (2010)

添加到收藏夹

Article Physics, Multidisciplinary

Colloquium: Quantum annealing and analog quantum computation

Amab Das et al.

REVIEWS OF MODERN PHYSICS (2008)

添加到收藏夹

Article Computer Science, Theory & Methods

A note on the problem of reporting maximal cliques

F. Calzals et al.

THEORETICAL COMPUTER SCIENCE (2008)

添加到收藏夹

Article Computer Science, Theory & Methods

The worst-case time complexity for generating all maximal cliques and computational experiments

Etsuji Tomita et al.

THEORETICAL COMPUTER SCIENCE (2006)

添加到收藏夹

Article Multidisciplinary Sciences

Theory of quantum annealing of an Ising spin glass

GE Santoro et al.

SCIENCE (2002)

添加到收藏夹

Article Multidisciplinary Sciences

A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem

E Farhi et al.

SCIENCE (2001)

添加到收藏夹

© Peeref 2019-2024. All rights reserved.