3.3k citations · 16.3k across the 118 of their papers we have counts for
Showing 2015 · quant-phShow all
3 papers · 2 filters
quant-ph2015★ 24 cited
Hierarchical surface code for network quantum computing with modules of arbitrary size
Ying Li, Simon C. Benjamin
The network paradigm for quantum computing involves interconnecting many modules to form a scalable machine. Typically it is assumed that the links between modules are prone to noi…
quant-ph2015★ 1 cited
Performance of a measurement-driven 'adiabatic-like' quantum 3-SAT solver
Simon Benjamin
I describe one quantum approach to solving 3-satisfiability (3-SAT), the well known problem in computer science. The approach is based on repeatedly measuring the truth value of th…
quant-ph2015★ 114 cited
Resource costs for fault-tolerant linear optical quantum computing
Ying Li, Peter C. Humphreys, Gabriel J. Mendoza +1
Linear optical quantum computing (LOQC) seems attractively simple: information is borne entirely by light and processed by components such as beam splitters, phase shifters and det…