Advancing Hybrid Quantum-Classical Computation with Real-Time Execution

• URL: http://arxiv.org/abs/2206.12950v1
• Date: Sun, 26 Jun 2022 19:50:15 GMT
• Title: Advancing Hybrid Quantum-Classical Computation with Real-Time Execution
• Authors: Thomas Lubinski, Cassandra Granade, Amos Anderson, Alan Geller, Martin Roetteler, Andrei Petrenko, Bettina Heim
• Abstract summary: We describe a next-generation implementation of classical computation embedded within quantum programs. It enables the real-time calculation and adjustment of program variables based on the mid-circuit state of measured qubits.
• Score: 10.818632836746668
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The use of mid-circuit measurement and qubit reset within quantum programs has been introduced recently and several applications demonstrated that perform conditional branching based on these measurements. In this work, we go a step further and describe a next-generation implementation of classical computation embedded within quantum programs that enables the real-time calculation and adjustment of program variables based on the mid-circuit state of measured qubits. A full-featured Quantum Intermediate Representation (QIR) model is used to describe the quantum circuit including its embedded classical computation. This integrated approach eliminates the need to evaluate and store a potentially prohibitive volume of classical data within the quantum program in order to explore multiple solution paths. It enables a new type of quantum algorithm that requires fewer round-trips between an external classical driver program and the execution of the quantum program, significantly reducing computational latency, as much of the classical computation can be performed during the coherence time of quantum program execution. We review practical challenges to implementing this approach along with developments underway to address these challenges. An implementation of this novel and powerful quantum programming pattern, a random walk phase estimation algorithm, is demonstrated on a physical quantum computer with an analysis of its benefits and feasibility as compared to existing quantum computing methods.

Related papers

• Classical post-processing approach for quantum amplitude estimation [0.0]
  We propose an approach for quantum amplitude estimation (QAE) designed to enhance computational efficiency while minimizing the reliance on quantum resources. Our method leverages quantum computers to generate a sequence of signals, from which the quantum amplitude is inferred through classical post-processing techniques.
  arXiv  Detail & Related papers  (2025-02-08T15:51:31Z)
• Short-time simulation of quantum dynamics by Pauli measurements [0.889510329047858]
  We propose leveraging the power of measurements to simulate short-time quantum dynamics of physically prepared quantum states in classical post-processing. While limited to short simulation times, our hybrid quantum-classical method is equipped with rigorous error bounds.
  arXiv  Detail & Related papers  (2024-12-11T19:00:03Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• 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)
• Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation [5.381727213688375]
  We are still a long way from reaching the maturity of a full-fledged quantum computer. An outstanding challenge is to come up with an application that can reliably carry out a nontrivial task. Several near-term quantum computing techniques have been proposed to characterize and mitigate errors.
  arXiv  Detail & Related papers  (2022-11-16T07:53:15Z)
• 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)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Exploiting dynamic quantum circuits in a quantum algorithm with superconducting qubits [0.207811670193148]
  We build dynamic quantum circuits on a superconducting-based quantum system. We exploit one of the most fundamental quantum algorithms, quantum phase estimation, in its adaptive version. We demonstrate that the version of real-time quantum computing with dynamic circuits can offer a substantial and tangible advantage.
  arXiv  Detail & Related papers  (2021-02-02T18:51:23Z)
• Minimizing estimation runtime on noisy quantum computers [0.0]
  "engineered likelihood function" (ELF) is used for carrying out Bayesian inference. We show how the ELF formalism enhances the rate of information gain in sampling as the physical hardware transitions from the regime of noisy quantum computers. This technique speeds up a central component of many quantum algorithms, with applications including chemistry, materials, finance, and beyond.
  arXiv  Detail & Related papers  (2020-06-16T17:46:18Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)

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.