3 citations · 3 across the 3 of their papers we have counts for
3 papers
Improving success probability in the LHZ parity embedding by computing with quantum walks
Jemma Bennett, Nicholas Chancellor, Viv Kendon +1
The LHZ parity embedding is one of the front-running methods for implementing difficult-to-engineer long-range interactions in quantum optimisation problems. Continuous-time quantu…
Scalable embedding of parity constraints in quantum annealing hardware
Michele Cattelan, Jemma Bennett, Sheir Yarkoni +1
One of the main bottlenecks in solving combinatorial optimization problems with quantum annealers is the qubit connectivity in the hardware. A possible solution for larger connecti…
Using copies to improve precision in continuous-time quantum computing
Jemma Bennett, Adam Callison, Tom O'Leary +3
In the quantum optimisation setting, we build on a scheme introduced by Young et al [PRA 88, 062314, 2013], where physical qubits in multiple copies of a problem encoded into an Is…