Quantum Search with a Generalized Laplacian

• URL: http://arxiv.org/abs/2506.22013v1
• Date: Fri, 27 Jun 2025 08:27:01 GMT
• Title: Quantum Search with a Generalized Laplacian
• Authors: Jonas Duda, Molly E. McLaughlin, Thomas G. Wong,
• Abstract summary: A single excitation in a quantum spin network can effect a variety of continuous-time quantum walks on unweighted graphs.<n>We show that the Heisenberg model can effect these three quantum walks on signed weighted graphs.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A single excitation in a quantum spin network described by the Heisenberg model can effect a variety of continuous-time quantum walks on unweighted graphs, including those governed by the discrete Laplacian, adjacency matrix, and signless Laplacian. In this paper, we show that the Heisenberg model can effect these three quantum walks on signed weighted graphs, as well as a generalized Laplacian equal to the discrete Laplacian plus a real-valued multiple of the degree matrix, for which the standard Laplacian, adjacency matrix, and signless Laplacian are special cases. We explore the algorithmic consequence of this generalized Laplacian quantum walk when searching a weighted barbell graph consisting of two equal-sized, unweighted cliques connected by a single signed weighted edge or bridge, with the search oracle constituting an external magnetic field in the spin network. We prove that there are two weights for the bridge (which could both be positive, both negative, or one of each, depending on the multiple of the degree matrix) that allow amplitude to cross from one clique to the other -- except for the standard and signless Laplacians that respectively only have one negative or positive weight bridge -- boosting the success probability from 0.5 to 0.820 or 0.843 for each weight. Moreover, one of the weights leads to a two-stage algorithm that further boosts the success probability to 0.996.

Related papers

• Quantum Search with the Signless Laplacian [0.0]
  We explore the signless Laplacian, which may arise in layered antiferromagnetic materials.<n>For some parameter regimes, the signless Laplacian yields the fastest search algorithm of the three, suggesting that it could be a new tool for developing faster quantum algorithms.
  arXiv  Detail & Related papers  (2025-01-28T18:18:01Z)
• Searching Weighted Barbell Graphs with Laplacian and Adjacency Quantum Walks [0.0]
  A quantum particle evolving by Schr"odinger's equation in discrete space constitutes a continuous-time quantum walk on a graph. We show that the Laplacian quantum walk's behavior does not change, no matter the weight of the bridge, and so the single bridge is too restrictive to affect the walk.
  arXiv  Detail & Related papers  (2024-08-15T16:24:47Z)
• The quantum beam splitter with many partially indistinguishable photons: multiphotonic interference and asymptotic classical correspondence [44.99833362998488]
  We present the analysis of the quantum two-port interferometer in the $n rightarrow infty$ limit of $n$ partially indistinguishable photons. Our main result is that the output distribution is dominated by the $O(sqrtn)$ channels around a certain $j*$ that depends on the degree of indistinguishability. The form is essentially the doubly-humped semi-classical envelope of the distribution that would arise from $2 j*$ indistinguishable photons, and which reproduces the corresponding classical intensity distribution.
  arXiv  Detail & Related papers  (2023-12-28T01:48:26Z)
• 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)
• Variational-quantum-eigensolver-inspired optimization for spin-chain work extraction [39.58317527488534]
  Energy extraction from quantum sources is a key task to develop new quantum devices such as quantum batteries. One of the main issues to fully extract energy from the quantum source is the assumption that any unitary operation can be done on the system. We propose an approach to optimize the extractable energy inspired by the variational quantum eigensolver (VQE) algorithm.
  arXiv  Detail & Related papers  (2023-10-11T15:59:54Z)
• 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)
• Search for Multiple Adjacent Marked Vertices on the Hypercube by a Quantum Walk with Partial Phase Inversion [3.8436076642278754]
  We analyze the application of the Multi-self-loop Lackadaisical Quantum Walk on the hypercube. We show that with the use of partial phase inversion, it is possible to amplify their probability amplitudes to values close to 1.
  arXiv  Detail & Related papers  (2023-05-31T07:30:04Z)
• 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)
• Exact results on Quantum search algorithm [0.34376560669160383]
  We give exact analytic expressions for the success probability after arbitrary number of iteration of the generalized Grover operator. We quantify success probability of the algorithm with decrease in coherence of the initial quantum state against modest noise.
  arXiv  Detail & Related papers  (2022-07-20T09:05:32Z)
• Quantum algorithms for grid-based variational time evolution [36.136619420474766]
  We propose a variational quantum algorithm for performing quantum dynamics in first quantization. Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
  arXiv  Detail & Related papers  (2022-03-04T19:00:45Z)
• Spectral clustering under degree heterogeneity: a case for the random walk Laplacian [83.79286663107845]
  This paper shows that graph spectral embedding using the random walk Laplacian produces vector representations which are completely corrected for node degree. In the special case of a degree-corrected block model, the embedding concentrates about K distinct points, representing communities.
  arXiv  Detail & Related papers  (2021-05-03T16:36:27Z)
• Graph-Theoretic Framework for Self-Testing in Bell Scenarios [37.067444579637076]
  Quantum self-testing is the task of certifying quantum states and measurements using the output statistics solely. We present a new approach for quantum self-testing in Bell non-locality scenarios.
  arXiv  Detail & Related papers  (2021-04-27T08:15:01Z)

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.