Two-particle scattering on general graphs

Abstract

Quantum walks in general graphs, or more specifically scattering on graphs, encompass enough complexity to perform universal quantum computation. Any given quantum circuit can be broken down into single- and two-qubit gates, which can then be translated into subgraphs -- gadgets -- that implement such unitaries on the logical qubits, simulated by particles traveling along a sparse graph. In this work, we start to develop a full theory of multi-particle scattering on graphs and give initial applications to build multi-particle gadgets with different properties.

References in corpus (12)

• Quantum Computation and Decision Trees
• Universal computation by quantum walk
• Exponential algorithmic speedup by quantum walk
• Universal computation by multi-particle quantum walk
• Input-Output Formalism For Few-Photon Transport in One-Dimensional Nanophotonic Waveguides Coupled to a Qubit
• A passive CPHASE gate via cross-Kerr nonlinearities
• Hitting time for the continuous quantum walk
• Fermionic Linear Optics Revisited
• Two photons co- and counter-propagating through $N$ cross-Kerr sites
• Levinson's theorem for graphs II
• Quantum scattering theory on graphs with tails
• Two-Particle Scattering on Non-Translation Invariant Line Lattices