High-dimensional graphs convolution for quantum walks photonic applications

• URL: http://arxiv.org/abs/2507.15988v1
• Date: Mon, 21 Jul 2025 18:28:34 GMT
• Title: High-dimensional graphs convolution for quantum walks photonic applications
• Authors: Roman Abramov, Leonid Fedichkin, Dmitry Tsarev, Alexander Alodjants,
• Abstract summary: We suggest a new method for lattices and hypercycle convolution that preserves quantum walk dynamics.<n>Our findings may be useful for saving a significant number of qubits required for algorithms that use quantum walk simulation on quantum devices.
• Score: 41.94295877935867
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum random walks represent a powerful tool for the implementation of various quantum algorithms. We consider a convolution problem for the graphs which provide quantum and classical random walks. We suggest a new method for lattices and hypercycle convolution that preserves quantum walk dynamics. Our method is based on the fact that some graphs represent a result of Kronecker's product of line graphs. We support our methods by means of various numerical experiments that check quantum and classical random walks on hypercycles and their convolutions. Our findings may be useful for saving a significant number of qubits required for algorithms that use quantum walk simulation on quantum devices.

Related papers

• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• Experimental realization of universal quantum gates and six-qubit entangled state using photonic quantum walk [2.2006360539727923]
  We experimentally demonstrate the realization of a universal set of quantum gates with high fidelity at room temperature.<n>For a three-qubit system using a single photon, the first qubit is encoded using polarization information, and the other two qubits are encoded using path information.<n>To generate a six-qubit Greenberger-Horne-Zeilinger state, entangled photon pairs are used to entangle the two three-qubit modules.
  arXiv  Detail & Related papers  (2024-03-11T12:32:22Z)
• Quantum walks on random lattices: Diffusion, localization and the absence of parametric quantum speed-up [0.0]
  We study propagation of quantum walks on percolation-generated two-dimensional random lattices. We show that even arbitrarily weak concentrations of randomly removed lattice sites give rise to a complete breakdown of the superdiffusive quantum speed-up. The fragility of quantum speed-up implies dramatic limitations for quantum information applications of quantum walks on random geometries and graphs.
  arXiv  Detail & Related papers  (2022-10-11T10:07:52Z)
• Large-scale full-programmable quantum walk and its applications [18.832850380803333]
  Quantum walks are powerful kernels for developing new and useful quantum algorithms. Here we realize large-scale quantum walks using a fully programmable photonic quantum computing system. In the 400-dimensional Hilbert space, the average fidelity of random entangled quantum states after the whole on-chip circuit evolution reaches as high as 94.29$pm$1.28$%$.
  arXiv  Detail & Related papers  (2022-08-28T09:36:32Z)
• 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)
• Quantifying information scrambling via Classical Shadow Tomography on Programmable Quantum Simulators [0.0]
  We develop techniques to probe the dynamics of quantum information, and implement them experimentally on an IBM superconducting quantum processor. We identify two unambiguous signatures of quantum information scrambling, neither of which can be mimicked by dissipative processes. We measure both signatures, and support our results with numerical simulations of the quantum system.
  arXiv  Detail & Related papers  (2022-02-10T16:36:52Z)
• Designing exceptional-point-based graphs yielding topologically guaranteed quantum search [0.0]
  We show how to construct walks with the property that all the eigenvalues of the non-Hermitian survival operator, coalesce to zero. The resulting search is guaranteed to succeed in a bounded time for any initial condition.
  arXiv  Detail & Related papers  (2022-02-08T04:30:24Z)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48:00Z)
• Quantum walk processes in quantum devices [55.41644538483948]
  We study how to represent quantum walk on a graph as a quantum circuit. Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
  arXiv  Detail & Related papers  (2020-12-28T18:04:16Z)
• Quantum information spreading in a disordered quantum walk [50.591267188664666]
  We design a quantum probing protocol using Quantum Walks to investigate the Quantum Information spreading pattern. We focus on the coherent static and dynamic disorder to investigate anomalous and classical transport. Our results show that a Quantum Walk can be considered as a readout device of information about defects and perturbations occurring in complex networks.
  arXiv  Detail & Related papers  (2020-10-20T20:03:19Z)

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.