An official website of the United States government
We investigate the behavior of higher-form symmetries at variousquantum phase transitions. We consider discrete 1-form symmetries, whichcan be either part of the generalized concept “categorical symmetry”(labelled as \tilde{Z}_N^{(1)} Z ̃ N ( 1 ) )introduced recently, or an explicit Z_N^{(1)} Z N ( 1 ) 1-form symmetry. We demonstrate that for many quantum phase transitionsinvolving a Z_N^{(1)} Z N ( 1 ) or \tilde{Z}_N^{(1)} Z ̃ N ( 1 ) symmetry, the following expectation value \langle \left( O_\mathcal{C}\right)^2 \rangle ⟨ ( O 𝒞 ) 2 ⟩ takes the form \langle \left( \log O_\mathcal{C} \right)^2 \rangle \sim - \frac{A}{\epsilon} P + b \log P ⟨ ( log O 𝒞 ) 2 ⟩ ∼ − A ϵ P + b log P , where O_\mathcal{C} O 𝒞 is an operator defined associated with loop \mathcal{C} 𝒞 (or its interior \mathcal{A} 𝒜 ),which reduces to the Wilson loop operator for cases with an explicit Z_N^{(1)} Z N ( 1 ) 1-form symmetry. P P is the perimeter of \mathcal{C} 𝒞 ,and the b \log P b log P term arises from the sharp corners of the loop \mathcal{C} 𝒞 ,which is consistent with recent numerics on a particular example. b b is a universal microscopic-independent number, which in (2+1)d ( 2 + 1 ) d is related to the universal conductivity at the quantum phasetransition. b b can be computed exactly for certain transitions using the dualitiesbetween (2+1)d ( 2 + 1 ) d conformal field theories developed in recent years. We also compute the"strange correlator" of O_\mathcal{C} O 𝒞 : S_{\mathcal{C}} = \langle 0 | O_\mathcal{C} | 1 \rangle / \langle 0 | 1 \rangle S 𝒞 = ⟨ 0 | O 𝒞 | 1 ⟩ / ⟨ 0 | 1 ⟩ where |0\rangle | 0 ⟩ and |1\rangle | 1 ⟩ are many-body states with different topological nature.
more »
« less
This content will become publicly available on August 8, 2026
Matrix Inversion by Quantum Walk
The HHL algorithm for matrix inversion is a landmark algorithm in quantum computation. Its ability to produce a state $$|x\rangle$$ that is the solution of $Ax=b$, given the input state $$|b\rangle$$, is envisaged to have diverse applications. In this paper, we substantially simplify the algorithm, originally formed of a complex sequence of phase estimations, amplitude amplifications and Hamiltonian simulations, by replacing the phase estimations with a continuous time quantum walk. The key technique is the use of weak couplings to access the matrix inversion embedded in perturbation theory.
more »
« less
- Award ID(s):
- 2427020
- PAR ID:
- 10634030
- Publisher / Repository:
- arxiv.org (quant-ph)
- Date Published:
- Edition / Version:
- 1
- Subject(s) / Keyword(s):
- Quantum walk quantum algorithm matrix inversion
- Format(s):
- Medium: X Size: 1MB Other: pdf
- Size(s):
- 1MB
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
We give two new quantum algorithms for solving semidefinite programs (SDPs) providing quantum speed-ups. We consider SDP instances with m constraint matrices, each of dimension n, rank at most r, and sparsity s. The first algorithm assumes an input model where one is given access to an oracle to the entries of the matrices at unit cost. We show that it has run time O~(s^2 (sqrt{m} epsilon^{-10} + sqrt{n} epsilon^{-12})), with epsilon the error of the solution. This gives an optimal dependence in terms of m, n and quadratic improvement over previous quantum algorithms (when m ~~ n). The second algorithm assumes a fully quantum input model in which the input matrices are given as quantum states. We show that its run time is O~(sqrt{m}+poly(r))*poly(log m,log n,B,epsilon^{-1}), with B an upper bound on the trace-norm of all input matrices. In particular the complexity depends only polylogarithmically in n and polynomially in r. We apply the second SDP solver to learn a good description of a quantum state with respect to a set of measurements: Given m measurements and a supply of copies of an unknown state rho with rank at most r, we show we can find in time sqrt{m}*poly(log m,log n,r,epsilon^{-1}) a description of the state as a quantum circuit preparing a density matrix which has the same expectation values as rho on the m measurements, up to error epsilon. The density matrix obtained is an approximation to the maximum entropy state consistent with the measurement data considered in Jaynes' principle from statistical mechanics. As in previous work, we obtain our algorithm by "quantizing" classical SDP solvers based on the matrix multiplicative weight update method. One of our main technical contributions is a quantum Gibbs state sampler for low-rank Hamiltonians, given quantum states encoding these Hamiltonians, with a poly-logarithmic dependence on its dimension, which is based on ideas developed in quantum principal component analysis. We also develop a "fast" quantum OR lemma with a quadratic improvement in gate complexity over the construction of Harrow et al. [Harrow et al., 2017]. We believe both techniques might be of independent interest.more » « less
-
null (Ed.)Strong interactions between electrons occupying bands of opposite (orlike) topological quantum numbers (Chern =\pm1 = ± 1 ),and with flat dispersion, are studied by using lowest Landau level (LLL)wavefunctions. More precisely, we determine the ground states for twoscenarios at half-filling: (i) LLL’s with opposite sign of magneticfield, and therefore opposite Chern number; and (ii) LLL’s with the samemagnetic field. In the first scenario – which we argue to be a toy modelinspired by the chirally symmetric continuum model for twisted bilayergraphene – the opposite Chern LLL’s are Kramer pairs, and thus thereexists time-reversal symmetry ( \mathbb{Z}_2 ℤ 2 ).Turning on repulsive interactions drives the system to spontaneouslybreak time-reversal symmetry – a quantum anomalous Hall state describedby one particle per LLL orbital, either all positive Chern |{++\cdots+}\rangle | + + ⋯ + ⟩ or all negative |{--\cdots-}\rangle | − − ⋯ − ⟩ .If instead, interactions are taken between electrons of like-Chernnumber, the ground state is an SU(2) S U ( 2 ) ferromagnet, with total spin pointing along an arbitrary direction, aswith the \nu=1 ν = 1 spin- \frac{1}{2} 1 2 quantum Hall ferromagnet. The ground states and some of theirexcitations for both of these scenarios are argued analytically, andfurther complimented by density matrix renormalization group (DMRG) andexact diagonalization.more » « less
-
In the problem of horizontal convection a non-uniform buoyancy, $$b_{s}(x,y)$$ , is imposed on the top surface of a container and all other surfaces are insulating. Horizontal convection produces a net horizontal flux of buoyancy, $$\boldsymbol{J}$$ , defined by vertically and temporally averaging the interior horizontal flux of buoyancy. We show that $$\overline{\boldsymbol{J}\boldsymbol{\cdot }\unicode[STIX]{x1D735}b_{s}}=-\unicode[STIX]{x1D705}\langle |\unicode[STIX]{x1D735}b|^{2}\rangle$$ ; the overbar denotes a space–time average over the top surface, angle brackets denote a volume–time average and $$\unicode[STIX]{x1D705}$$ is the molecular diffusivity of buoyancy $$b$$ . This connection between $$\boldsymbol{J}$$ and $$\unicode[STIX]{x1D705}\langle |\unicode[STIX]{x1D735}b|^{2}\rangle$$ justifies the definition of the horizontal-convective Nusselt number, $Nu$ , as the ratio of $$\unicode[STIX]{x1D705}\langle |\unicode[STIX]{x1D735}b|^{2}\rangle$$ to the corresponding quantity produced by molecular diffusion alone. We discuss the advantages of this definition of $Nu$ over other definitions of horizontal-convective Nusselt number. We investigate transient effects and show that $$\unicode[STIX]{x1D705}\langle |\unicode[STIX]{x1D735}b|^{2}\rangle$$ equilibrates more rapidly than other global averages, such as the averaged kinetic energy and bottom buoyancy. We show that $$\unicode[STIX]{x1D705}\langle |\unicode[STIX]{x1D735}b|^{2}\rangle$$ is the volume-averaged rate of Boussinesq entropy production within the enclosure. In statistical steady state, the interior entropy production is balanced by a flux through the top surface. This leads to an equivalent ‘surface Nusselt number’, defined as the surface average of vertical buoyancy flux through the top surface times the imposed surface buoyancy $$b_{s}(x,y)$$ . In experimental situations it is easier to evaluate the surface entropy flux, rather than the volume integral of $$|\unicode[STIX]{x1D735}b|^{2}$$ demanded by $$\unicode[STIX]{x1D705}\langle |\unicode[STIX]{x1D735}b|^{2}\rangle$$ .more » « less
-
Abstract Givenndisjoint intervals on together withnfunctions , , and an matrix , the problem is to find anL2solution , , to the linear system , where , is a matrix of finite Hilbert transforms with defined on , and is a matrix of the corresponding characteristic functions on . Since we can interpret , as a generalized multi‐interval finite Hilbert transform, we call the formula for the solution as “the inversion formula” and the necessary and sufficient conditions for the existence of a solution as the “range conditions”. In this paper we derive the explicit inversion formula and the range conditions in two specific cases: a) the matrix Θ is symmetric and positive definite, and; b) all the entries of Θ are equal to one. We also prove the uniqueness of solution, that is, that our transform is injective. In the case a), that is, when the matrix Θ is positive definite, the inversion formula is given in terms of the solution of the associated matrix Riemann–Hilbert Problem. In the case b) we reduce the multi interval problem to a problem onncopies of and then express our answers in terms of the Fourier transform. We also discuss other cases of the matrix Θ.more » « less
