18345364. DYNAMIC CHECKPOINT FOR SIMULATION simplified abstract (Dell Products L.P.)
Contents
- 1 DYNAMIC CHECKPOINT FOR SIMULATION
DYNAMIC CHECKPOINT FOR SIMULATION
Organization Name
Inventor(s)
Victor Fong of Medford MA (US)
Brendan Burns Healy of Haddonfield NJ (US)
Benjamin E. Santaus of Somerville MA (US)
DYNAMIC CHECKPOINT FOR SIMULATION - A simplified explanation of the abstract
This abstract first appeared for US patent application 18345364 titled 'DYNAMIC CHECKPOINT FOR SIMULATION
Simplified Explanation
The abstract describes a method for simulating the execution of a quantum circuit on a classical computing infrastructure by creating and storing hashes of state vectors at various points in the simulation process.
- Simulating execution of a quantum circuit on a classical computing infrastructure
- Creating and storing hashes of state vectors during the simulation process
- Calculating hashes of each gate across the quantum circuit
- Looking up and restoring state vector hashes associated with specific gates
Potential Applications
This technology could be applied in quantum computing research, algorithm development, and testing of quantum circuits.
Problems Solved
This method helps in verifying the correctness of quantum circuit simulations and tracking the state of the system during execution.
Benefits
- Improved accuracy in simulating quantum circuits
- Efficient storage and retrieval of state vector information
- Enhanced debugging capabilities for quantum algorithms
Potential Commercial Applications
"Quantum Circuit Simulation Hashing Method for Improved Accuracy and Debugging" could find applications in quantum software development companies, research institutions, and quantum computing hardware manufacturers.
Possible Prior Art
One possible prior art could be the use of hash functions in classical computing for data verification and integrity purposes.
Unanswered Questions
How does this method compare to existing quantum circuit simulation techniques?
This article does not provide a direct comparison with other quantum circuit simulation methods.
What are the limitations of this hashing method in quantum circuit simulation?
The article does not address any potential limitations or drawbacks of using this hashing method in quantum circuit simulation.
Original Abstract Submitted
One example method includes simulating execution of a quantum circuit on a classical computing infrastructure, after one or more times that a gate of the quantum circuit is executed as part of the simulating, creating, after execution of that gate, a hash of a state vector that captures a state of the execution of the quantum circuit, storing the hash, and respective associated data structure, in storage, then as part of a simulated execution process, calculating a hash of each gate across the new quantum circuit, looking up, in the storage, a hash of a state vector associated with execution of one of the gates of the new quantum circuit, and restoring, from storage, the latest hash of the state vector associated with the one gate of the new quantum circuit.
