Search results in Quantum Physics from PIRSA
Format results
-
-
Complexity of the python’s lunch and quantum gravity in the lab
Hrant Gharibyan Stanford University
-
Entropy decay for Davies semigroups of a one dimensional quantum lattice
Angela Capel Instituto de Ciencias Matemáticas (ICMAT)
-
Exploring quantum correlations in causal networks
George Moreno Universidade Federal do Rio Grande do Norte
-
Conservation laws and quantum error correction
Benjamin Brown University of Sydney
-
The Page-Wootters formalism: Where are we now?
Alexander Smith Saint Anselm College
-
Complexity and entropy in quantum many-body systems
Philippe Faist California Institute of Technology
-
-
The Story of Anyons
Steve Simon University of Oxford - Rudolf Peierls Centre for Theoretical Physics
-
Inspiring new research directions with AI
Mario Krenn Max Planck Institute for the Science of Light
-
Predicting many properties of quantum systems with chaotic dynamics
Hong-Ye Hu University of California, San Diego
-
-
Detecting nonclassicality in restricted general probabilistic theories
Leevi Leppajarvi University of Turku
The formalism of general probabilistic theories provides a universal paradigm that is suitable for describing various physical systems including classical and quantum ones as particular cases. Contrary to the often assumed no-restriction hypothesis, the set of accessible measurements within a given theory can be limited for different reasons, and this raises a question of what restrictions on measurements are operationally relevant. We argue that all operational restrictions must be closed under simulation, where the simulation scheme involves mixing and classical post-processing of measurements. We distinguish three classes of such operational restrictions: restrictions on measurements originating from restrictions on effects; restrictions on measurements that do not restrict the set of effects in any way; and all other restrictions. As a setting to detect nonclassicality in restricted theories we consider generalizations of random access codes, an intriguing class of communication tasks that reveal an operational and quantitative difference between classical and quantum information processing. We formulate a natural generalization of them, called random access tests, which can be used to examine collective properties of collections of measurements. We show that the violation of a classical bound in a random access test is a signature of either measurement incompatibility or super information storability, and that we can use them to detect differences in different restrictions.
-
Complexity of the python’s lunch and quantum gravity in the lab
Hrant Gharibyan Stanford University
This talk consists of two parts. At first, I will focus on geometric obstructions to decoding Hawking radiation (python’s lunch). Harlow and Hayden argued that distilling information out of Hawking radiation is computationally hard despite the fact that the quantum state of the black hole and its radiation is relatively un-complex. I will trace this computational difficulty to a geometric obstruction in the Einstein-Rosen bridge connecting the black hole and its radiation. Inspired by tensor network models, I will present a conjecture that relates the computational hardness of distilling information to geometric features of the wormhole.
Then, with the long-term goal of studying quantum gravity in the lab, I will discuss a proposal for a holographic teleportation protocol that can be readily executed in table-top experiments. This protocol exhibits similar behavior to that seen in recent traversable wormhole constructions. I will introduce the concept of "teleportation by size" to capture how the physics of operator-size growth naturally leads to information transmission. The transmission of a signal through a semi-classical holographic wormhole corresponds to a rather special property of the operator-size distribution we call "size winding".Zoom Link: https://pitp.zoom.us/j/93957279481?pwd=eGVTU1MwOGNWNkMyYlRiWGo0QnFldz09
-
Entropy decay for Davies semigroups of a one dimensional quantum lattice
Angela Capel Instituto de Ciencias Matemáticas (ICMAT)
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, which is equivalent to some form of entropy decay. For classical spin systems, the positivity of such constants follows from a mixing condition on the Gibbs measure, via quasi-factorization results for the entropy. Inspired by the classical case, we present a strategy to derive the positivity of the logarithmic Sobolev constant associated to the dynamics of certain quantum systems from some clustering conditions on the Gibbs state of a local, commuting Hamiltonian. Subsequently, we apply it to show that for a finite-range, translation-invariant commuting Hamiltonian on a spin chain, the Davies semigroup describing the reduced dynamics resulting from the joint Hamiltonian evolution of a spin chain weakly coupled to a large heat bath thermalizes rapidly at any temperature. This, in particular, rigorously establishes the absence of dissipative phase transition for Davies evolutions over translation-invariant spin chains.
-
Exploring quantum correlations in causal networks
George Moreno Universidade Federal do Rio Grande do Norte
Bell’s theorem is typically understood as proof that quantum theory is incompatible with local hidden variable (LHV) models. In recent years, however, LHV models have been recognized as a particular and simple case of much more general causal networks that can give rise to new and stronger forms of nonclassicality. And, since nonlocality is a resource in a variety of applications, it is thus natural to ask whether these novel forms of nonclassical behavior can also be put to use in information processing. In this seminar, I will present recent results exploring quantum correlations in several such causal scenarios, ranging from foundational questions such as freedom of choice in Bell experiments to more applied situations covering cryptography, distributed computing, and game theory.
Zoom Link: TBD
-
Conservation laws and quantum error correction
Benjamin Brown University of Sydney
A quantum error-correcting code depends on a classical decoding algorithm that uses the outcomes of stabilizer measurements to determine the error that needs to be repaired. Likewise, the design of a decoding algorithm depends on the underlying physics of the quantum error-correcting code that it needs to decode. The surface code, for instance, can make use of the minimum-weight perfect-matching decoding algorithm to pair the defects that are measured by its stabilizers due to its underlying charge parity conservation symmetry. In this talk I will argue that this perspective on decoding gives us a unifying principle to design decoding algorithms for exotic codes, as well as new decoding algorithms that are specialised to the noise that a code will experience. I will describe new decoders for exotic fracton codes we have designed using these principles. I will also discuss how the symmetries of a code change if we focus on restricted noise models, and how we have leveraged this observation to design high-threshold decoders for biased noise models. In addition to these examples, this talk will focus on recent work on decoding the color code, where we found a high-performance decoder by investigating the defect conservation laws at the boundaries of the color code. Remarkably, our results show that we obtain an advantage by decoding this planar quantum error-correcting code by matching defects on a manifold that has the topology of a Moebius strip.
Zoom Link: https://pitp.zoom.us/j/91540245974?pwd=RDkzaVJZZ2tkTldxM2pkdXU5VHlIZz09
-
The Page-Wootters formalism: Where are we now?
Alexander Smith Saint Anselm College
General relativity does not distinguish a preferred reference frame, and conservatively one ought to expect that its quantization does not necessitate such background structure. However, this desire stands in contrast to orthodox formulations of quantum theory which rely on a background time parameter external to the theory, and in the case of quantum field theory a spacetime foliation. Such considerations have led to the development of the Page-Wootters formalism, which seeks to describe motion relative to a reference frame internal to a quantum theory that encompasses both the system of interest and employed reference frame. I will begin by reviewing a modern formulation of the Page-Wootters formalism in terms of Hamiltonian constraints, generalized coherent states, and covariant time observables. I will then present Kuchar’s criticisms of the Page-Wootters formalism, and discuss their resolution by showing the equivalence between the formalism and relational Dirac observables. These Dirac observables will then be used to introduce a gauge-invariant, relational notion of subsystems and entanglement. Finally, a field-theoretic extension of the Page-Wootters formalism will be introduced and used to recover the Schwinger-Tomonaga equation.
Zoom Link: https://pitp.zoom.us/j/91420728439?pwd=cXlGZ21tTGZEUjFDVjRKMWxaVFlVZz09
-
Complexity and entropy in quantum many-body systems
Philippe Faist California Institute of Technology
Quantifying quantum states' complexity is a key problem in various subfields of science, from quantum computing to black-hole physics. Motivated by the expected behavior of wormholes in quantum gravity, Brown and Susskind conjectured that the quantum complexity of the state output by a random circuit on n qubits grows linearly as more and more random gates are applied, until saturating after a number of gates exponential in n. We prove this conjecture by studying the dimension of the set of all unitaries that can be accessed with a given arrangement of two-qubit gates. Our core technical contribution is a lower bound on this dimension, using techniques from algebraic geometry and considerations based on Clifford circuits. In the second part of my talk, I'll discuss some thermodynamic and effective information-theoretic aspects of the complexity of quantum states and its growth in quantum many-body systems, establishing a resource theory to capture a notion of quantum complexity and drawing a connection between the concepts of complexity and entropy.
Joint work with: Jonas Haferkamp, Teja Naga Bhavia Kothakonda, Anthony Munson, Jens Eisert, Nicole Yunger Halpern
Zoom Link: https://pitp.zoom.us/j/94288479163?pwd=Nm8wOUdReGhreDErdUpJTzFETlBUUT09 -
Error-corrected quantum metrology
Quantum metrology, which studies parameter estimation in quantum systems, has many important applications in science and technology, ranging from frequency spectroscopy to gravitational wave detection. Quantum mechanics imposes a fundamental limit on the estimation precision, called the Heisenberg limit, which is achievable in noiseless quantum systems, but is in general not achievable in noisy systems. This talk is a summary of some recent works by the speaker and collaborators on error-corrected quantum metrology. Specifically, we present a necessary and sufficient condition for achieving the Heisenberg limit in noisy quantum systems. When the condition is satisfied, the Heisenberg limit is recovered by a quantum error correction protocol which corrects all noises while maintaining the signal; when it is violated, we show the estimation limit still in general has a constant factor improvement over classical strategies, and is achievable using approximate quantum error correction. Both error correction protocols can be optimized using semidefinite programs. Examples in some typical noisy systems will be provided.
Zoom Link: https://pitp.zoom.us/j/95698542740?pwd=OWJtcTViKzZqNDg1bWk4cDFtaTRxZz09
-
The Story of Anyons
Steve Simon University of Oxford - Rudolf Peierls Centre for Theoretical Physics
I will review the history of anyons, particles that are neither bosons nor fermions, starting with their theoretical proposal all the way to their definitive experimental observation over 40 years later. I will further discuss why the more general idea of non-abelian anyons is of intense interest for quantum computation. If time permits I will give a status report on some of the current non-abelian anyon experiments.
Zoom Link: https://pitp.zoom.us/j/98698779123?pwd=SWIyak9OZ0dud2ZGcWdoazdkVURHQT09
-
Inspiring new research directions with AI
Mario Krenn Max Planck Institute for the Science of Light
The vast and growing number of publications in all disciplines of science cannot be comprehended by a single human researcher. As a consequence, researchers have to specialize in narrow subdisciplines, which makes it challenging to uncover scientific connections beyond the own field of research.
In my talk, I will present a possible solution: I demonstrate the development of a semantic network for quantum physics (SemNet), using 750,000 scientific papers and knowledge from books and Wikipedia. I use it in conjunction with an artificial neural network for predicting future research directions. Finally, I show first indications how individual scientists can use SemNet for suggesting and inspiring personalized, out-of-the-box ideas.
I believe that computer-inspired scientific ideas will play a significant role in accelerating scientific progress, and am looking forward hearing your thoughts and ideas about this crucial question.
References
[1] Mario Krenn, Anton Zeilinger, Predicting research trends with semantic and neural networks with an application in quantum physics, PNAS 117(4) 1910-1916 (2020).
[2] IEEE BigData 2021 competition: Science4Cast: https://github.com/iarai/science4castZoom Link: https://pitp.zoom.us/j/92240839439?pwd=LytUTHlMWE9ycjlsUXJkdHRta2c1UT09
-
Predicting many properties of quantum systems with chaotic dynamics
Hong-Ye Hu University of California, San Diego
Classical shadow tomography provides an efficient method for predicting functions of an unknown quantum state from a few measurements of the state. It relies on a unitary channel that efficiently scrambles the quantum information of the state to the measurement basis. However, it is quite challenging to realize deep unitary circuits on near-term quantum devices, and an unbiased reconstruction map is non-trivial to find for arbitrary random unitary ensembles. In this talk, I will discuss our recent progress on combining classical shadow tomography with quantum chaotic dynamics. Particularly, I will introduce two new families of shadow tomography schemes: 1) Hamiltonian-driven shadow tomography and 2) Classical shadow tomography with locally scrambled quantum dynamics. In both works, I’ll derive the unbiased reconstruction map, and analyze the sample complexity. In the Hamiltonian-driven scheme, I will illustrate how to use proper time windows to achieve a more efficient tomography. In the second work, I will demonstrate advantages of shadow tomography in the shallow circuit region. Then I’ll conclude by discussing approximate shadow tomography with local Hamiltonian dynamics, and demonstrate that a single quench-disordered quantum spin chain can be used for approximate shadow tomography.
References:
[1] Hong-Ye Hu, Yi-Zhuang You. “Hamiltonian-Driven Shadow Tomography of Quantum States”. arXiv:2102.10132 (2021)
[2] Hong-Ye Hu, Soonwon Choi, Yi-Zhuang You. “Classical Shadow Tomography with Locally Scrambled Quantum Dynamics”. arXiv: 2107.04817 (2021)Zoom Link: https://pitp.zoom.us/j/99011187936?pwd=OVU3VkpyZ21YcXRCOW5DOHlnSWlVQT09
-
Quantum Scientific Computation
Jin-Peng Liu University of New Mexico
Quantum computers are expected to dramatically outperform classical computers for certain computational problems. While there has been extensive previous work for linear dynamics and discrete models, for more complex realistic problems arising in physical and social science, engineering, and medicine, the capability of quantum computing is far from well understood. One fundamental challenge is the substantial difference between the linear dynamics of a system of qubits and real-world systems with continuum, stochastic, and nonlinear behaviors. Utilizing advanced linear algebra techniques and nonlinear analysis, I attempt to build a bridge between classical and quantum mechanics, understand and optimize the power of quantum computation, and discover new quantum speedups over classical algorithms with provable guarantees. In this talk, I would like to cover quantum algorithms for scientific computational problems, including topics such as linear, nonlinear, and stochastic differential equations, with applications in areas such as quantum dynamics, biology and epidemiology, fluid dynamics, and finance.
Reference:
Quantum spectral methods for differential equations, Communications in Mathematical Physics 375, 1427-1457 (2020), https://arxiv.org/abs/1901.00961
High-precision quantum algorithms for partial differential equations, Quantum 5, 574 (2021), https://arxiv.org/abs/2002.07868
Efficient quantum algorithm for dissipative nonlinear differential equations, Proceedings of the National Academy of Sciences 118, 35 (2021), https://arxiv.org/abs/2011.03185
Quantum-accelerated multilevel Monte Carlo methods for stochastic differential equations in mathematical finance, Quantum 5, 481 (2021), https://arxiv.org/abs/2012.06283