OneAdapt: Adaptive Compilation for Resource-Constrained Photonic One-Way Quantum Computing

• URL: http://arxiv.org/abs/2504.17116v1
• Date: Wed, 23 Apr 2025 21:56:27 GMT
• Title: OneAdapt: Adaptive Compilation for Resource-Constrained Photonic One-Way Quantum Computing
• Authors: Hezi Zhang, Jixuan Ruan, Dean Tullsen, Yufei Ding, Ang Li, Travis S. Humble,
• Abstract summary: Measurement-based quantum computing (MBQC) is a universal quantum computing model.<n>In this work, we propose a novel intermediate representation (IR) with new optimization passes.<n>Our optimization can be integrated with Quantum Error Correction (QEC) to improve the efficiency of photonic fault-tolerant quantum computing (FTQC)
• Score: 12.971127888153017
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Measurement-based quantum computing (MBQC), a.k.a. one-way quantum computing (1WQC), is a universal quantum computing model, which is particularly well-suited for photonic platforms. In this model, computation is driven by measurements on an entangled state, which serves as an intermediate representation (IR) between program and hardware. However, compilers on previous IRs lacks the adaptability to the resource constraint in photonic quantum computers. In this work, we propose a novel IR with new optimization passes. Based on this, it realizes a resource-adaptive compiler that minimizes the required hardware size and execution time while restricting the requirement for fusion devices within an adaptive limit. Moreover, our optimization can be integrated with Quantum Error Correction (QEC) to improve the efficiency of photonic fault-tolerant quantum computing (FTQC).

Related papers

• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• 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)
• Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
  We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
  arXiv  Detail & Related papers  (2023-04-18T11:57:15Z)
• Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
  We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources. The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
  arXiv  Detail & Related papers  (2022-09-16T02:37:32Z)
• OneQ: A Compilation Framework for Photonic One-Way Quantum Computation [11.048533849586384]
  OneQ is the first optimizing compilation framework for one-way quantum computation. We show that OneQ can reduce computing resource requirements by orders of magnitude.
  arXiv  Detail & Related papers  (2022-09-04T07:08:56Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• The Cost of Improving the Precision of the Variational Quantum Eigensolver for Quantum Chemistry [0.0]
  We study how various types of errors affect the variational quantum eigensolver (VQE) We find that the optimal way of running the hybrid classical-quantum optimization is to allow some noise in intermediate energy evaluations.
  arXiv  Detail & Related papers  (2021-11-09T06:24:52Z)
• Distributed Quantum Computing with QMPI [11.71212583708166]
  We introduce an extension of the Message Passing Interface (MPI) to enable high-performance implementations of distributed quantum algorithms. In addition to a prototype implementation of quantum MPI, we present a performance model for distributed quantum computing, SENDQ.
  arXiv  Detail & Related papers  (2021-05-03T18:30:43Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Protecting a Bosonic Qubit with Autonomous Quantum Error Correction [2.1806044218454854]
  In principle, quantum error correction can be realized autonomously and continuously by tailoring dissipation within the quantum system. Here we encode a logical qubit in Schr"odinger cat-like multiphoton states of a superconducting cavity. This passive protocol realizes autonomous correction against single-photon loss and boosts the coherence time of the multiphoton qubit by over a factor of two.
  arXiv  Detail & Related papers  (2020-04-20T14:14:27Z)
• SQUARE: Strategic Quantum Ancilla Reuse for Modular Quantum Programs via Cost-Effective Uncomputation [7.92565122267857]
  We present a compilation infrastructure that tackles allocation and reclamation of scratch qubits (called ancilla) in quantum programs. At its core, SQUARE strategically performs uncomputation to create opportunities for qubit reuse. Our results show that SQUARE improves the average success rate of NISQ applications by 1.47X.
  arXiv  Detail & Related papers  (2020-04-18T06:34:37Z)

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.