Recirculating Quantum Photonic Networks for Fast Deterministic Quantum Information Processing

• URL: http://arxiv.org/abs/2602.11033v1
• Date: Wed, 11 Feb 2026 17:01:40 GMT
• Title: Recirculating Quantum Photonic Networks for Fast Deterministic Quantum Information Processing
• Authors: Emil Grovn, Matias Bundgaard-Nielsen, Jesper Mørk, Dirk Englund, Mikkel Heuck,
• Abstract summary: We propose a recirculating quantum photonic network (RQPN) that minimizes the duration of quantum information processing tasks.<n>RQPN consists of a network of all-to-all connected nonlinear cavities with dynamically controlled waveguide couplings.<n>We show that processing all qubits simultaneously yields faster operations than single- and two-qubit decompositions of the three-qubit Toffoli gate.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A fundamental challenge in photonics-based deterministic quantum information processing is to realize key transformations on time scales shorter than those of detrimental decoherence and loss mechanisms. This challenge has been addressed through device-focused approaches that aim to increase nonlinear interactions relative to decoherence rates. In this work, we adopt a complementary architecture-focused approach by proposing a recirculating quantum photonic network (RQPN) that minimizes the duration of quantum information processing tasks, thereby reducing the requirements on nonlinear interaction rates. The RQPN consists of a network of all-to-all connected nonlinear cavities with dynamically controlled waveguide couplings, and it processes information by capturing a photonic input state, recirculating photons between the cavities, and releasing a photonic output state. We demonstrate the RQPN's architectural advantage through two examples: first, we show that processing all qubits simultaneously yields faster operations than single- and two-qubit decompositions of the three-qubit Toffoli gate. Second, we demonstrate implementations of a measurement-free correction for single-photon loss, achieving up to seven-fold speedups and significantly improved hardware efficiency relative to state-of-the-art architecture proposals. Our work shows that a single hardware-efficient recirculating architecture substantially reduces the temporal overhead of multi-qubit gates and quantum error correction, thereby lowering the barrier to experimental realizations of deterministic photonic quantum information processing.

Related papers

• Hardware-Efficient Large-Scale Universal Linear Transformations for Optical Modes in the Synthetic Time Dimension [0.6384650391969042]
  We introduce a hardware-efficient time-domain photonic processor that achieves at least an exponential reduction in component count.<n>Our results establish a practical pathway toward near-term, scalable, and reconfigurable photonic processors.
  arXiv  Detail & Related papers  (2025-05-01T21:14:48Z)
• A Hybrid Approach to Mitigate Errors in Linear Photonic Bell-State Measurement for Quantum Interconnects [0.0]
  We introduce a novel hybrid detection scheme for Bell-state measurement. We derive explicit fidelities for quantum teleportation and entanglement swapping processes. This work provides a new tool for linear optics schemes, with applications to quantum state engineering and quantum interconnects.
  arXiv  Detail & Related papers  (2024-06-14T18:00:00Z)
• Robust photonic quantum gates with large number of waveguide segments [0.8192907805418583]
  We study the fidelity and power loss of composite designs for photonic quantum gates with a high number of segments.<n>Our findings demonstrate that optimized multi-segment waveguide geometrical designs significantly enhance the robustness and efficiency of photonic quantum gates.
  arXiv  Detail & Related papers  (2024-04-14T16:46:11Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Amplification of cascaded downconversion by reusing photons with a switchable cavity [62.997667081978825]
  We propose a scheme to amplify triplet production rates by using a fast switch and a delay loop. Our proof-of-concept device increases the rate of detected photon triplets as predicted.
  arXiv  Detail & Related papers  (2022-09-23T15:53:44Z)
• Experimental Multi-state Quantum Discrimination in the Frequency Domain with Quantum Dot Light [40.96261204117952]
  In this work, we present the experimental realization of a protocol employing a time-multiplexing strategy to optimally discriminate among eight non-orthogonal states. The experiment was built on a custom-designed bulk optics analyser setup and single photons generated by a nearly deterministic solid-state source. Our work paves the way for more complex applications and delivers a novel approach towards high-dimensional quantum encoding and decoding operations.
  arXiv  Detail & Related papers  (2022-09-17T12:59:09Z)
• Tunable photon-mediated interactions between spin-1 systems [68.8204255655161]
  We show how to harness multi-level emitters with several optical transitions to engineer photon-mediated interactions between effective spin-1 systems. Our results expand the quantum simulation toolbox available in cavity QED and quantum nanophotonic setups.
  arXiv  Detail & Related papers  (2022-06-03T14:52:34Z)
• Switch networks for photonic fusion-based quantum computing [0.0]
  Fusion-based quantum computing (FBQC) offers a powerful approach to building a fault-tolerant universal quantum computer. FBQC uses single-photon sources, linear-optical circuits, single-photon detectors, and optical switching with feedforward control. New techniques and schemes enable major improvements in terms of muxing efficiency and reductions in hardware requirements.
  arXiv  Detail & Related papers  (2021-09-28T14:31:30Z)
• Post-Training Quantization for Vision Transformer [85.57953732941101]
  We present an effective post-training quantization algorithm for reducing the memory storage and computational costs of vision transformers. We can obtain an 81.29% top-1 accuracy using DeiT-B model on ImageNet dataset with about 8-bit quantization.
  arXiv  Detail & Related papers  (2021-06-27T06:27:22Z)
• Interleaving: Modular architectures for fault-tolerant photonic quantum computing [50.591267188664666]
  Photonic fusion-based quantum computing (FBQC) uses low-loss photonic delays. We present a modular architecture for FBQC in which these components are combined to form "interleaving modules" Exploiting the multiplicative power of delays, each module can add thousands of physical qubits to the computational Hilbert space.
  arXiv  Detail & Related papers  (2021-03-15T18:00:06Z)
• Rapid characterisation of linear-optical networks via PhaseLift [51.03305009278831]
  Integrated photonics offers great phase-stability and can rely on the large scale manufacturability provided by the semiconductor industry. New devices, based on such optical circuits, hold the promise of faster and energy-efficient computations in machine learning applications. We present a novel technique to reconstruct the transfer matrix of linear optical networks.
  arXiv  Detail & Related papers  (2020-10-01T16:04:22Z)
• Resource requirements for efficient quantum communication using all-photonic graph states generated from a few matter qubits [0.0]
  Long-distance quantum communication requires the use of quantum repeaters. All-photonic approaches based on graph states generated from linear optics outperform repeater-less protocols. We show that fast two-qubit entangling gates between matter qubits and high photon collection and detection efficiencies are the main ingredients needed for the all-photonic protocol.
  arXiv  Detail & Related papers  (2020-05-14T18:00:00Z)

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.