2 citations · 4 across the 5 of their papers we have counts for
7 papers
Anti-symmetrization is cheap and useful
Adam Bene Watts, John Bostanci, Matthias C. Caro +3
We consider the computational task of anti-symmetrization of an unknown mixed quantum state: Given iid copies of a rank- qudit state $ρ=\sum_{i=1}^r λ_i |φ_i\rangle\!\langleφ_i|…
A quantum oracle separation between QMA(2) and QMA
John Bostanci, Sabee Grewal, Jonas Haferkamp +4
We find a quantum oracle relative to which . As a consequence, we resolve the no-disentanglers conjecture of Watrous: for every , any $(ε,…
Separating Quantum and Classical Advice with Good Codes
John Bostanci, Andrew Huang, Vinod Vaikuntanathan
We show an unconditional classical oracle separation between the class of languages that can be verified using a quantum proof () and the class of languages that can…
Learning the closest product state
Ainesh Bakshi, John Bostanci, William Kretschmer +5
We study the problem of finding a (pure) product state with optimal fidelity to an unknown -qubit quantum state , given copies of . This is a basic instance of a fundament…
Commuting Local Hamiltonians Beyond 2D
John Bostanci, Yeongwoo Hwang
Commuting local Hamiltonians provide a testing ground for studying many of the most interesting open questions in quantum information theory, including the quantum PCP conjecture a…
Quantum Event Learning and Gentle Random Measurements
Adam Bene Watts, John Bostanci
We prove the expected disturbance caused to a quantum system by a sequence of randomly ordered two-outcome projective measurements is upper bounded by the square root of the probab…
Finding the disjointness of stabilizer codes is NP-complete
John Bostanci, Aleksander Kubica
The disjointness of a stabilizer code is a quantity used to constrain the level of the logical Clifford hierarchy attainable by transversal gates and constant-depth quantum circuit…