Le contenu de cette page n’est pas disponible en français. Veuillez nous en excuser.

Perimeter Institute Quantum Discussions

This series consists of weekly discussion sessions on foundations of quantum Theory and quantum information theory. The sessions start with an informal exposition of an interesting topic, research result or important question in the field. Everyone is strongly encouraged to participate with questions and comments.

Seminar Series Events/Videos

Currently there are no upcoming talks in this series.


Mercredi nov 06, 2019

Connections between 2D gapped quantum phases and the anyon fusion theory have been proven in various ways under different settings. In this work, we introduce a new framework connecting them by only assuming a conjectured form of entanglement area law for 2D gapped systems. We show that one can systematically define topological charges and fusion rules from the area law alone, in a well-defined way. We then derive the fusion rules of charges satisfy all the axioms required in the algebraic theory of anyons.

Scientific Areas: 


Mercredi oct 30, 2019

 Holographic quantum error correcting codes (HQECC) have been proposed as toy models for the AdS/CFT correspondence, and exhibit many of the features of the duality. HQECC give a mapping of states and observables. However, they do not map local bulk Hamiltonians to local Hamiltonians on the boundary. In this work, we combine HQECC with Hamiltonian simulation theory to construct a bulk-boundary mapping between local Hamiltonians, whilst retaining all the features of the HQECC duality.


Lundi oct 28, 2019

We give a quantum speedup for solving the canonical semidefinite programming relaxation for binary quadratic optimization. The class of relaxations for combinatorial optimization has so far eluded quantum speedups. Our methods combine ideas from quantum Gibbs sampling and matrix exponent updates. A de-quantization of the algorithm also leads to a faster classical solver. For generic instances, our quantum solver gives a nearly quadratic speedup over state-of-the-art algorithms.
This is joint work with Fernando Brandao (Caltech) and Daniel Stilck Franca (QMATH, Copenhagen).


Mercredi oct 16, 2019

The mixing time of Markovian dissipative evolutions of open quantum many-body systems can be bounded using optimal constants of certain quantum functional inequalities, such as the logarithmic Sobolev constant. For classical spin systems, the positivity of such constants follows from a mixing condition for the Gibbs measure, via quasi-factorization results for the entropy.



Jeudi oct 10, 2019

Quantum complexity is a notion characterizing the universality of the entanglement arising from a quantum evolution. A universal evolution will result in a complex entanglement. At the same time, this also corresponds to small fluctuations and to unlearnability from the point of view of machine learning. All these aspects are connected to the different features of k-designs, which are under-samplings of the Hilbert space. 


Mercredi oct 09, 2019

I will describe some connections between the Eigenstate Thermalization Hypothesis (ETH), the entanglement structure of generic excited eigenstates of chaotic quantum systems ("EE", arXiv:1906.04295), and the "bound on chaos" limiting the growth rate of the out-of-time-order four-point correlator in such systems ("OTOC", arXiv:1906.10808).


Mercredi aoû 28, 2019

In quantum error correcting codes, there is a distinction
between coherent and incoherent noise. Coherent noise can cause the
average infidelity to accumulate quadratically when a fixed channel is
applied many times in succession, rather than linearly as in the case
of incoherent noise. I will present a proof that unitary single qubit
noise in the 2D toric code with minimum weight decoding is mapped to
less coherent logical noise, and as the code size grows, the coherence
of the logical noise channel is suppressed. In the process, I will


Jeudi aoû 08, 2019

The out-of-time-ordered correlator (OTOC) and entanglement are two physically motivated and widely used probes of the ``scrambling'' of quantum information, which has drawn great interest recently in quantum gravity and many-body physics. By proving upper and lower bounds for OTOC saturation on graphs with bounded degree and a lower bound for entanglement on general graphs, we show that the time scales of scrambling as given by the growth of OTOC and entanglement entropy can be asymptotically separated in a random quantum circuit model defined on graphs with a tight bottleneck.


Mercredi mai 15, 2019

We study approximate quantum low-density parity-check (QLDPC) codes, which are approximate quantum error-correcting codes specified as the ground space of a frustration-free local Hamiltonian, whose terms do not necessarily commute. Such codes generalize stabilizer QLDPC codes, which are exact quantum error-correcting codes with sparse, low-weight stabilizer generators (i.e. each stabilizer generator acts on a few qubits, and each qubit participates in a few stabilizer generators).

Scientific Areas: 


Mercredi mai 08, 2019

One of the central problems in the study of quantum resource theories is to provide a given resource with an operational meaning, characterizing physical tasks relevant to information processing in which the resource can give an explicit advantage over all resourceless states. We show that this can always be accomplished for all convex resource theories. We establish in particular that any resource state enables an advantage in a channel discrimination task, allowing for a strictly greater success probability than any state without the given resource.

Scientific Areas: