[go: up one dir, main page]
Scribd
Upload
31 views14 pages

Diabatic Quantum Computation

Uploaded by

kourosh mirsohi

Diabatic quantum computation (DQC) is an alternative approach to adiabatic quantum computation. In DQC, the system stays within a narrow energy band instead of a single eigenstate. DQC can be simulated using quantum Monte Carlo, unlike adiabatic quantum computation. DQC and the quantum approximate optimization algorithm (QAOA) are both alternatives to adiabatic quantum computation, but DQC does not require the Hamiltonian to remain stoquastic or for the system to remain in equilibrium. An example application is solving the glued trees problem in poly(n) time using DQC instead of the exponential time required for the adiabatic approach.

Copyright:

© All Rights Reserved
Download as PDF, TXT or read online from Scribd
Download as pdf or txt

Diabatic Quantum Computation

Uploaded by

kourosh mirsohi
31 views14 pages
Diabatic quantum computation (DQC) is an alternative approach to adiabatic quantum computation. In DQC, the system stays within a narrow energy band instead of a single eigenstate. DQC can be simulated using quantum Monte Carlo, unlike adiabatic quantum computation. DQC and the quantum approximate optimization algorithm (QAOA) are both alternatives to adiabatic quantum computation, but DQC does not require the Hamiltonian to remain stoquastic or for the system to remain in equilibrium. An example application is solving the glued trees problem in poly(n) time using DQC instead of the exponential time required for the adiabatic approach.

Original Title

Diabatic quantum computation

Copyright

© © All Rights Reserved

Available Formats

PDF, TXT or read online from Scribd

Did you find this document useful?

Is this content inappropriate?

Diabatic quantum computation (DQC) is an alternative approach to adiabatic quantum computation. In DQC, the system stays within a narrow energy band instead of a single eigenstate. DQC can be simulated using quantum Monte Carlo, unlike adiabatic quantum computation. DQC and the quantum approximate optimization algorithm (QAOA) are both alternatives to adiabatic quantum computation, but DQC does not require the Hamiltonian to remain stoquastic or for the system to remain in equilibrium. An example application is solving the glued trees problem in poly(n) time using DQC instead of the exponential time required for the adiabatic approach.

Copyright:

© All Rights Reserved
Download as PDF, TXT or read online from Scribd
Download as pdf or txt
31 views14 pages

Diabatic Quantum Computation

Uploaded by

kourosh mirsohi
Diabatic quantum computation (DQC) is an alternative approach to adiabatic quantum computation. In DQC, the system stays within a narrow energy band instead of a single eigenstate. DQC can be simulated using quantum Monte Carlo, unlike adiabatic quantum computation. DQC and the quantum approximate optimization algorithm (QAOA) are both alternatives to adiabatic quantum computation, but DQC does not require the Hamiltonian to remain stoquastic or for the system to remain in equilibrium. An example application is solving the glued trees problem in poly(n) time using DQC instead of the exponential time required for the adiabatic approach.

Copyright:

© All Rights Reserved
Download as PDF, TXT or read online from Scribd
Download as pdf or txt
You are on page 1/ 14

DIABATIC QUANTUM

COMPUTATION
ADIABATIC THEOREM

•𝐻 𝑠 = 1 − 𝑠 𝐻0 + 𝑠𝐻1

• 𝑠 = 𝑡𝑡
𝑓

1 𝐸𝑖 𝑠 𝜕𝑠 𝐻 𝑠 𝐸𝑗 𝑠
• max
𝑡𝑓 𝑠 2 ≪1
𝐸𝑖 𝑠 −𝐸𝑗 𝑠
DIABATIC QC

1 𝐸𝑖 𝑠 𝜕𝑠 𝐻 𝑠 𝐸𝑗 𝑠
• We don’t have to have: max
𝑡𝑓 𝑠 2 ≪1
𝐸𝑖 𝑠 −𝐸𝑗 𝑠

• System stays in a narrow energy band instead of a single eigenstate.


DIABATIC QC

• H(s) is restricted to d eigenstate separated by Δ 𝑠 from rest of spectrum. P(s)


is the projection on this subspace, 𝑃𝑇 𝑠 = 𝑈 𝑠 𝑃 0 𝑈 † 𝑠

s 2
1 𝑑 H′ 𝑠 𝑑 𝐻 ′′ 𝐻′
• 𝑃𝑇 𝑠 − 𝑃 𝑠 <
𝑇 Δ2 0
+ 0
′
𝑑𝑠 ( 2
Δ
+ 7𝑑 3/2
Δ3
)
DIABATIC QC
DIABATIC QC

• Adiabatic QC can be simulated with QMC.

• QMC requires: 1) Stoquastic Hamiltonian 2) Equilibrium

• Diabatic QC can not be simulated with QMC.


DIABATIC QC
DQC VS QAOA

•𝑈 𝛽, 𝛾 = 𝑒 𝑖𝛽𝐻𝑥 𝑒 𝑖𝛾𝐻𝑧

• 𝜓 𝛾, 𝛽 =
𝑝
𝑘=1 𝑈 𝛽𝑘 , 𝛾𝑘 |+𝑛 ⟩

• 𝐶 ∗ = min
𝛾,𝛽
𝜓 𝛾, 𝛽 𝐻𝑧 | 𝜓 𝛾, 𝛽 ⟩
DQC VS QAOA

• 𝑡𝑓 = 𝑝
𝑖=1( 𝛾𝑖 + 𝛽𝑖 )

1 𝛾𝑖
•𝑓 𝑡𝑖 = 𝑖
𝑗=1 𝛾𝑗 + 𝛽𝑗 −
2
𝛾𝑖 + 𝛽𝑖 =
𝛾𝑖 +|𝛽𝑖 |

• 𝐻𝑄𝐴𝑂𝐴 𝑡 = − 𝑓 𝑡 𝐻𝑍 + 1 − 𝑓 𝑡 𝐻𝑋
DQC VS QAOA

• Simulating QAOA with DQC


AN EXAMPLE

Glued tree problem:

• Having 2n-bit for ENTRANCE name,


Find EXIT
AN EXAMPLE

•𝐻 𝑠 = 1 − 𝑠 𝛼𝐻0 − 𝑠 1 − 𝑠 𝐴 + 𝑠𝛼𝐻1

• 𝑇 ∼ 𝑂 2𝑛 → 𝐴𝑑𝑖𝑎𝑏𝑎𝑡𝑖𝑐
• 𝑇 ∼ 𝑂 𝑃𝑜𝑙𝑦(𝑛) → 𝐷𝑖𝑎𝑏𝑎𝑡𝑖𝑐
THANKS!

Additional references:

• R. D. Somma, D. Nagaj, and M. Kieferov´a, Phys. Rev. Lett. 109, 050501 (2012)
• A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, and D. A. Spielman, in Proceedings of the thirtyfifth annual ACM
symposium on Theory of computing (ACM, 2003) pp. 59–68
• S. Jansen, M.-B. Ruskai, and R. Seiler, J. Math. Phys. 48, 102111 (2007)
• T. Albash and D. A. Lidar, Physical Review X 8, 031016 (2018)
• G. Pagano, A. Bapat, P. Becker, K. S. Collins, A. De, P. W. Hess, H. B. Kaplan, A. Kyprianidis, W. L. Tan, C. Baldwin, L. T. Brady,
A. Deshpande, F. Liu, S. Jordan, A. V. Gorshkov, and C. Monroe, “Quantum approximate optimization with a trapped-ion
quantum simulator,” (2019)

You might also like