SFQ counter-based precomputation for large-scale cryogenic VQE machines

• URL: http://arxiv.org/abs/2403.00363v1
• Date: Fri, 1 Mar 2024 08:47:15 GMT
• Title: SFQ counter-based precomputation for large-scale cryogenic VQE machines
• Authors: Yosuke Ueno, Satoshi Imamura, Yuna Tomida, Teruo Tanimoto, Masamitsu Tanaka, Yutaka Tabuchi, Koji Inoue, Hiroshi Nakamura
• Abstract summary: The variational quantum eigensolver (VQE) is a promising candidate that brings practical benefits from quantum computing. We propose a tailored counter-based module with single flux quantum circuits in 4-K stage which precomputes a part of VQE calculation. The evaluation shows that our system reduces the required bandwidth by 97%, and with this drastic reduction, total power consumption is reduced by 93%.
• Score: 3.0241926534174097
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The variational quantum eigensolver (VQE) is a promising candidate that brings practical benefits from quantum computing. However, the required bandwidth in/out of a cryostat is a limiting factor to scale cryogenic quantum computers. We propose a tailored counter-based module with single flux quantum circuits in 4-K stage which precomputes a part of VQE calculation and reduces the amount of inter-temperature communication. The evaluation shows that our system reduces the required bandwidth by 97%, and with this drastic reduction, total power consumption is reduced by 93% in the case where 277 VQE programs are executed in parallel on a 10000-qubit machine.

Related papers

• C3-VQA: Cryogenic Counter-based Co-processor for Variational Quantum Algorithms [2.8993184117177337]
  Cryogenic quantum computers play a leading role in demonstrating quantum advantage. Given the severe constraints on the cooling capacity in cryogenic environments, thermal design is crucial for the scalability of these computers. One solution is near-data processing using ultra-low-power computational logic within the cryostat.
  arXiv  Detail & Related papers  (2024-09-12T08:47:44Z)
• Analog Counterdiabatic Quantum Computing [37.47457207667808]
  We design counterdiabatic protocols to circumvent limitations via ACQC on analog quantum devices with ground-Rydberg qubits. We experimentally apply it to the maximum independent set (MIS) problem with up to 100 qubits and show an enhancement in the approximation ratio with a short evolution time.
  arXiv  Detail & Related papers  (2024-05-23T17:46:40Z)
• 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)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• Scaling Limits of Quantum Repeater Networks [62.75241407271626]
  Quantum networks (QNs) are a promising platform for secure communications, enhanced sensing, and efficient distributed quantum computing. Due to the fragile nature of quantum states, these networks face significant challenges in terms of scalability. In this paper, the scaling limits of quantum repeater networks (QRNs) are analyzed.
  arXiv  Detail & Related papers  (2023-05-15T14:57:01Z)
• Partially Fault-tolerant Quantum Computing Architecture with Error-corrected Clifford Gates and Space-time Efficient Analog Rotations [0.5658123802733283]
  We propose a quantum computing architecture to close the gap between NISQ and FTQC. For early-FTQC devices, we can perform roughly $1.72 times 107$ Clifford operations and $3.75 times 104$ arbitrary rotations on 64 logical qubits.
  arXiv  Detail & Related papers  (2023-03-23T11:21:41Z)
• Delegated variational quantum algorithms based on quantum homomorphic encryption [69.50567607858659]
  Variational quantum algorithms (VQAs) are one of the most promising candidates for achieving quantum advantages on quantum devices. The private data of clients may be leaked to quantum servers in such a quantum cloud model. A novel quantum homomorphic encryption (QHE) scheme is constructed for quantum servers to calculate encrypted data.
  arXiv  Detail & Related papers  (2023-01-25T07:00:13Z)
• Single Flux Quantum-Based Digital Control of Superconducting Qubits in a Multi-Chip Module [39.5906786952554]
  We introduce a multi-chip module architecture to suppress phonon-mediated QP poisoning. We demonstrate an error per Clifford gate of 1.2(1)%, an order-of-magnitude reduction over the gate error achieved in the initial realization of SFQ-based qubit control.
  arXiv  Detail & Related papers  (2023-01-13T18:37:08Z)
• Reqomp: Space-constrained Uncomputation for Quantum Circuits [4.703757073704313]
  We present Reqomp, a method to automatically synthesize correct and efficient uncomputation of ancillae. Our evaluation demonstrates that Reqomp can significantly reduce the number of required ancilla qubits by up to 96%.
  arXiv  Detail & Related papers  (2022-12-20T16:23:04Z)
• Iterative Qubits Management for Quantum Index Searching in a Hybrid System [56.39703478198019]
  IQuCS aims at index searching and counting in a quantum-classical hybrid system. We implement IQuCS with Qiskit and conduct intensive experiments. Results demonstrate that it reduces qubits consumption by up to 66.2%.
  arXiv  Detail & Related papers  (2022-09-22T21:54:28Z)
• Quantum thermodynamic methods to purify a qubit on a quantum processing unit [68.8204255655161]
  We report on a quantum thermodynamic method to purify a qubit on a quantum processing unit equipped with identical qubits. Our starting point is a three qubit design that emulates the well known two qubit swap engine. We implement it on a publicly available superconducting qubit based QPU, and observe a purification capability down to 200 mK.
  arXiv  Detail & Related papers  (2022-01-31T16:13:57Z)
• Quantum error mitigation as a universal error-minimization technique: applications from NISQ to FTQC eras [0.9622115055919379]
  In the early years of fault-tolerant quantum computing (FTQC), the available code distance and the number of magic states will be restricted. Here, we integrate quantum error correction and quantum error mitigation into an efficient FTQC architecture. This scheme will dramatically alleviate the required computational overheads and hasten the arrival of the FTQC era.
  arXiv  Detail & Related papers  (2020-10-08T10:27:29Z)
• 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.