Format results
-
Optimizing fermionic Hamiltonians with classical interactions
Maarten Stroeks - Delft University of Technology
-
-
-
(Towards a) Complexity theory for NLQC
Alex May - Perimeter Institute for Theoretical Physics
-
Optimal cloning of free-fermion states
Yaroslav Herasymenko - Perimeter Institute for Theoretical Physics
-
Lee-Yang tensors and Hamiltonian complexity
David Gosset - Institute for Quantum Computing (IQC)
-
Instance-optimal high-precision shadow tomography with few-copy measurements
Sisi Zhou - Perimeter Institute for Theoretical Physics
-
On constant T-depth circuits
Isaac Kim - University of California, Davis
-
-
Baby Universes from Thermal Pure States in SYK
Martin Sasieta - Brandeis University
-
A Formalization of the Generalized Quantum Stein's Lemma in Lean
Rodolfo Reis Soldati - Institute for Quantum Computing (IQC)
-
-
Optimizing fermionic Hamiltonians with classical interactions
Maarten Stroeks - Delft University of Technology
We consider the optimization problem (ground energy search) for fermionic Hamiltonians with classical interactions. This QMA-hard problem is motivated by the Coulomb electron-electron interaction being diagonal in the position basis, a fundamental fact that underpins electronic-structure… -
-
-
-
Optimal cloning of free-fermion states
Yaroslav Herasymenko - Perimeter Institute for Theoretical Physics
-
-
Instance-optimal high-precision shadow tomography with few-copy measurements
Sisi Zhou - Perimeter Institute for Theoretical Physics
We give the first instance-optimal sample complexity bounds for shadow tomography using few-copy measurements in the high-precision regime. More concretely, we study the problem of learning expectation values of a given set of observables of an unknown quantum state to precision $\epsilon$ in $L_p$… -
On constant T-depth circuits
Isaac Kim - University of California, Davis
I will discuss some surprising examples of quantum circuits that can be realized in constant T-depth. Some of these constructions, such as single-qubit rotation and its programmable variants, as well as quantum part of Shor's factoring algorithm, require a catalyst state. But there are also other… -
-
-
A Formalization of the Generalized Quantum Stein's Lemma in Lean
Rodolfo Reis Soldati - Institute for Quantum Computing (IQC)
The Generalized Quantum Stein's Lemma is a theorem in quantum hypothesis testing that provides an operational meaning to the relative entropy within the context of quantum resource theories. Its original proof was found to have a gap, which led to a search for a corrected proof. We formalize the… -
Hamiltonian Decoded Quantum Interferometry for General Pauli Hamiltonians
Kaifeng Bu
Decoded Quantum Interferometry (DQI) has been recently proposed as a new quantum algorithm for optimization. Hamiltonian Decoded Quantum Interferometry (HDQI), an extension of DQI, adapts this paradigm to Hamiltonian optimization and Gibbs state preparation. In this work, I will introduce HDQI for…