3 citations · 7 across the 6 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
quant-ph2023
Public-key pseudoentanglement and the hardness of learning ground state entanglement structure
Adam Bouland, Bill Fefferman, Soumik Ghosh +4
Given a local Hamiltonian, how difficult is it to determine the entanglement structure of its ground state? We show that this problem is computationally intractable even if one is…
quant-ph2023
Unitary Complexity and the Uhlmann Transformation Problem
John Bostanci, Yuval Efron, Tony Metger +3
State transformation problems such as compressing quantum information or breaking quantum commitments are fundamental quantum tasks. However, their computational difficulty cannot…
quant-ph2023
stateQIP = statePSPACE
Tony Metger, Henry Yuen
Complexity theory traditionally studies the hardness of solving classical computational problems. In the quantum setting, it is also natural to consider a different notion of compl…