Dissipative realization of a quantum distance-based classifier using open quantum walks

• URL: http://arxiv.org/abs/2603.16010v2
• Date: Wed, 18 Mar 2026 17:02:06 GMT
• Title: Dissipative realization of a quantum distance-based classifier using open quantum walks
• Abstract summary: Open quantum walks (OQWs) constitute a class of quantum walks whose dynamics are entirely driven by interactions with the environment.<n>We demonstrate the feasibility of running the previously proposed quantum distance-based classifier within the open quantum walk model.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Open quantum walks (OQWs) constitute a class of quantum walks whose dynamics are entirely driven by interactions with the environment. It is well known that OQWs provide a general framework for implementing dissipative quantum computation. In this work, we demonstrate the feasibility of running the previously proposed quantum distance-based classifier within the open quantum walk computation model, and we show that its expected runtime remains finite even in the slower regime.

Related papers

• Automatic De-Quantization of Quantum Programs Using Constant Propagation [42.89658025409898]
  Every quantum operation is costly, making it crucial to minimize quantum resource usage in near-term algorithms.<n>In this work, we focus on de-quantizing quantum operations to classical computation whenever possible.<n>We formalize a hybrid state model for quantum-classical constant propagation, implement our optimizations in the open-source MQT Core tool, and evaluate them on benchmark circuits.
  arXiv  Detail & Related papers  (2026-05-21T19:21:11Z)
• A Perspective on Quantum Computing Applications in Quantum Chemistry using 25--100 Logical Qubits [15.77466323653959]
  The intersection of quantum computing and quantum chemistry represents a promising frontier for achieving quantum utility in domains of both scientific and societal relevance.<n>We highlight near-term opportunities in algorithm and software design, discuss chemical problems suited to quantum acceleration, and propose strategic roadmaps and collaborative pathways for advancing practical quantum utility in quantum chemistry.
  arXiv  Detail & Related papers  (2025-06-24T06:02:25Z)
• Quantum Algorithms Without Coherent Quantum Access [0.0]
  Most quantum speedups rely on a subroutine in which classical information can be accessed in a coherent quantum manner.<n>It has been shown that without such an access, the quantum computer cannot be stronger than the classical counterparts.<n>In this work, we develop several variants of quantum algorithms.
  arXiv  Detail & Related papers  (2025-03-04T11:24:28Z)
• Robust Implementation of Discrete-time Quantum Walks in Any Finite-dimensional Quantum System [2.646968944595457]
  discrete-time quantum walk (DTQW) model one of most suitable choices for circuit implementation. In this paper, we have successfully cut down the circuit cost concerning gate count and circuit depth by half. For the engineering excellence of our proposed approach, we implement DTQW in any finite-dimensional quantum system with akin efficiency.
  arXiv  Detail & Related papers  (2024-08-01T13:07:13Z)
• Quantum Algorithms and Applications for Open Quantum Systems [1.7717834336854132]
  We provide a succinct summary of the fundamental theory of open quantum systems. We then delve into a discussion on recent quantum algorithms. We conclude with a discussion of pertinent applications, demonstrating the applicability of this field to realistic chemical, biological, and material systems.
  arXiv  Detail & Related papers  (2024-06-07T19:02:22Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• Review on Quantum Walk Computing: Theory, Implementation, and Application [0.30723404270319693]
  The quantum walk is proposed as an important theoretical model for quantum computing. Quantum walks and their variety have been extensively studied for achieving beyond classical computing power. Recent progress has been achieved in implementing a wide variety of quantum walks and quantum walk applications.
  arXiv  Detail & Related papers  (2024-04-05T15:45:35Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• No-Regret Learning and Equilibrium Computation in Quantum Games [29.768913836823973]
  We show that no-regret algorithms converge to separable quantum Nash equilibria in time-average.<n>In the case of general multi-player quantum games, our work leads to a novel solution concept, that of the separable quantum coarse correlated equilibria.
  arXiv  Detail & Related papers  (2023-10-12T16:29:56Z)
• Qafny: A Quantum-Program Verifier [39.47005122712576]
  We present Qafny, an automated proof system for verifying quantum programs. At its core, Qafny uses a type-guided quantum proof system that translates quantum operations to classical array operations. We show how Qafny can efficiently verify important quantum algorithms, including quantum-walk algorithms, Grover's algorithm, and Shor's algorithm.
  arXiv  Detail & Related papers  (2022-11-11T18:50:52Z)
• 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)
• Noisy Quantum Computation Modeled by Quantum Walk: Universality without Ancillas [0.0]
  We extend the quantum walk model to open noisy systems in order to provide such a tool for the study of NISQ computers. Our scheme, the quantum walk amplitudes represent elements of the density matrix rather than the wavefunction of a pure state.
  arXiv  Detail & Related papers  (2021-04-25T08:07:24Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• A general quantum algorithm for open quantum dynamics demonstrated with the Fenna-Matthews-Olson complex [0.0]
  We develop a quantum algorithm to simulate any dynamical process represented by either the operator sum representation or the Lindblad master equation. We demonstrate the quantum algorithm by simulating the dynamics of the Fenna-Matthews-Olson complex on the IBM QASM quantum simulator.
  arXiv  Detail & Related papers  (2021-01-13T19:00:02Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• Quantum simulation of open quantum systems in heavy-ion collisions [0.0]
  We present a framework to simulate the dynamics of hard probes such as heavy quarks or jets in a hot, strongly-coupled quark-gluon plasma (QGP) on a quantum computer. Our work demonstrates the feasibility of simulating open quantum systems on current and near-term quantum devices.
  arXiv  Detail & Related papers  (2020-10-07T18:00:02Z)
• Capturing Non-Markovian Dynamics on Near-Term Quantum Computers [0.0]
  quantum algorithms for the treatment of open quantum systems (OQSs) have remained under-explored. We present and validate a new quantum algorithm to treat non-Markovian dynamics in OQSs built on the Ensemble of Lindblad's Trajectories approach.
  arXiv  Detail & Related papers  (2020-04-30T18:02:15Z)

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.