A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Benchmarking Quantum Annealing Controls with Portfolio Optimization
[article]
2020
arXiv
pre-print
Preserved Fulltext
Here we use portfolio optimization as a case study by which to benchmark quantum annealing controls and their relative effects on computational accuracy. ...
Quantum annealing offers a novel approach to finding the optimal solutions for a variety of computational problems, where the quantum annealing controls influence the observed performance and error mechanisms ...
This research used quantum computing resources of the Oak Ridge Leadership Computing Facility, which is a DOE Office of Science User Facility supported under Contract DE-AC05-00OR22725. ...
arXiv:2007.03005v1
fatcat:xgtcvhdx5rayhgeojqxy7crdtq
Benchmarking embedded chain breaking in quantum annealing
2021
Quantum Science and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Our results demonstrate how to use characterization of the quantum annealing hardware to tune the embedded Hamiltonian and remove computational errors. ...
We further correlate the physical location of chain breaks in the quantum annealing hardware with the underlying embedding technique and use these localized rates in a tailored post-processing strategies ...
This research used resources of the Oak Ridge Leadership Computing Facility, which is a DOE Office of Science User Facilities supported by the Oak Ridge National Laboratory under Contract DE-AC05-00OR22725 ...
doi:10.1088/2058-9565/ac26d2
fatcat:6zoweenmzbejlfr7qnvbtwg6j4
Benchmarking Embedded Chain Breaking in Quantum Annealing
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Our results demonstrate how to use characterization of the quantum annealing hardware to tune the embedded Hamiltonian and remove computational errors. ...
We further correlate the physical location of chain breaks in the quantum annealing hardware with the underlying embedding technique and use these localized rates in a tailored post-processing strategies ...
However, there are limits to how well the dynamics of quantum annealers can be be controlled and these practical considerations lead to constraints on quantum computational performance [13, 16] . ...
arXiv:2104.03258v1
fatcat:bsecugvcs5ht3ibr4sqrs23o5u
Benchmarking the Quantum Approximate Optimization Algorithm
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2020 accepted arXiv:1907.02359v2 fatcat:zno26bqt4raafnpgxzrg5ci4u4
Additionally, data obtained from the D-Wave 2000Q quantum annealer is used for comparison, and it is found that the D-Wave machine outperforms the quantum approximate optimization algorithm executed on ...
The quantum approximate optimization algorithm is executed on quantum computer simulators and on the IBM Q Experience. ...
In practice, quantum annealing is performed with finite t a . In this paper, we use the D-Wave 2000Q to perform the quantum annealing experiments.
D. ...
arXiv:1907.02359v1
fatcat:lempdnocmjbwljuj52btckkn7u
Garden optimization problems for benchmarking quantum annealers
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We benchmark the 5000+ qubit system Advantage coupled with the Hybrid Solver Service 2 released by D-Wave Systems Inc. in September 2020 by using a new class of optimization problems called garden optimization ...
However, we also show that the solvers based on the 2000+ qubit system DW2000Q sometimes produce more favourable results if they can solve the problems. ...
As the complexity of commercially available quantum annealers increases, so does the need for methods to systematically benchmark these systems, using problems which do not become obsolete as quantum annealers ...
arXiv:2101.10827v1
fatcat:5wn2iqhx2vdubljmh3jumxlaky
Benchmarking Quantum Hardware for Training of Fully Visible Boltzmann Machines
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
While similar to simulated annealing, QA relies on quantum, rather than thermal, effects to explore complex search spaces. ...
Quantum annealing (QA) is a hardware-based heuristic optimization and sampling method applicable to discrete undirected graphical models. ...
We tested annealed learning using gradient step sizes decaying as η t = η 0 /[(t/200) + 1]. 9 Both CD and PCD used 10,000 blocked Gibbs updates at each parameter update. ...
arXiv:1611.04528v1
fatcat:6rt5auq4b5capafe5qjc5hsvai
Benchmarking a quantum annealing processor with the time-to-target metric
[article]
2015
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In the evaluation of quantum annealers, metrics based on ground state success rates have two major drawbacks. ...
Second, results are heavily dependent on the effects of analog noise on the quantum processors, which is an engineering issue that complicates the study of the underlying quantum annealing algorithm. ...
A note on quantum speedup Rønnow et al. ...
arXiv:1508.05087v1
fatcat:esocpzklcbcfrm5uors33y5ogy
Influence of Different 3SAT-to-QUBO Transformations on the Solution Quality of Quantum Annealing: A Benchmark Study
[article]
2023
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2023; you can also visit the original URL.
The file type is application/pdf.
Other Versions
2023
Proceedings of the Companion Conference on Genetic and Evolutionary Computation
unpublished
doi:10.1145/3583133.3596330 fatcat:2ueu6aqtxnewtd3wnn5pipe2r4
doi:10.1145/3583133.3596330 fatcat:2ueu6aqtxnewtd3wnn5pipe2r4
To solve 3SAT instances on quantum annealers they need to be transformed to an instance of Quadratic Unconstrained Binary Optimization (QUBO). ...
We show that the choice of QUBO transformation can significantly impact the number of correct solutions the quantum annealer returns. ...
ACKNOWLEDGMENTS This paper was partially funded by the German Federal Ministry of Education and Research through the funding program "quantum technologies -from basic research to market" (contract number ...
arXiv:2305.00720v1
fatcat:slchmq55qfc3tlcnq5sv2xqmy4
PyQBench: a Python library for benchmarking gate-based quantum computers
[article]
2023
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2023; you can also visit the original URL.
The file type is application/pdf.
We introduce PyQBench, an innovative open-source framework for benchmarking gate-based quantum computers. ...
PyQBench offers a simplified, ready-to-use, command line interface (CLI) for running benchmarks using a predefined parametrized Fourier family of measurements. ...
Acknowledgements This work is supported by the project "Near-term quantum computers Challenges, optimal implementations and applications" under Grant Number POIR.04.04.00-00-17C1/18-00, which is carried ...
arXiv:2304.00045v1
fatcat:krar5ahlbjbutjxwwep6mibohq
Certifying quantumness: Benchmarks for the optimal processing of generalized coherent and squeezed states
2014
Physical Review A. Atomic, Molecular, and Optical Physics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Other Versions
To address such a problem, one first needs to establish the best classical solutions, which set benchmarks that must be beaten by any implementation claiming to harness quantum features for an enhanced ...
This work provides a comprehensive collection of directly useful criteria for the reliable certification of quantum communication technologies. ...
ones in the latter case. ...
doi:10.1103/physreva.90.042319
fatcat:rrjjx2k4vvcofciuwmx4w6aeoi
Experimental demonstration of scalable cross-entropy benchmarking to detect measurement-induced phase transitions on a superconducting quantum processor
[article]
2024
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2024; you can also visit the original URL.
The file type is application/pdf.
Here, we report the demonstration of this protocol in systems with one-dimensional and all-to-all connectivities on IBM's quantum hardware on up to 22 qubits, a regime which is presently inaccessible if ...
Past work has experimentally observed entanglement phase transitions on near-term quantum computers, but the characterization approach using entanglement entropy is not scalable due to exponential overhead ...
Rall for useful discussions. ...
arXiv:2403.00938v1
fatcat:isloig7n4fbcvoemk6wfzfngly
Quantum fluctuation theorem to benchmark quantum annealers
2018
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We propose the use of the quantum fluctuation theorem to benchmark the performance of quantum annealers. ...
Our proposal is experimentally tested on two generations of the D-Wave machine, which illustrates the sensitivity of the fluctuation theorem to the smallest aberrations from ideal annealing. ...
Namely, we have argued that the quantum fluctuation theorem can be used to benchmark the performance of quantum annealers. Our proposal was tested on two generations of the D-Wave machine. ...
doi:10.13016/m2rb6w40r
fatcat:dzbynwzxg5hgdjasyyvfswxfhq
NP-hard but no longer hard to solve? Using quantum computing to tackle optimization problems
2023
Frontiers in Quantum Science and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2024; you can also visit the original URL.
The file type is application/pdf.
We give an overview on problem formulation, available algorithms, and benchmarking. ...
We provide an entry point to quantum optimization for researchers from each topic, optimization or quantum computing, by demonstrating advances and obstacles with a suitable use case. ...
While this is promising, practical advantage (compared to say, quantum annealers) is not definitive. Practical application of quantum computing requires further progress in hardware. ...
doi:10.3389/frqst.2023.1128576
fatcat:aroovl4t7vb45loijorres3scm
Nonnegative/binary matrix factorization with a D-Wave quantum annealer
[article]
2017
PLoS ONE
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
D-Wave quantum annealers represent a novel computational architecture and have attracted significant interest, but have been used for few real-world computations. ...
Machine learning has been identified as an area where quantum annealing may be useful. Here, we show that the D-Wave 2X can be effectively used as part of an unsupervised machine learning method. ...
While there is still much work to be done to make these quantum annealers of practical use for this type of problem, our performance results give a glimmer of hope that this may someday be the case. ...
doi:10.1371/journal.pone.0206653
pmid:30532243
pmcid:PMC6287781
arXiv:1704.01605v1
fatcat:qsml3o7zwret7ah5wx32of3pua
Multi-Qubit Correction for Quantum Annealers
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Experimental results using D-Wave 2000Q quantum annealers demonstrate that MQC finds samples with notably lower energy values and improves the reproducibility of results when compared to recent hardware ...
We present multi-qubit correction (MQC) as a novel postprocessing method for quantum annealers that views the evolution in an open-system as a Gibbs sampler and reduces a set of excited states to a new ...
The annealing time for all experiments was 20 microseconds.
Study Cases Generating random Hamiltonians is a common practice for benchmarking quantum annealers 4, 13, 16, 48 . ...
arXiv:2010.00115v4
fatcat:adtvubeca5bnhbibsruq26ikny
« Previous
Showing results 1 — 15 out of 868 results