Two-particle scattering on general graphs

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Keller, Luna Lima, Brod, Daniel Jost
Formato: Preprint
Publicado: 2025
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866911541813575680
author Keller, Luna Lima
Brod, Daniel Jost
author_facet Keller, Luna Lima
Brod, Daniel Jost
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2503_11823
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Two-particle scattering on general graphs
Keller, Luna Lima
Brod, Daniel Jost
Quantum Physics
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.
title Two-particle scattering on general graphs
topic Quantum Physics
url https://arxiv.org/abs/2503.11823