Scalable circuit depth reduction in feedback-based quantum optimization with a quadratic approximation
Combinatorial optimization problems are one of the areas where near-term noisy quantum computers may have practical advantage against classical computers. Recently, a feedback-based quantum optimization algorithm has been proposed by Magann et al., Phys. Rev. Lett. 129, 250502 (2022)10.1103/PhysRevL...
Saved in:
Main Authors: | Don Arai, Ken N. Okada, Yuichiro Nakano, Kosuke Mitarai, Keisuke Fujii |
---|---|
Format: | Article |
Language: | English |
Published: |
American Physical Society
2025-01-01
|
Series: | Physical Review Research |
Online Access: | http://doi.org/10.1103/PhysRevResearch.7.013035 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Fault-tolerant quantum memory using low-depth random circuit codes
by: Jon Nelson, et al.
Published: (2025-01-01) -
Approximation on the Quadratic Reciprocal Functional Equation
by: Abasalt Bodaghi, et al.
Published: (2014-01-01) -
On Kadison-Schwarz Type Quantum Quadratic Operators on
by: Farrukh Mukhamedov, et al.
Published: (2013-01-01) -
Tantalum airbridges for scalable superconducting quantum processors
by: Kunliang Bu, et al.
Published: (2025-01-01) -
Scalable Full-Stack Benchmarks for Quantum Computers
by: Jordan Hines, et al.
Published: (2024-01-01)