Format results
-
Entropy decay for Davies semigroups of a one dimensional quantum lattice
Angela Capel - Instituto de Ciencias Matemáticas (ICMAT)
-
Conservation laws and quantum error correction
Benjamin Brown - University of Sydney
-
Complexity and entropy in quantum many-body systems
Philippe Faist - California Institute of Technology
-
Error-corrected quantum metrology
Sisi Zhou - Perimeter Institute for Theoretical Physics
-
Predicting many properties of quantum systems with chaotic dynamics
Hong-Ye Hu - University of California, San Diego
-
Quantum Scientific Computation
Jin-Peng Liu - University of New Mexico
-
Probing topological invariants from a ground state wave function
Ze-Pei Cian - University of New Mexico
-
Matrix-valued logarithmic Sobolev inequalities
Haojian Li - Baylor University
-
Quantum Algorithms for Classical Sampling Problems
Dominik Wild - Max Planck Institute of Quantum Optics
-
Spectral analysis of product formulas for quantum simulation
Changhao Yi - University of New Mexico
-
Exponential Error Suppression for Near-Term Quantum Devices
Balint Koczor - University of Oxford
-
Quantum Lego: Building Quantum Error Correction Codes from Tensor Networks
Charles Cao - Virginia Polytechnic Institute and State University
-
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… -
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… -
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… -
Error-corrected quantum metrology
Sisi Zhou - Perimeter Institute for Theoretical Physics
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… -
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… -
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… -
Probing topological invariants from a ground state wave function
Ze-Pei Cian - University of New Mexico
With the rapid development of programmable quantum simulators, the quantum states can be controlled with unprecedented precision. Thus, it opens a new opportunity to explore the strongly correlated phase of matter with new quantum technology platforms. In quantum simulators, one can engineer… -
Matrix-valued logarithmic Sobolev inequalities
Haojian Li - Baylor University
Logarithmic Sobolev inequalities (LSI) were first introduced by Gross in the 1970s as an equivalent formulation of hypercontractivity. LSI have been well studied in the past few decades and found applications to information theory, optimal transport, and graph theory. Recently matrix-valued LSI have… -
Quantum Algorithms for Classical Sampling Problems
Dominik Wild - Max Planck Institute of Quantum Optics
Sampling from classical probability distributions is an important task with applications in a wide range of fields, including computational science, statistical physics, and machine learning. In this seminar, I will present a general strategy of solving sampling problems on a quantum computer. The… -
Spectral analysis of product formulas for quantum simulation
Changhao Yi - University of New Mexico
Trotter-Suzuki formula is a practical and efficient algorithm for Hamiltonian simulation. It has been widely used in quantum chemistry, quantum field theory and condensed matter physics. Usually, its error is quantified by the operator norm distance between the ideal evolution operator and the… -
Exponential Error Suppression for Near-Term Quantum Devices
Balint Koczor - University of Oxford
Suppressing noise in physical systems is of fundamental importance. As quantum computers mature, quantum error correcting codes (QECs) will be adopted in order to suppress errors to any desired level. However in the noisy, intermediate-scale quantum (NISQ) era, the complexity and scale required to… -
Quantum Lego: Building Quantum Error Correction Codes from Tensor Networks
Charles Cao - Virginia Polytechnic Institute and State University
We introduce a flexible and graphically intuitive framework that constructs complex quantum error correction codes from simple codes or states, generalizing code concatenation. More specifically, we represent the complex code constructions as tensor networks built from the tensors of simple codes or…