Two-particle scattering on general graphs
- URL: http://arxiv.org/abs/2503.11823v1
- Date: Fri, 14 Mar 2025 19:21:47 GMT
- Title: Two-particle scattering on general graphs
- Authors: Luna Lima e Silva, Daniel Jost Brod,
- Abstract summary: Quantum walks in general graphs, or more specifically scattering on graphs, encompass enough complexity to perform universal quantum computation.<n>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.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-sa/4.0/
- 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 then can 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.
Related papers
- Gaussian Entanglement Measure: Applications to Multipartite Entanglement
of Graph States and Bosonic Field Theory [50.24983453990065]
An entanglement measure based on the Fubini-Study metric has been recently introduced by Cocchiarella and co-workers.
We present the Gaussian Entanglement Measure (GEM), a generalization of geometric entanglement measure for multimode Gaussian states.
By providing a computable multipartite entanglement measure for systems with a large number of degrees of freedom, we show that our definition can be used to obtain insights into a free bosonic field theory.
arXiv Detail & Related papers (2024-01-31T15:50:50Z) - Quantum tomography of helicity states for general scattering processes [55.2480439325792]
Quantum tomography has become an indispensable tool in order to compute the density matrix $rho$ of quantum systems in Physics.
We present the theoretical framework for reconstructing the helicity quantum initial state of a general scattering process.
arXiv Detail & Related papers (2023-10-16T21:23:42Z) - A quantum walk-based scheme for distributed searching on arbitrary
graphs [0.0]
A discrete time quantum walk is known to be the single-particle sector of a quantum cellular automaton.
This work introduces a new quantum walk-based searching scheme, designed to search nodes or edges on arbitrary graphs.
arXiv Detail & Related papers (2023-10-16T14:35:05Z) - Normal quantum channels and Markovian correlated two-qubit quantum
errors [77.34726150561087]
We study general normally'' distributed random unitary transformations.
On the one hand, a normal distribution induces a unital quantum channel.
On the other hand, the diffusive random walk defines a unital quantum process.
arXiv Detail & Related papers (2023-07-25T15:33:28Z) - Quantum Tutte Embeddings [2.8981045877033993]
This paper describes how to create a graph-drawing quantum circuit from a given graph.
We show how a Tutte embedding can be calculated as a quantum state in this circuit that can then be sampled to extract the embedding.
arXiv Detail & Related papers (2023-07-17T21:23:28Z) - Two-Particle Scattering on Non-Translation Invariant Line Lattices [0.0]
Quantum walks have been used to develop quantum algorithms since their inception.
We show that a CPHASE gate can be achieved with high fidelity when the interaction acts only on a small portion of the line graph.
arXiv Detail & Related papers (2023-03-08T02:36:29Z) - Quantum Circuit Completeness: Extensions and Simplifications [44.99833362998488]
The first complete equational theory for quantum circuits has only recently been introduced.
We simplify the equational theory by proving that several rules can be derived from the remaining ones.
The complete equational theory can be extended to quantum circuits with ancillae or qubit discarding.
arXiv Detail & Related papers (2023-03-06T13:31:27Z) - From Quantum Graph Computing to Quantum Graph Learning: A Survey [86.8206129053725]
We first elaborate the correlations between quantum mechanics and graph theory to show that quantum computers are able to generate useful solutions.
For its practicability and wide-applicability, we give a brief review of typical graph learning techniques.
We give a snapshot of quantum graph learning where expectations serve as a catalyst for subsequent research.
arXiv Detail & Related papers (2022-02-19T02:56:47Z) - A trace formula for metric graphs with piecewise constant potentials and
multi-mode graphs [0.0]
We generalize the scattering approach to quantum graphs to quantum graphs with piecewise constant potentials and multiple excitation modes.
The free single-mode case is well-known and leads to the trace formulas of Roth, Kottos and Smilansky.
arXiv Detail & Related papers (2022-01-18T13:22:52Z) - From Causal Representation of Multiloop Scattering Amplitudes to Quantum
Computing [0.0]
An overview of a quantum algorithm application for the identification of causal singular configurations of multiloop Feynman diagrams is presented.
The quantum algorithm is implemented in two different quantum simulators, the output is directly translated to causal thresholds needed for the causal representation in the loop-tree duality.
arXiv Detail & Related papers (2022-01-12T09:27:10Z) - Exploring complex graphs using three-dimensional quantum walks of
correlated photons [52.77024349608834]
We introduce a new paradigm for the direct experimental realization of excitation dynamics associated with three-dimensional networks.
This novel testbed for the experimental exploration of multi-particle quantum walks on complex, highly connected graphs paves the way towards exploiting the applicative potential of fermionic dynamics in integrated quantum photonics.
arXiv Detail & Related papers (2020-07-10T09:15:44Z) - Spectra of Perfect State Transfer Hamiltonians on Fractal-Like Graphs [62.997667081978825]
We study the spectral features, on fractal-like graphs, of Hamiltonians which exhibit the special property of perfect quantum state transfer.
The essential goal is to develop the theoretical framework for understanding the interplay between perfect quantum state transfer, spectral properties, and the geometry of the underlying graph.
arXiv Detail & Related papers (2020-03-25T02:46:14Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.