Efficient diabatic quantum algorithm in number factorization

DOI10.1016/j.physleta.2020.126745zbMath1448.81255OpenAlexW3045354886MaRDI QIDQ2213314

Haoyu Guan, Wenxian Zhang, Anqi Shi

Publication date: 30 November 2020

Published in: Physics Letters. A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physleta.2020.126745

zbMATH Keywords

quantum computationadiabatic quantum algorithmdiabatic evolution

Mathematics Subject Classification ID

Quantum computation (81P68)

Related Items (1)

Why adiabatic quantum annealing is unlikely to yield speed-up

Cites Work

• Unnamed Item
• Unnamed Item
• Quantum Ising phases and transitions in transverse Ising models
• Perturbation theory of semi-bounded operators
• Realization of a scalable Shor algorithm
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
• Transitionless quantum driving

This page was built for publication: Efficient diabatic quantum algorithm in number factorization