Speedup of high-order unconstrained binary optimization using quantum $${{\mathbb{Z}}}_{2}$$ Z 2 lattice gauge theory
Abstract An important and difficult problem in optimization is the high-order unconstrained binary optimization, which can represent many optimization problems more efficiently than quadratic unconstrained binary optimization, but how to quickly solve it has remained difficult. Here, we present an a...
Saved in:
| Main Authors: | Bi-Ying Wang, Xiaopeng Cui, Qingguo Zeng, Yemin Zhan, Man-Hong Yung, Yu Shi |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2025-04-01
|
| Series: | Communications Physics |
| Online Access: | https://doi.org/10.1038/s42005-025-02072-7 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On the sumsets of units in a ring of matrices over $ \mathbb{Z}/m\mathbb{Z} $
by: Yifan Luo, et al.
Published: (2025-03-01) -
Riemann–Roch for the ring $\mathbb{Z}$
by: Connes, Alain, et al.
Published: (2024-05-01) -
$\mathbb{Z}_4$ transitions in quantum loop models on a zig-zag ladder
by: Bowy M. La Rivière, Natalia Chepiga
Published: (2024-11-01) -
Quantum optical classifier with superexponential speedup
by: Simone Roncallo, et al.
Published: (2025-04-01) -
Quartic Quantum Speedups for Planted Inference
by: Alexander Schmidhuber, et al.
Published: (2025-06-01)