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.
It is believed that active quantum error correction will be an essential ingredient to build a scalable quantum computer. The currently favored scheme is the surface code due to its high decoding threshold and efficient decoding algorithm. However, it suffers from large overheads which are even more severe when parity check measurements are subject to errors and have to be repeated. Furthermore, the number of encoded qubits in the surface code does not grow with system size, leading to a sub-optimal use of the physical qubits.
The area law for entanglement provides one of the most important connections between information theory and quantum many-body physics. It is not only related to the universality of quantum phases, but also to efficient numerical simulations in the ground state (i.e., the lowest energy state). Various numerical observations have led to a strong belief that the area law is true for every non-critical phase in short-range interacting systems [1].
We investigate weak coin flipping, a fundamental cryptographic primitive where two distrustful parties need to remotely establish a shared random bit. A cheating player can try to bias the output bit towards a preferred value. A weak coin-flipping protocol has a bias ϵ if neither player can force the outcome towards their preferred value with probability more than 1/2+ϵ. While it is known that classically ϵ=1/2, Mochon showed in 2007 [arXiv:0711.4114] that quantumly weak coin flipping can be achieved with arbitrarily small bias, i.e.
The quantum Fisher information (QFI) measures the amount of information that a quantum state carries about an unknown parameter. Given a quantum channel, its entanglement-assisted QFI is the maximum QFI of the output state assuming an input state over the system and an arbitrarily large ancilla. Consider N identical copies of a quantum channel, the channel QFI grows either linearly or quadratically with N asymptotically. Here we obtain a simple criterion that determines whether the scaling is linear or quadratic.
Motivated by puzzles in quantum gravity AdS/CFT, Lenny Susskind posed the following question: supposing one had the technological ability to distinguish a macroscopic superposition of two given states |v> and |w> from incoherent mixture of those states, would one also have the technological ability to map |v> to |w> and vice versa? More precisely, how does the quantum circuit complexity of the one task relate to the quantum circuit complexity of the other? Here we resolve Susskind's question -- showing that the two complexities are essentially identical, even for approximate v
This talk is a progress report on ongoing research. I will explain what resource theories have to do with real algebraic geometry, and then present a preliminary result in real algebraic geometry which can be interpreted as a theorem on asymptotic and catalytic resource orderings.
It reproves the known criterion for asymptotic and catalytic majorization in terms of Rényi entropies, and generalizes it to any resource theory which satisfies a mild boundedness hypothesis. I will sketch the case of matrix majorization as an example.
We show that a generic many-body Hamiltonian can be uniquely reconstructed from a single pair of initial-final states under the unitary time evolution. Interesting it is, this method is not practical due to its high complexity. We then propose a practical method for Hamiltonian reconstruction from multiple pairs of initial-final states. The stability of this method is mathematically proved and numerically verified.
This work is joint with Liujun Zou and Timothy Hsieh.
In quantum spin systems, the existence of a spectral gap above the ground state has strong implications for the low-energy physics. We survey recent results establishing spectral gaps in various frustration-free spin systems by verifying finite-size criteria. The talk is based on collaborations with Abdul-Rahman, Lucia, Mozgunov, Nachtergaele, Sandvik, Yang, Young, and Wang.