Drupal-Biblio17<style face="normal" font="default" size="100%">Preparing Renormalization Group Fixed Points on NISQ Hardware</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Approximate optimization of MAXCUT with a local spin algorithm</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Polynomial Time Algorithms for Estimating Spectra of Adiabatic Hamiltonians</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Quantum Algorithm for Simulating the Wave Equation</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Site-by-site quantum state preparation algorithm for preparing vacua of fermionic lattice field theories </style>Drupal-Biblio17<style face="normal" font="default" size="100%">BQP-completeness of Scattering in Scalar Quantum Field Theory</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Diffusion Monte Carlo Versus Adiabatic Computation for Local Hamiltonians</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Quantum Cryptanalysis: Shor, Grover, and Beyond</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Experimentally Generated Random Numbers Certified by the Impossibility of Superluminal Signaling</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Fast optimization algorithms and the cosmological constant</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Fast quantum computation at arbitrarily low energy</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Modulus of continuity eigenvalue bounds for homogeneous graphs and convex subgraphs with applications to quantum Hamiltonians</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Adiabatic optimization versus diffusion Monte Carlo</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Black Holes, Quantum Mechanics, and the Limits of Polynomial-time Computability</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Grover search and the no-signaling principle</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Yang-Baxter operators need quantum entanglement to distinguish knots</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Adiabatic optimization without local minima</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Classical simulation of Yang-Baxter gates</style>Drupal-Biblio17<style face="normal" font="default" size="100%">The Fundamental Gap for a Class of Schrödinger Operators on Path and Hypercube Graphs</style>Drupal-Biblio10<style face="normal" font="default" size="100%">Partial-indistinguishability obfuscation using braids</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Quantum Algorithms for Fermionic Quantum Field Theories</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Quantum Computation of Scattering in Scalar Quantum Field Theories</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Strong Equivalence of Reversible Circuits is coNP-complete</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Testing quantum expanders is co-QMA-complete</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Achieving perfect completeness in classical-witness quantum Merlin-Arthur proof systems</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Quantum Algorithms for Quantum Field Theories</style>Drupal-Biblio10<style face="normal" font="default" size="100%">Approximating the Turaev-Viro Invariant of Mapping Tori is Complete for One Clean Qubit</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Approximating Turaev-Viro 3-manifold invariants is universal for quantum computation </style>Drupal-Biblio17<style face="normal" font="default" size="100%">On the degeneracy of SU(3)k topological phases</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Permutational Quantum Computing</style>Drupal-Biblio17<style face="normal" font="default" size="100%">QMA-complete problems for stoquastic Hamiltonians and Markov matrices</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Discrete-query quantum algorithm for NAND trees</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Efficient quantum circuits for arbitrary sparse unitaries</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Efficient quantum processing of ideals in finite rings</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Estimating Jones and HOMFLY polynomials with One Clean Qubit</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Estimating Jones polynomials is a complete problem for one clean qubit</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Fast quantum algorithms for approximating some irreducible representations of groups </style>Drupal-Biblio17<style face="normal" font="default" size="100%">Perturbative Gadgets at Arbitrary Orders</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Polynomial-time quantum algorithm for the simulation of chemical dynamics </style>Drupal-Biblio17<style face="normal" font="default" size="100%">Quantum Computation Beyond the Circuit Model</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Error correcting codes for adiabatic quantum computation</style>Drupal-Biblio17<style face="normal" font="default" size="100%">Fast quantum algorithm for numerical gradient estimation</style>