dorsal/arxiv
View SchemaGate-Level Simulation of Quantum Circuits
| Authors | George F. Viamontes, Manoj Rajagopalan, Igor L. Markov, John P. Hayes |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0208003 |
| URL | https://arxiv.org/abs/quant-ph/0208003 |
Abstract
While thousands of experimental physicists and chemists are currently trying to build scalable quantum computers, it appears that simulation of quantum computation will be at least as critical as circuit simulation in classical VLSI design. However, since the work of Richard Feynman in the early 1980s little progress was made in practical quantum simulation. Most researchers focused on polynomial-time simulation of restricted types of quantum circuits that fall short of the full power of quantum computation. Simulating quantum computing devices and useful quantum algorithms on classical hardware now requires excessive computational resources, making many important simulation tasks infeasible. In this work we propose a new technique for gate-level simulation of quantum circuits which greatly reduces the difficulty and cost of such simulations. The proposed technique is implemented in a simulation tool called the Quantum Information Decision Diagram (QuIDD) and evaluated by simulating Grover's quantum search algorithm. The back-end of our package, QuIDD Pro, is based on Binary Decision Diagrams, well-known for their ability to efficiently represent many seemingly intractable combinatorial structures. This reliance on a well-established area of research allows us to take advantage of existing software for BDD manipulation and achieve unparalleled empirical results for quantum simulation.
{
"annotation_id": "de6b2d43-7d53-472e-985b-81a721113f8f",
"date_created": "2026-03-02T18:01:53.064000Z",
"date_modified": "2026-03-02T18:01:53.064000Z",
"file_hash": "7849052e4246e8fc789c591ce2344e53469a3dd57cde20d1e4baa676ab267e93",
"private": false,
"record": {
"abstract": "While thousands of experimental physicists and chemists are currently trying\nto build scalable quantum computers, it appears that simulation of quantum\ncomputation will be at least as critical as circuit simulation in classical\nVLSI design. However, since the work of Richard Feynman in the early 1980s\nlittle progress was made in practical quantum simulation. Most researchers\nfocused on polynomial-time simulation of restricted types of quantum circuits\nthat fall short of the full power of quantum computation. Simulating quantum\ncomputing devices and useful quantum algorithms on classical hardware now\nrequires excessive computational resources, making many important simulation\ntasks infeasible. In this work we propose a new technique for gate-level\nsimulation of quantum circuits which greatly reduces the difficulty and cost of\nsuch simulations. The proposed technique is implemented in a simulation tool\ncalled the Quantum Information Decision Diagram (QuIDD) and evaluated by\nsimulating Grover\u0027s quantum search algorithm. The back-end of our package,\nQuIDD Pro, is based on Binary Decision Diagrams, well-known for their ability\nto efficiently represent many seemingly intractable combinatorial structures.\nThis reliance on a well-established area of research allows us to take\nadvantage of existing software for BDD manipulation and achieve unparalleled\nempirical results for quantum simulation.",
"arxiv_id": "quant-ph/0208003",
"authors": [
"George F. Viamontes",
"Manoj Rajagopalan",
"Igor L. Markov",
"John P. Hayes"
],
"categories": [
"quant-ph"
],
"title": "Gate-Level Simulation of Quantum Circuits",
"url": "https://arxiv.org/abs/quant-ph/0208003"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "c4d08568-fafc-4b12-b767-c8ba99e35cdd",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}