We give a general introduction to quantum phase transitions in strongly-correlated electron systems. These transitions which occur at zero temperature when a non-thermal parameter $g$ like pressure, chemical composition or magnetic field is tuned to a critical value are characterized by a dynamic exponent $z$ related to the energy and length scales $\Delta$ and $\xi$. Simple arguments based on an expansion to first order in the effective interaction allow to define an upper-critical dimension $D_{C}=4$ (where $D=d+z$ and $d$ is the spatial dimension) below which mean-field description is no longer valid. We emphasize the role of pertubative renormalization group (RG) approaches and self-consistent renormalized spin fluctuation (SCR-SF) theories to understand the quantum-classical crossover in the vicinity of the quantum critical point with generalization to the Kondo effect in heavy-fermion systems. Finally we quote some recent inelastic neutron scattering experiments performed on heavy-fermions which lead to unusual scaling law in $\omega /T$ for the dynamical spin susceptibility revealing critical local modes beyond the itinerant magnetism scheme and mention new attempts to describe this local quantum critical point.

https://arxiv.org/pdf/cond-mat/0102119.pdf

Quantum Phase Transitions

Distance-Regular Graphs

a ) p. 131 The discussion between eqs. (5.14) and (5.15) is incorrect (dA should be made as large as possible!). b ) p. 256 In the figure, the numbers 6) and 7) occur twice. c ) p. 292 At the end of section 12.5, it should be the space of isospectral 0Hermitian matrices. d ) p. 306 A ”Tr” is missing in eq. (13.43). e ) p. 327, Eq. (14.64b) is 〈Trρ〉B = N(14N+10) (5N+1)(N+3) should be 〈Trρ〉B = 8N+7 (N+2)(N+4)

https://chaos.if.uj.edu.pl/~karol/erratum10.pdf

Geometry of Quantum States

We study information retrieval from evaporating black holes, assuming that the internal dynamics of a black hole is unitary and rapidly mixing, and assuming that the retriever has unlimited control over the emitted Hawking radiation. If the evaporation of the black hole has already proceeded past the ``half-way'' point, where half of the initial entropy has been radiated away, then additional quantum information deposited in the black hole is revealed in the Hawking radiation very rapidly. Information deposited prior to the half-way point remains concealed until the half-way point, and then emerges quickly. These conclusions hold because typical local quantum circuits are efficient encoders for quantum error-correcting codes that nearly achieve the capacity of the quantum erasure channel. Our estimate of a black hole's information retention time, based on speculative dynamical assumptions, is just barely compatible with the black hole complementarity hypothesis.

http://absimage.aps.org/image/MAR08/MWS_MAR08-2007-003180.pdf

Black holes as mirrors: quantum information in random subsystems

Geometry of quantum states: an introduction to quantum entanglement by Ingemar Bengtsson and Karol Zyczkowski

We present a heuristic algorithm for finding a graph $H$ as a minor of a graph $G$ that is practical for sparse $G$ and $H$ with hundreds of vertices We also explain the practical importance of finding graph minors in mapping quadratic pseudo-boolean optimization problems onto an adiabatic quantum annealer

A practical heuristic for finding graph minors

We use difference sets to construct interesting sets of lines in complex space. Using (v,k,1)-difference sets, we obtain k^2-k+1 equiangular lines in C^k when k-1 is a prime power. Using semiregular relative difference sets with parameters (k,n,k,@l) we construct sets of n+1 mutually unbiased bases in C^k. We show how to construct these difference sets from commutative semifields and that all known maximal sets of mutually unbiased bases can be obtained in this way, resolving a conjecture about the monomiality of maximal sets. We also relate mutually unbiased bases to spin models.

https://arxiv.org/pdf/quant-ph/0511004.pdf

Equiangular lines, mutually unbiased bases, and spin models

The current generation of D-Wave quantum annealing processor is designed to minimize the energy of an Ising spin configuration whose pairwise interactions lie on the edges of a Chimera graph $${\mathcal {C}}_{M,N,L}$$CM,N,L. In order to solve an Ising spin problem with arbitrary pairwise interaction structure, the corresponding graph must be minor-embedded into a Chimera graph. We define a combinatorial class of native clique minors in Chimera graphs with vertex images of uniform, near minimal size and provide a polynomial-time algorithm that finds a maximum native clique minor in a given induced subgraph of a Chimera graph. These minors allow improvement over recent work and have immediate practical applications in the field of quantum annealing.

Fast clique minor generation in Chimera qubit connectivity graphs

This paper discusses techniques for solving discrete optimization problems using quantum annealing. Practical issues likely to affect the computation include precision limitations, finite temperature, bounded energy range, sparse connectivity, and small numbers of qubits. To address these concerns we propose a way of finding energy representations with large classical gaps between ground and first excited states, efficient algorithms for mapping non-compatible Ising models into the hardware, and the use of decomposition methods for problems that are too large to fit in hardware. We validate the approach by describing experiments with D-Wave quantum hardware for low density parity check decoding with up to 1000 variables.

/pdf/discrete-optimization-using-quantum-annealing-on-sparse-2s4ln8iaq5.pdf

Discrete optimization using quantum annealing on sparse Ising models

This paper presents an overview of the topology of D-Wave's next-generation quantum processors. It provides examples of minor embeddings and discusses performance of embedding algorithms for the new topology compared to the existing Chimera topology. It also presents some initial performance results for simple, standard Ising model classes of problems.

Aidan Roy

Papers

A practical heuristic for finding graph minors

Equiangular lines, mutually unbiased bases, and spin models

Fast clique minor generation in Chimera qubit connectivity graphs

Discrete optimization using quantum annealing on sparse Ising models

Next-Generation Topology of D-Wave Quantum Processors