Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Leveraging Secondary Storage to Simulate Deep 54-qubit Sycamore Circuits (1910.09534v2)

Published 21 Oct 2019 in quant-ph

Abstract: In a paper, we showed that secondary storage can extend the range of quantum circuits that can be practically simulated with classical algorithms. Here we refine those techniques and apply them to the simulation of Sycamore circuits with 53 and 54 qubits, with the entanglement pattern ABCDCDAB that has proven difficult to classically simulate with other approaches. Our analysis shows that on the Summit supercomputer at Oak Ridge National Laboratories, such circuits can be simulated with high fidelity to arbitrary depth in a matter of days, outputting all the amplitudes.

Citations (146)

Summary

  • The paper introduces a robust secondary storage method that extends classical simulation capabilities for deep 53 and 54-qubit Sycamore circuits.
  • The strategy employs tensor slicing, contraction deferral, and circuit segmentation to efficiently manage computational resources on the Summit supercomputer.
  • The approach achieves high-fidelity simulations within a few days, demonstrating classical computing’s potential for benchmarking quantum circuits.

Leveraging Secondary Storage for Deep 54-qubit Sycamore Circuit Simulation

This paper presents an approach to simulate deep Sycamore quantum circuits composed of 53 and 54 qubits, using classical algorithms enhanced by secondary storage. The authors build on previous work demonstrating that classical simulation of quantum circuits can be substantially extended with efficient use of secondary storage. Their principal achievement lies in refining these techniques, allowing for the simulation of complex quantum circuits, such as those with the ABCDCDAB entanglement pattern, on the Summit supercomputer at Oak Ridge National Laboratories.

Main Contributions

The paper introduces several key techniques to extend the classical simulation capabilities, specifically:

  • Secondary Storage Utilization: The authors report that employing secondary storage extends the range of quantum circuits that can be practically simulated, specifically targeting the Sycamore circuits of 53 and 54 qubits. These circuits have a peculiar entanglement pattern that challenges classical simulation approaches.
  • Simulation Strategy: A notable contribution is the detailed simulation strategy, including refined methodologies for tensor slicing, contraction deferral, and segmenting circuits into manageable subcircuits for storage and computation. This approach systematically addresses the limitations posed by conventional RAM constraints.
  • Performance Estimation: Utilizing Summit's computational capabilities, the authors estimate that these circuits, requiring high fidelity with arbitrary depth, can be simulated within a few days. This suggests that realistic simulations of large quantum systems can be achieved without the imminent need for full-scale quantum hardware.

Technical Approach

The authors leverage a hybrid technique that combines methods for processing large quantum circuits with efficient data management strategies:

  • Tensor Network and Contraction Deferral: Partitioning circuits into subcircuits that can be processed independently reduces memory requirements. The approach exploits separable tensors and defers contractions, allowing the representation of quantum states via hypergraphs.
  • Tensor Slicing and Secondary Storage: By slicing the tensor network, the simulation can iteratively handle fixed indices, optimizing the use of available storage. The storing and accessing of quantum state slices become the key to managing computational demand by enabling frequent writing and reading operations adapted to Summit's architecture.
  • System Implementations: Detailing the implementations, the authors provide a rigorous account of the configurations and operations in their methodology, hinting at the potential for further optimizations through GPU support.

Implications

Practically, this work reaffirms the feasibility of classical supercomputing as a viable pathway for simulating quantum circuits, extending the threshold for quantum advantage verification. Theoretical implications concern the continued development of algorithms capable of bridging the gap between classical and quantum computational realms, offering insights into circuit fidelity and quantum error correction potential without hardware reliance.

Future Directions

The paper hints at potential directions for future research, particularly in enhancing the efficiency of classical-quantum interaction through algorithmic improvements. It suggests extending tensor-based methods to further reduce computational costs, possibly applying similar techniques to other quantum systems beyond Sycamore circuits. Furthermore, as quantum hardware matures, these simulation methods could serve to benchmark and verify quantum computational results against classical frameworks, thus continuing to inform the development of error-free quantum systems.

Through its systematic approach, this paper contributes significantly to the discourse on quantum computations' classical simulations, providing a robust pathway for near-term advancements in hybrid computational methodologies.

Youtube Logo Streamline Icon: https://streamlinehq.com