On the Quantum Performance Evaluation of Two Distributed Quantum Architectures

• URL: http://arxiv.org/abs/2107.12246v2
• Date: Thu, 23 Dec 2021 11:12:18 GMT
• Title: On the Quantum Performance Evaluation of Two Distributed Quantum Architectures
• Authors: Gayane Vardoyan, Matthew Skrzypczyk, Stephanie Wehner
• Abstract summary: We study the performance of two possible architectures for interfacing a quantum processor with a quantum network. We compare their quality of executing quantum operations and producing entangled quantum states as functions of their memory lifetimes. We find that for present-day device parameters one architecture is more suited to computation-heavy applications, and the other for network-heavy ones.
• Score: 2.1377923666134118
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Distributed quantum applications impose requirements on the quality of the quantum states that they consume. When analyzing architecture implementations of quantum hardware, characterizing this quality forms an important factor in understanding their performance. Fundamental characteristics of quantum hardware lead to inherent tradeoffs between the quality of states and traditional performance metrics such as throughput. Furthermore, any real-world implementation of quantum hardware exhibits time-dependent noise that degrades the quality of quantum states over time. Here, we study the performance of two possible architectures for interfacing a quantum processor with a quantum network. The first corresponds to the current experimental state of the art in which the same device functions both as a processor and a network device. The second corresponds to a future architecture that separates these two functions over two distinct devices. We model these architectures as Markov chains and compare their quality of executing quantum operations and producing entangled quantum states as functions of their memory lifetimes, as well as the time that it takes to perform various operations within each architecture. As an illustrative example, we apply our analysis to architectures based on Nitrogen-Vacancy centers in diamond, where we find that for present-day device parameters one architecture is more suited to computation-heavy applications, and the other for network-heavy ones. Besides the detailed study of these architectures, a novel contribution of our work are several formulas that connect an understanding of waiting time distributions to the decay of quantum quality over time for the most common noise models employed in quantum technologies. This provides a valuable new tool for performance evaluation experts, and its applications extend beyond the two architectures studied in this work.

Related papers

• Data augmentation experiments with style-based quantum generative adversarial networks on trapped-ion and superconducting-qubit technologies [0.0]
  This work demonstrates, for the first time, how the quantum generator architecture for the style-based quantum generative adversarial network (qGAN) can be implemented. The style-based qGAN, proposed in 2022, generalizes the state of the art for qGANs and allows for shallow-depth networks. The results obtained on both devices are of comparable quality, with the aria-1 device delivering somewhat more accurate results than the ibm_torino device.
  arXiv  Detail & Related papers  (2024-05-07T15:26:51Z)
• 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)
• Majorization-based benchmark of the complexity of quantum processors [105.54048699217668]
  We numerically simulate and characterize the operation of various quantum processors. We identify and assess quantum complexity by comparing the performance of each device against benchmark lines. We find that the majorization-based benchmark holds as long as the circuits' output states have, on average, high purity.
  arXiv  Detail & Related papers  (2023-04-10T23:01:10Z)
• Full-stack quantum computing systems in the NISQ era: algorithm-driven and hardware-aware compilation techniques [1.3496450124792878]
  We will provide an overview on current full-stack quantum computing systems. We will emphasize the need for tight co-design among adjacent layers as well as vertical cross-layer design.
  arXiv  Detail & Related papers  (2022-04-13T13:26:56Z)
• Quantum circuit architecture search on a superconducting processor [56.04169357427682]
  Variational quantum algorithms (VQAs) have shown strong evidences to gain provable computational advantages for diverse fields such as finance, machine learning, and chemistry. However, the ansatz exploited in modern VQAs is incapable of balancing the tradeoff between expressivity and trainability. We demonstrate the first proof-of-principle experiment of applying an efficient automatic ansatz design technique to enhance VQAs on an 8-qubit superconducting quantum processor.
  arXiv  Detail & Related papers  (2022-01-04T01:53:42Z)
• Performance of Superconducting Quantum Computing Chips under Different Architecture Design [0.0]
  We study the quantum processor performance under different qubit connectivity and topology. It is shown that a high-performance architecture almost always comes with a design with a large connectivity. Different quantum algorithms show different dependence on quantum chip connectivity and topologies.
  arXiv  Detail & Related papers  (2021-05-13T03:36:25Z)
• Scalable Benchmarks for Gate-Based Quantum Computers [5.735035463793008]
  We develop and release an advanced quantum benchmarking framework. It measures the performance of universal quantum devices in a hardware-agnostic way. We present the benchmark results of twenty-one different quantum devices from IBM, Rigetti and IonQ.
  arXiv  Detail & Related papers  (2021-04-21T18:00:12Z)
• 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)
• 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)
• Experimental Quantum Generative Adversarial Networks for Image Generation [93.06926114985761]
  We experimentally achieve the learning and generation of real-world hand-written digit images on a superconducting quantum processor. Our work provides guidance for developing advanced quantum generative models on near-term quantum devices.
  arXiv  Detail & Related papers  (2020-10-13T06:57:17Z)
• Verifying Results of the IBM Qiskit Quantum Circuit Compilation Flow [7.619626059034881]
  We propose an efficient scheme for quantum circuit equivalence checking. The proposed scheme allows to verify even large circuit instances with tens of thousands of operations within seconds or even less.
  arXiv  Detail & Related papers  (2020-09-04T19:58: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.