Quantum Paths: a Quantum Walk approach

• URL: http://arxiv.org/abs/2508.18077v1
• Date: Mon, 25 Aug 2025 14:43:29 GMT
• Title: Quantum Paths: a Quantum Walk approach
• Authors: Claudio Pellitteri, Marcello Caleffi, Angela Sara Cacciapuoti,
• Abstract summary: We present preliminary theoretical results demonstrating that, by applying tools of the quantum random walk framework to the spatial superposition of channels, it is possible to replicate the output of a quantum switch.<n>These findings suggest a promising and more feasible route to emulate the quantum switch, offering both practical advantages and interpretative clarity.
• Score: 4.376469285036708
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: The quantum switch, a process enabling a coherent superposition of different orders of quantum channels, has garnered significant attention due to its ability to enable noiseless communications through noisy channels, such as entanglement-breaking channels. However, its practical implementation and scalability remain challenging. In contrast, the spatial superposition of quantum channels is more accessible experimentally and has been shown to enhance channel capacity, although it does not match the performance of the quantum switch. In this work, we present preliminary theoretical results demonstrating that, by applying tools of the quantum random walk framework to the spatial superposition of channels, it is possible to replicate the output of a quantum switch. These findings suggest a promising and more feasible route to emulate the quantum switch, offering both practical advantages and interpretative clarity.

Related papers

• Quantum-Channel Matrix Optimization for Holevo Bound Enhancement [87.57725685513088]
  We propose a unified projected gradient ascent algorithm to optimize the quantum channel given a fixed input ensemble.<n> Simulation results demonstrate that the proposed quantum channel optimization yields higher Holevo bounds than input ensemble optimization.
  arXiv  Detail & Related papers  (2026-02-19T04:15:03Z)
• Implementation and readout of maximally entangled two-qubit gates quantum circuits in a superconducting quantum processor [32.40607221598716]
  In a transmon-based 5-qubit superconducting quantum processor, we compared the performance of quantum circuits involving an increasing level of complexity.<n>Here we report the results obtained from the analysis of the outputs of quantum circuits using two readout paradigms.<n>The first method is suitable for single-qubit circuits, while the second is essential for accurately interpreting the outputs of circuits involving two-qubit gates.
  arXiv  Detail & Related papers  (2025-03-31T16:20:56Z)
• Capability of anti-degradable quantum channel with additional entanglement [0.0]
  We show that a type of quantum channel known as the anti-degradable one-mode Gaussian channel can be activated" to transmit quantum information.<n>Beyond its theoretical implications, this activation can also be realized in practical systems.
  arXiv  Detail & Related papers  (2025-01-12T15:17:00Z)
• Distributed Quantum Computation via Entanglement Forging and Teleportation [13.135604356093193]
  Distributed quantum computation is a practical method for large-scale quantum computation on quantum processors with limited size. In this paper, we demonstrate the methods to implement a nonlocal quantum circuit on two quantum processors without any quantum correlations.
  arXiv  Detail & Related papers  (2024-09-04T08:10:40Z)
• Channel nonlocality under decoherence [0.0]
  We quantify nonlocality of bipartite quantum channels and identify its component resisting the effects of dephasing noise. We show that simulating certain processes with quantum channels undergoing decoherence has a communication advantage with respect to their classical simulation.
  arXiv  Detail & Related papers  (2024-08-19T18:00:05Z)
• Fundamental limitations on the recoverability of quantum processes [0.6990493129893111]
  We determine fundamental limitations on how well the physical transformation on quantum channels can be undone or reversed. We refine (strengthen) the quantum data processing inequality for quantum channels under the action of quantum superchannels. We also provide a refined inequality for the entropy change of quantum channels under the action of an arbitrary quantum superchannel.
  arXiv  Detail & Related papers  (2024-03-19T17:50:24Z)
• Enhanced quantum state transfer: Circumventing quantum chaotic behavior [35.74056021340496]
  We show how to transfer few-particle quantum states in a two-dimensional quantum network. Our approach paves the way to short-distance quantum communication for connecting distributed quantum processors or registers.
  arXiv  Detail & Related papers  (2024-02-01T19:00:03Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Quantum Routing for Emerging Quantum Networks [0.0]
  Quantum routing, the entanglement of an input quantum signal over multiple output paths, will be an important aspect of future quantum networks. We design a combined circuit for quantum routing and quantum error correction, and carry out the first implementation of such a circuit on a noisy real-world quantum device. Our experiments validate, for the first time, that error-corrected quantum routing in near-term noisy quantum-computing devices is feasible.
  arXiv  Detail & Related papers  (2022-11-11T08:58:29Z)
• Entanglement catalysis for quantum states and noisy channels [41.94295877935867]
  We investigate properties of entanglement and its role for quantum communication. For transformations between bipartite pure states, we prove the existence of a universal catalyst. We further develop methods to estimate the number of singlets which can be established via a noisy quantum channel.
  arXiv  Detail & Related papers  (2022-02-10T18:36:25Z)
• Creating and destroying coherence with quantum channels [62.997667081978825]
  We study optimal ways to create a large amount of quantum coherence via quantum channels. correlations in multipartite systems do not enhance the ability of a quantum channel to create coherence. We show that a channel can destroy more coherence when acting on a subsystem of a bipartite state.
  arXiv  Detail & Related papers  (2021-05-25T16:44:13Z)
• 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)
• 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)

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.