It is known that several sub-universal quantum computing models, such as the IQP model, Boson sampling model, and the one-clean qubit model, cannot be classically simulated unless the polynomial-time hierarchy collapses. However, these results exclude only polynomial-time classical simulations. In this talk, based on fine-grained complexity conjectures, I show more ``fine-grained" quantum supremacy results that prohibit certain exponential-time classical simulations. (Morimae and Tamaki, arXiv:1901.01637)
Join us for three days at the Institute for Quantum Computing (IQC) for Schrödinger's Class November 22 – 24, 2019. You will have the opportunity to attend lectures and engage in hands-on activities focused on the integration of quantum technology into the current teaching curriculum. We will discuss quantum information science and technology to give you a deeper understanding of quantum mechanics.
The deadline to apply is Friday, October 4, 2019.
Results from the first digital quantum simulation of an SU(2) gauge theory are presented. This was done by analytically constructing gauge-invariant states and implementing a Trotterized time evolution operator for that basis on superconducting hardware. By using error mitigation techniques, electric energy measurements could be reliably extracted following one Trotter-Suzuki time step. This work is a small but important step toward determining what field-theoretic calculations will be possible using near-term devices.
A long standing issue in quantum information theory is to understand the quantum capacity. One main reason for our lack of understanding is the non-additivity of the one-shot quantum capacity. Another reason is the absence of clarity about noisy quantum channels that have positive quantum capacity.
In order to perform universal fault-tolerant quantum computation, one needs to implement a logical non-Clifford gate. Consequently, it is important to understand codes that implement such gates transversally. In this paper, we adopt an algebraic approach to characterize all stabilizer codes for which transversal T and T^{-1} gates preserve the codespace. Our Heisenberg perspective reduces this question to a finite geometry problem that translates to the design of certain classical codes. We prove three corollaries of this result:
