Quantum Volume for Photonic Quantum Processors

• URL: http://arxiv.org/abs/2208.11724v2
• Date: Mon, 3 Apr 2023 01:02:00 GMT
• Title: Quantum Volume for Photonic Quantum Processors
• Authors: Yuxuan Zhang, Daoheng Niu, Alireza Shabani, Hassan Shapourian
• Abstract summary: Defining metrics for near-term quantum computing processors has been an integral part of the quantum hardware research and development efforts. Most metrics such as randomized benchmarking and quantum volume were originally introduced for circuit-based quantum computers. We present a framework to map physical noises and imperfections in MBQC processes to logical errors in equivalent quantum circuits.
• Score: 15.3862808585761
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Defining metrics for near-term quantum computing processors has been an integral part of the quantum hardware research and development efforts. Such quantitative characteristics are not only useful for reporting the progress and comparing different quantum platforms, but also essential for identifying the bottlenecks and designing a technology roadmap. Most metrics such as randomized benchmarking and quantum volume were originally introduced for circuit-based quantum computers and were not immediately applicable to measurement-based quantum computing (MBQC) processors such as in photonic devices. In this paper, we close this gap by presenting a framework to map physical noises and imperfections in MBQC processes to logical errors in equivalent quantum circuits, whereby enabling the well-known metrics to characterize MBQC. To showcase our framework, we study a continuous-variable cluster state based on the Gottesman-Kitaev-Preskill (GKP) encoding as a near-term candidate for photonic quantum computing, and derive the effective logical gate error channels and calculate the quantum volume in terms of the GKP squeezing and photon loss rate.

Related papers

• Distributed Quantum Computing for Chemical Applications [10.679753825744964]
  distributed quantum computing (DQC) aims at increasing compute power by spreading the compute processes across many devices. DQC aims at increasing compute power by spreading the compute processes across many devices, with the goal to minimize the noise and circuit depth required by quantum devices.
  arXiv  Detail & Related papers  (2024-08-09T21:42:51Z)
• Quantum algorithms in distributed quantum computing [0.0]
  Distributed quantum computing (DQC) provides a way to scale quantum computers using multiple quantum processing units (QPU) which are connected through quantum communication links. We have built a distributed quantum computing simulator and used it to investigate quantum algorithms. We show the applicability of dynamic quantum circuits in DQC, where mid-circuit measurements, local operations, and classical communication are used in place of noisy inter-processor (nonlocal) quantum gates.
  arXiv  Detail & Related papers  (2024-02-16T15:05:15Z)
• Peptide Binding Classification on Quantum Computers [3.9540968630765643]
  We conduct an extensive study on using near-term quantum computers for a task in the domain of computational biology. We perform sequence classification on a task relevant to the design of therapeutic proteins, and find competitive performance with classical baselines of similar scale. This work constitutes the first proof-of-concept application of near-term quantum computing to a task critical to the design of therapeutic proteins.
  arXiv  Detail & Related papers  (2023-11-27T10:32:31Z)
• QuBEC: Boosting Equivalence Checking for Quantum Circuits with QEC Embedding [4.15692939468851]
  We propose a Decision Diagram-based quantum equivalence checking approach, QuBEC, that requires less latency compared to existing techniques. Our proposed methodology reduces verification time on certain benchmark circuits by up to $271.49 times$.
  arXiv  Detail & Related papers  (2023-09-19T16:12:37Z)
• 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)
• 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)
• Quantum Error Mitigation via Quantum-Noise-Effect Circuit Groups [0.0]
  Near-term quantum computers are fragile against quantum noise effects. Traditional quantum-error-correcting codes are not implemented on such devices. We propose quantum error mitigation (QEM) scheme for quantum computational errors.
  arXiv  Detail & Related papers  (2022-05-27T11:21:35Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• Quantum Federated Learning with Quantum Data [87.49715898878858]
  Quantum machine learning (QML) has emerged as a promising field that leans on the developments in quantum computing to explore large complex machine learning problems. This paper proposes the first fully quantum federated learning framework that can operate over quantum data and, thus, share the learning of quantum circuit parameters in a decentralized manner.
  arXiv  Detail & Related papers  (2021-05-30T12:19:27Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)

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.