Designing exceptional-point-based graphs yielding topologically guaranteed quantum search

• URL: http://arxiv.org/abs/2202.03640v2
• Date: Sat, 24 Sep 2022 12:50:44 GMT
• Title: Designing exceptional-point-based graphs yielding topologically guaranteed quantum search
• Authors: Quancheng Liu, David A. Kessler, and Eli Barkai
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum walks underlie an important class of quantum computing algorithms, and represent promising approaches in various simulations and practical applications. Here we design stroboscopically monitored quantum walks and their subsequent graphs that can naturally boost target searches. We show how to construct walks with the property that all the eigenvalues of the non-Hermitian survival operator, describing the mixed effects of unitary dynamics and the back-action of measurement, coalesce to zero, corresponding to an exceptional point whose degree is the size of the system. Generally, the resulting search is guaranteed to succeed in a bounded time for any initial condition, which is faster than classical random walks or quantum walks on typical graphs. We then show how this efficient quantum search is related to a quantized topological winding number and further discuss the connection of the problem to an effective massless Dirac particle.

Related papers

• Complex-Phase Extensions of Szegedy Quantum Walk on Graphs [0.0]
  This work introduces a graph-phased Szegedy's quantum walk, which incorporates link phases and local arbitrary phase rotations (APR) We demonstrate how to adapt quantum circuits to these advancements, allowing phase patterns that ensure computational practicality. Our findings illuminate the path towards more versatile and powerful quantum computing paradigms.
  arXiv  Detail & Related papers  (2024-10-29T12:57:31Z)
• 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)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• 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)
• Provably efficient variational generative modeling of quantum many-body systems via quantum-probabilistic information geometry [3.5097082077065003]
  We introduce a generalization of quantum natural gradient descent to parameterized mixed states. We also provide a robust first-order approximating algorithm, Quantum-Probabilistic Mirror Descent. Our approaches extend previously sample-efficient techniques to allow for flexibility in model choice.
  arXiv  Detail & Related papers  (2022-06-09T17:58:15Z)
• Noisy Quantum Kernel Machines [58.09028887465797]
  An emerging class of quantum learning machines is that based on the paradigm of quantum kernels. We study how dissipation and decoherence affect their performance. We show that decoherence and dissipation can be seen as an implicit regularization for the quantum kernel machines.
  arXiv  Detail & Related papers  (2022-04-26T09:52:02Z)
• Hypercube Quantum Search: Exact Computation of the Probability of Success in Polynomial Time [0.1957338076370071]
  Grover's quantum search is one of the most significant quantum algorithms. In this paper, we propose an in-depth study of the quantum search over a hypercube layout.
  arXiv  Detail & Related papers  (2022-02-25T21:05:38Z)
• 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.