ground state expansion and the spectral gap of local
play

Ground state expansion and the spectral gap of local Hamiltonians - PowerPoint PPT Presentation

ICTP Workshop on Adiabatic Quantum Computers, 2016 Ground state expansion and the spectral gap of local Hamiltonians Elizabeth Crosson California Institute of Technology H 2( H E 0 ) 2 ( S ) 2 ( S ) Isoperimetric


  1. ICTP Workshop on Adiabatic Quantum Computers, 2016 Ground state expansion and the spectral gap of local Hamiltonians Elizabeth Crosson California Institute of Technology ∆ H ≤ 2( � H � − E 0 )Ψ 2 ( ∂ S ) Ψ 2 ( S )

  2. ◮ Isoperimetric inequality: relates the geometry of the ground state probability distribution to the spectral gap ◮ Constrains the kind of probability distributions that can be efficienctly sampled with adiabatic optimization ◮ Applies to non-stoquastic as well as stoquastic Hamiltonians ◮ Corroborates past results about small gaps arising from local minima that are far in Hamming distance ◮ Suggests speed ups from increased range k -local couplings

  3. Isoperimetric inequalities ◮ Measure on the boundary of a set Measure inside a set ◮ Can be defined for graphs in terms of vertex expansion ⇒ | ∂ S | | S | = 3 S = { 000 , 100 , 010 , 001 } = ⇒ ∂ S = { 100 , 010 , 001 } = 4

  4. Hilbert space graph G Ω , H ◮ Hamiltonian H and basis set Ω ◮ Vertices are elements of Ω ◮ Edges corresponding to non-zero off-diagonal matrix elements ◮ e.g. computational basis Ω = { 0 , 1 } n , transverse Ising Hamiltonian H , G Ω , H is an n -dimensional boolean hypercube ◮ The boundary of a set of vertices S ⊆ Ω are the vertices in S connected to vertices outside of S , ∂ S = { x ∈ S : ∃ y / ∈ S with � x | H | y � � = 0 }

  5. Isoperimetric Inequality for Quantum Ground States ◮ Define Ψ 2 ( S ) := � Ψ | 1 S | Ψ � := � x ∈ S | Ψ( x ) | 2 ◮ Theorem: If G Ω , H is a connected graph, then any subset S ⊆ Ω with Ψ 2 ( S ) ≤ 1 / 2 satisfies ∆ H ≤ 2( � H � − E 0 )Ψ 2 ( ∂ S ) Ψ 2 ( S ) , where | Ψ � is the ground state of H with energy E 0 , ∆ H is the spectral gap, and � H � is the operator norm. ◮ Depends on locality of the Hamiltonian and geometry of the ground state, but not the details of the Hamiltonian couplings!

  6. Example: Ferromagnetic Transverse Ising Model S = { x ∈ Ω : M ( x ) ≤ 0 } ∂ S = { x ∈ Ω : M ( x ) = 0 } 00...0 11...1 State space ◮ Probability of M = 0 in the ferromagnetic phase is ∼ e − Ω( n ) Ψ 2 ( ∂ S ) Ψ 2 ( S ) � e − Ω( n ) = ⇒ ∆ H � n e − Ω( n ) ◮

  7. Proof in the stoquastic case: map H to a Markov chain ◮ Define α := ( � H � − E 0 ) − 1 and β := � H � − 1 so that G := α ( I − β H ) non-negative and satisfies G | Ψ � = | Ψ � ⇒ Ψ( x ) > 0 ∀ x ∈ { 0 , 1 } n ◮ G Ω , H is connected = ◮ Define Markov chain transition probabilities by P ( x , y ) := � Ψ | y � � Ψ | x �� y | G | x � ◮ Slightly novel mapping, but mostly builds on past results [ Bravyi and Terhal 08’, Al-Shimary and Pachos 10’, Jarret and Jordan 14’, Nishimori, Tsuda, and Knysh 14’ ].

  8. ◮ P is a stochastic matrix because P ( x , y ) ≥ 0 ∀ x , y ∈ Ω and � Ψ | y � � Ψ | x �� y | G | x � = � Ψ | G | x � � � P ( x , y ) = = 1 Ψ | x � y ∈ Ω y ∈ Ω ◮ Define π ( x ) := | Ψ( x ) | 2 , then | π � = � x ∈ Ω π ( x ) | x � satisfies � � � π | P = � y | π ( x ) P ( x , y ) = � y |� Ψ | x �� x | G | y �� y | Ψ � x , y ∈ Ω x , y ∈ Ω � y || Ψ( y ) | 2 = � π | � � = � y |� Ψ | G | y �� y | Ψ � = y ∈ Ω y ∈ Ω ◮ P satisfies detailed balance, π ( x ) P ( x , y ) = π ( y ) P ( y , x ) ◮ P has eigenfunctions | φ k � := � x ∈ Ω Ψ( x )Ψ k ( x ) with eigenvalues α (1 − β E k ), so the gap is ∆ P = αβ ∆ H .

  9. Conductance inequality for Markov chains ◮ ∆ P satisfies the conductance inequality for Markov chains, Φ 2 1 � 2 ≤ ∆ P ≤ 2Φ , Φ = min π ( x ) P ( x , y ) π ( S ) S ⊂ Ω x ∈ S , y / ∈ S P ( x,y ) S π x π y

  10. From Conductance to Vertex Expansion ◮ Applying the definitions of P and π , � � π ( x ) P ( x , y ) = � Ψ | y �� y | G | x �� x | Ψ � = � Ψ | 1 ∂ S G 1 ∂ S c | Ψ � x ∈ S , y ∈ S c x ∈ S , y ∈ S c ◮ Using the fact that H is stoquastic, � Ψ | 1 ∂ S G 1 ∂ S c | Ψ � ≤ � Ψ | 1 ∂ S G | Ψ � = Ψ 2 ( ∂ S ) which shows that Φ( S ) ≤ Ψ 2 ( ∂ S ) / Ψ 2 ( S ).

  11. Lower Bound for the Stoquastic Case ◮ ∀ x ∈ Ω , � y ∈ Ω P ( x , y ) = 1, and this can be used to show that � H � ≤ Ψ y H min ≤ 1 ∀ x , y ∈ Ω s . t . � x | H | y � � = 0 Ψ x where H min := min x , y : � x | H | y �� =0 |� x | H | y �| . ◮ This allows for a lower bound in terms of vertex expansion, H 2 2 � H � 2 ( � H � − E 0 )Φ 2 min V ≤ ∆ H ≤ 2( � H � − E 0 )Φ V Ψ 2 ( ∂ S ) where Φ V := min S :Ψ 2 ( S ) ≤ 1 / 2 Ψ 2 ( S ) .

  12. Transverse Ising Spin Glass with n = 12 Qubits 0 - 5 lower bound - 10 spectral gap conductance bound vertex expansion bound - 15 0.0 0.2 0.4 0.6 0.8 adiabatic parameter ( s ) ◮ Thanks to John Bowen, from the University of Chicago, who worked on these ideas during a Caltech SURF this Summer!

  13. Proof in the Non-Stoquastic Case ◮ P retains many properties of a reversible transition matrix despite having complex entries of unbounded magnitude! ◮ Enables the use of similar techniques as those that are used to show the Markov chain conductance bounds ◮ Obstacle: Ψ( x ) = 0 is possible even if G Ω , H is connected. ◮ Solution: consider states close to Ψ with | Ψ( x ) | ≥ ǫ > 0 for all x , and prove the main theorem by taking the limit ǫ → 0. ◮ Counterexamples for non-stoquastic H = ⇒ ∆ H can be small even if the ground state is highly expanding.

  14. ◮ What if H is non-stoquastic, but P ( x , y ) ≥ 0 for all x , y ∈ Ω? ◮ e.g. the phases in � y | G | x � and � Ψ | y � / � Ψ | x � could cancel ◮ Definition: if H appears to be non-stoquastic but P is non-negative then H is “secretly stoquastic.” ◮ Observation: If G Ω , H is a connected line graph, then H is secretly stoquastic in the basis Ω.  0  a 1 b 1 b † a 2 b 2 H =   1   ... b † 0 2 ◮ Lesson: genuine non-stoquasticity requires frustration in the off-diagonal couplings!

  15. Implications for Adiabatic Optimization ◮ Ground state distributions with low expansion are difficult to produce using local Hamiltonian adiabatic optimization ◮ Small gap whenever the ground state is a mixture of modes centered on local minima far apart in Hamming distance

  16. Optimism for k -local Couplings ◮ Increasing k increases Ψ 2 ( ∂ S ) for every S ! S k ∂ S Interior of S

  17. Conclusion and Outlook ◮ Ground state bottlenecks slow down adiabatic optimization ◮ Limitations on improvement from non-stoquastic couplings for sampling target multimodal distributions ◮ Larger spectral gaps from path changes require reshaping the ground state throughout the evolution ◮ Diabatic transitions and thermal effects can escape these limitations on pure ground state adiabatic optimization ◮ Suggests benefit from k -local couplings for stoquastic systems ◮ Thank you for your attention! :)

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend