The following pages link to Dorit Aharonov (Q835646):
Displaying 22 items.
- The power of quantum systems on a line (Q842451) (← links)
- The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\) (Q2018136) (← links)
- On quantum advantage in information theoretic single-server PIR (Q2292696) (← links)
- A Simpler Proof of the Existence of Quantum Weak Coin Flipping with Arbitrarily Small Bias (Q2805518) (← links)
- Quantum bit escrow (Q3192045) (← links)
- Fault-Tolerant Quantum Computation with Constant Error Rate (Q3395030) (← links)
- Quantum Locally Testable Codes (Q3449558) (← links)
- Lattice problems in NP ∩ coNP (Q3546284) (← links)
- Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation (Q3548553) (← links)
- Adiabatic quantum state generation and statistical zero knowledge (Q3581286) (← links)
- (Q4526981) (← links)
- (Q4542516) (← links)
- (Q5090371) (← links)
- The BQP-hardness of approximating the Jones polynomial (Q5135831) (← links)
- The detectability lemma and quantum gap amplification (Q5172736) (← links)
- Quantum walks on graphs (Q5175952) (← links)
- Adiabatic Quantum State Generation (Q5454243) (← links)
- On the Complexity of Commuting Local Hamiltonians, and Tight Conditions for Topological Order in Such Systems (Q5494974) (← links)
- The 1D Area Law and the Complexity of Quantum States: A Combinatorial Approach (Q5495021) (← links)
- (Q5889068) (← links)
- A polynomial quantum algorithm for approximating the Jones polynomial (Q5891928) (← links)
- A polynomial quantum algorithm for approximating the Jones polynomial (Q5896964) (← links)
