Annealing Archives - Page 2 of 2 - IEEE Transactions on Quantum Engineering

Hybrid Classical-Quantum Optimization Techniques for Solving Mixed-Integer Programming Problems in Production Scheduling

June 29, 2022Akshay Ajagekar; Kumail Al Hamoud; Fengqi YouOpen Access, Quantum InformationAnnealing, Computers, Job shop scheduling, Optimal scheduling, Processor scheduling, Quantum annealing, Qubit

Quantum computing (QC) holds great promise to open up a new era of computing and has been receiving significant attention recently. To overcome the performance limitations of near-term QC, utilizing the current quantum computers to complement classical techniques for solving real-world problems is of utmost importance. In this article, we develop QC-based solution strategies that […]

Experimental Demonstrations of Native Implementation of Boolean Logic Hamiltonian in a Superconducting Quantum Annealer

August 24, 2021Daisuke Saida; Yuki Yamanashi; Mutsuo Hidaka; Fuminori Hirayama; Kentaro Imafuku; Shuichi Nagasawa; Shiro KawabataOpen Access, Quantum Computer Architecture, Quantum InformationAnnealing, Electronics packaging, Licenses, Logic gates, Qubit, Schedules, Superconducting integrated circuits

Experimental demonstrations of quantum annealing with “native” implementation of Boolean logic Hamiltonians are reported. As a superconducting integrated circuit, a problem Hamiltonian whose set of ground states is consistent with a given truth table is implemented for quantum annealing with no redundant qubits. As examples of the truth table, nand and nor are successfully fabricated […]

Performance of Domain-Wall Encoding for Quantum Annealing

July 14, 2021Jie Chen; Tobias Stollenwerk; Nicholas ChancellorOpen Access, Quantum Computer Architecture, Quantum InformationAnnealing, Encoding, Hardware, Measurement, Optimization, Qubit, Space exploration

In this article, we experimentally test the performance of the recently proposed domain-wall encoding of discrete variables Chancellor, 2019, on Ising model flux qubit quantum annealers. We compare this encoding with the traditional one-hot methods and find that they outperform the one-hot encoding for three different problems at different sizes of both the problem and […]

Single-Qubit Fidelity Assessment of Quantum Annealing Hardware

June 25, 2021Jon Nelson; Marc Vuffray; Andrey Y. Lokhov; Carleton CoffrinOpen Access, Quantum Computer Architecture, Quantum InformationAnnealing, Hardware, Performance evaluation, Protocols, Quantum computing, Qubit, Standards

As a wide variety of quantum computing platforms become available, methods for assessing and comparing the performance of these devices are of increasing interest and importance. Inspired by the success of single-qubit error rate computations for tracking the progress of gate-based quantum computers, this work proposes a quantum annealing single-qubit assessment (QASA) protocol for quantifying […]

Benchmarking Hamiltonian Noise in the D-Wave Quantum Annealer

January 11, 2021Tristan Zaborniak; Rogério de SousaOpen Access, Quantum InformationAnnealing, Benchmark testing, Correlation, Logic gates, Qubit, Stationary state, Time measurement

Various sources of noise limit the performance of quantum computers by altering qubit states in an uncontrolled manner throughout computations and reducing their coherence time. In quantum annealers, this noise introduces additional fluctuations to the parameters defining the original problem Hamiltonian, such that they find the ground states of problems perturbed from those originally programmed. […]

Solving the Max-Flow Problem on a Quantum Annealing Computer

October 14, 2020Thomas Krauss; Joey McCollum; Chapman Pendery; Sierra Litwin; Alan J. MichaelsOpen Access, Quantum Information, Quantum SoftwareAnnealing, Directed graphs, Linear programming, Qubit, Simulated annealing

This article addresses the question of implementing a maximum flow algorithm on directed graphs in a formulation suitable for a quantum annealing computer. Three distinct approaches are presented. In all three cases, the flow problem is formulated as a quadratic unconstrained binary optimization (QUBO) problem amenable to quantum annealing. The first implementation augments a graph […]

Toward Quantum Gate-Model Heuristics for Real-World Planning Problems

October 13, 2020Tobias Stollenwerk; Stuart Hadfield; Zhihui WangOpen Access, Quantum InformationAirports, Annealing, Cost function, Logic gates, Planning, Quantum computing

Many challenging scheduling, planning, and resource allocation problems come with real-world input data and hard problem constraints, and reduce to optimizing a cost function over a combinatorially defined feasible set, such as colorings of a graph. Toward tackling such problems with quantum computers using quantum approximate optimization algorithms, we present novel efficient quantum alternating operator […]

Solving the Network Shortest Path Problem on a Quantum Annealer

September 4, 2020Thomas Krauss; Joey McCollumOpen Access, Quantum InformationAdiabatic, Annealing, Heuristic algorithms, Linear programming, Optimization, Quantum computing, Shortest path problem

This article addresses the formulation for implementing a single source, single-destination shortest path algorithm on a quantum annealing computer. Three distinct approaches are presented. In all the three cases, the shortest path problem is formulated as a quadratic unconstrained binary optimization problem amenable to quantum annealing. The first implementation builds on existing quantum annealing solutions […]