Fast adiabatic method for measuring topological Chern number

Luo, Zhiyong; Zeng, Bei

doi:10.1007/s11433-018-9173-5

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2021

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 15 publications

(15 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are a lot of computationally hard problems formulated as optimization problems using AQC to find the best answers, such as 3‐SAT problem, Deutsch's problem and quantum database search problem 6,14,16‐22 . So does the factoring problem.…”

Section: Introductionmentioning

confidence: 99%

Adiabatic quantum algorithm for factorization with growing minimum energy gap

Bao¹,

Jiang²,

Gao³

et al. 2021

Quantum Engineering

View full text Add to dashboard Cite

We present a new quantum algorithm for factoring integers in the framework of adiabatic quantum computation. For an n bit integer with only one pair of equal bit factors we consider, the qubits needed in our algorithm is less than n, which makes it the most qubit‐saving quantum factoring algorithm to our knowledge. Furthermore, we have numerically studied the scaling law for the minimum energy gap and entanglement entropy acrossing quantum phase transition. We have witnessed an increasing minimum gap scaling law which indicates the potential ability of an exponential quantum speedup with respect to the fastest classical factoring algorithm. In addition, the linear scaling law of the entanglement entropy provides the evidence that the system can provide large amount of entanglement which is the main resource for the quantum speedup.

show abstract

Section: Introductionmentioning

confidence: 99%