Results 1 to 10 of about 1,319,180 (120)

Entanglement in a Quantum Annealing Processor [PDF]

Physical Review X, 2014
Entanglement lies at the core of quantum algorithms designed to solve problems that are intractable by classical approaches. One such algorithm, quantum annealing (QA), provides a promising path to a practical quantum processor. We have built a series of
T. Lanting, A. J. Przybysz, A. Yu. Smirnov, F. M. Spedalieri, M. H. Amin, A. J. Berkley, R. Harris, F. Altomare, S. Boixo, P. Bunyk, N. Dickson, C. Enderud, J. P. Hilton, E. Hoskinson, M. W. Johnson, E. Ladizinsky, N. Ladizinsky, R. Neufeld, T. Oh, I. Perminov, C. Rich, M. C. Thom, E. Tolkacheva, S. Uchaikin, A. B. Wilson, G. Rose   +25 more
doaj   +2 more sources

Optimization of Quantum Computing Models Inspired by D-Wave Quantum Annealing

Tsinghua Science and Technology, 2020
With the slow progress of universal quantum computers, studies on the feasibility of optimization by a dedicated and quantum-annealing-based annealer are important.
Baonan Wang, Feng Hu, Chao Wang
doaj   +3 more sources

How to Solve Combinatorial Optimization Problems Using Real Quantum Machines: A Recent Survey

IEEE Access, 2022
A combinatorial optimization problem (COP) is the problem of finding the optimal solution in a finite set. When the size of the feasible solution set is large, the complexity of the problem increases, and it is not easy to solve in a reasonable time with
Sovanmonynuth Heng, Dongmin Kim, Taekyung Kim, Youngsun Han   +3 more
doaj   +1 more source

Quantum annealing with twisted fields

New Journal of Physics, 2022
Quantum annealing (QA) is a promising method for solving combinational optimization problems and performing quantum chemical calculations. The main sources of errors in QA are the effects of decoherence and non-adiabatic transition.
Takashi Imoto, Yuya Seki, Yuichiro Matsuzaki, Shiro Kawabata   +3 more
doaj   +1 more source

New Advanced Computing Architecture for Cryptography Design and Analysis by D-Wave Quantum Annealer

Tsinghua Science and Technology, 2022
Universal quantum computers are far from achieving practical applications. The D-Wave quantum computer is initially designed for combinatorial optimizations.
Xiangmin Ji, Baonan Wang, Feng Hu, Chao Wang, Huanguo Zhang   +4 more
doaj   +1 more source

Tunneling and Speedup in Quantum Optimization for Permutation-Symmetric Problems

Physical Review X, 2016
Tunneling is often claimed to be the key mechanism underlying possible speedups in quantum optimization via quantum annealing (QA), especially for problems featuring a cost function with tall and thin barriers.
Siddharth Muthukrishnan, Tameem Albash, Daniel A. Lidar   +2 more
doaj   +1 more source

Error Rate Analysis of Quantum-Annealing-Aided Multi-User Detection in Power-Domain Nonorthogonal Multiple Access

IEEE Access
We present the error rate performance of quantum-annealing-aided multiuser detection (QA-aided MUD), a signal detection approach that combines quantum annealing (QA) with conventional iterative multiuser detection (MUD).
Kouki Yonaga, Kenichi Takizawa, Masaru Inaba   +2 more
doaj   +1 more source

Inverse Reticle Optimization With Quantum Annealing and Hybrid Solvers

IEEE Access
Reticle optimization is a computationally demanding task in optical microlithography for advanced semiconductor fabrication. In this study, we explore the effectiveness of D-Wave’s quantum annealing (QA) and hybrid steepest descent (SD) solvers in
Po-Hsun Fang, Yan-Syun Chen, Jhih-Sheng Wu, Peichen Yu   +3 more
doaj   +1 more source

What is the Computational Value of Finite-Range Tunneling?

Physical Review X, 2016
Quantum annealing (QA) has been proposed as a quantum enhanced optimization heuristic exploiting tunneling. Here, we demonstrate how finite-range tunneling can provide considerable computational advantage.
Vasil S. Denchev, Sergio Boixo, Sergei V. Isakov, Nan Ding, Ryan Babbush, Vadim Smelyanskiy, John Martinis, Hartmut Neven   +7 more
doaj   +1 more source

Solving the elliptic curve discrete logarithm problem using quantum tunneling effects on the D-Wave Advantage2 quantum computer

Intelligent and Converged Networks
The computational hardness of the Elliptic Curve Discrete Logarithm Problem (ECDLP) directly determines Elliptic-Curve Cryptography (ECC) security. Quantum Annealing (QA) leverages its unique tunneling effects to effectively escape local optima.
Yu Lin, Shuaizhi Xiong, Zhi Pei, Yiliang Han, Shuaishuai Zhu, Shuxiao Yang, Chunlei Hong   +6 more
doaj   +1 more source