211 citations · 1.2k across the 74 of their papers we have counts for
5 papers · 2 filters
Quantum Speed-up for Approximating Partition Functions
Pawel Wocjan, Chen-Fu Chiang, Anura Abeyesinghe +1
We achieve a quantum speed-up of fully polynomial randomized approximation schemes (FPRAS) for estimating partition functions that combine simulated annealing with the Monte-Carlo…
Preparing ground states of quantum many-body systems on a quantum computer
David Poulin, Pawel Wocjan
Preparing the ground state of a system of interacting classical particles is an NP-hard problem. Thus, there is in general no better algorithm to solve this problem than exhaustive…
Estimating Jones and HOMFLY polynomials with One Clean Qubit
Stephen P. Jordan, Pawel Wocjan
The Jones and HOMFLY polynomials are link invariants with close connections to quantum computing. It was recently shown that finding a certain approximation to the Jones polynomial…
Speed-up via Quantum Sampling
Pawel Wocjan, Anura Abeyesinghe
The Markov Chain Monte Carlo method is at the heart of efficient approximation schemes for a wide range of problems in combinatorial enumeration and statistical physics. It is ther…
Hamiltonian Quantum Cellular Automata in 1D
Daniel Nagaj, Pawel Wocjan
We construct a simple translationally invariant, nearest-neighbor Hamiltonian on a chain of 10-dimensional qudits that makes it possible to realize universal quantum computing with…