Results 51 to 60 of about 3,222 (193)

HUBO formulations for solving the eigenvalue problem

Results in Control and Optimization, 2023
Solving the eigenvalue problem is particularly important in almost all fields of science and engineering. With the development of quantum computers, multiple algorithms have been proposed for this purpose.
Kyungtaek Jun, Hyunju Lee
doaj   +1 more source

An Integrated Programming and Development Environment for Adiabatic Quantum Optimization

, 2014
Adiabatic quantum computing is a promising route to the computational power afforded by quantum information processing. The recent availability of adiabatic hardware has raised challenging questions about how to evaluate adiabatic quantum optimization ...
Bennink, Ryan S., Billings, Jay J., D'Azevedo, Ed F., Humble, Travis S., Klymko, Christine F., McCaskey, Alex J., Seddiqi, Hadayat, Sullivan, Blair D.   +7 more
core   +1 more source

Toward Solution‐Time Advantage With Error‐Mitigated Quantum Annealing for Combinatorial Optimization

Advanced Physics Research, EarlyView.
This paper presents a novel error mitigation technique to address the qubit errors that occur when solving combinatorial optimization problems with quantum annealing. The approach significantly speeds up the computation to reach the global optimum solution for a correlated 3D image segmentation model for material microstructures, demonstrating a ...
Yushuang Sam Yang, Peter Tyson, Clement Chu, Anthony Bruce Murphy   +3 more
wiley   +1 more source

Schedule path optimization for quantum annealing and adiabatic quantum computing

, 2016
Adiabatic quantum computing and optimization have garnered much attention recently as possible models for achieving a quantum advantage over classical approaches to optimization and other special purpose computations. Both techniques are probabilistic in
Sarovar, Mohan, Zeng, Lishan, Zhang, Jun
core   +1 more source

Establishing Shape Correspondences: A Survey

Computer Graphics Forum, EarlyView.
Abstract Shape correspondence between surfaces in 3D is a central problem in geometry processing, concerned with establishing meaningful relations between surfaces. While all correspondence problems share this goal, specific formulations can differ significantly: Downstream applications require certain properties that correspondences must satisfy ...
A. Heuschling, H. Meinhold, L. Kobbelt
wiley   +1 more source

Computing canonical averages with quantum and classical optimizers: Thermodynamic reweighting for QUBO models of physical systems

Physical Review Research
We present a general method to compute canonical averages for physical models sampled via quantum or classical quadratic unconstrained binary optimization (QUBO).
Francesco Slongo, Cristian Micheletti
doaj   +1 more source

Determination of ATP Content in Cells

Cell Proliferation, EarlyView.
The overlap HPLC chromatograms of ATP standard (red) and ATP in cells (blue). Poroshell 120 EC‐C18 (3 × 150 mm, 2.7 μm), 25°C, pH 6.8 buffer solution of 0.05 mol/L KH2PO4 ‐ 0.05 mol/L K2HPO4 (V:V = 1:1) as mobile phase, 0.6 mL/min, 254 nm.
Boqiang Fu, Wenfeng Huang, Yingying Liu, Lei Wang, Yuan Liu, Jiani Cao, Wenjuan Duan, Aijin Ma, Hongling Zhao, Shuaishuai Niu, Shijun Hu, Qiyuan Li, Yong Zhang, Yaojin Peng, Xiaoyou Yu, Junying Yu, Jun Wei, Yu Zhang, Guoqiang Hua, Xin Liu, Changlin Wang, Tao Na, Yang Zhao, Jiaxi Zhou, Peng Xiang, Zhihong Wu, Qubo Chen, Peijun Zhai, Hengjun Gao, Jie Hao, Tongbiao Zhao, Jing Wang   +31 more
wiley   +1 more source

QUBO formulations for a system of linear equations

Results in Control and Optimization, 2022
Abstract With the advent of quantum computers, many quantum computing algorithms are being developed. Solving linear systems is one of the most fundamental problems in almost all of science and engineering. Harrow-Hassidim-Lloyd algorithm, a monumental quantum algorithm for solving linear systems on the gate model quantum computers, was ...
openaire   +2 more sources

A Resource Efficient Ising Model‐Based Quantum Sudoku Solver

Software: Practice and Experience, Volume 56, Issue 6, Page 643-657, June 2026.
ABSTRACT Background Quantum algorithms exploit superposition and parallelism to address complex combinatorial problems, many of which fall into the non‐polynomial (NP) class. Sudoku, a widely known logic‐based puzzle, is proven to be NP‐complete and thus presents a suitable testbed for exploring quantum optimization approaches.
Wen‐Li Wang, Mei‐Huei Tang, Kevin Wang, Muhammad Abdul Basit, Yuan Tian, Md. Sanaul Haque   +5 more
wiley   +1 more source

Standardization of Multi-Objective QUBOs

2025 IEEE International Conference on Quantum Computing and Engineering (QCE)
Multi-objective optimization involving Quadratic Unconstrained Binary Optimization (QUBO) problems arises in various domains. A fundamental challenge in this context is the effective balancing of multiple objectives, each potentially operating on very different scales. This imbalance introduces complications such as the selection of appropriate weights
Loong Kuan Lee, Thore Gerlach, Nico Piatkowski   +2 more
openaire   +2 more sources