On the public citation graph

An Automata-Based Framework for Verification and Bug Hunting in Quantum Circuits

0 signed · 31 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-031-37709-9_7openalex-snapshot
AutoQ: An Automata-Based Quantum Circuit Verifier
inferredcites →https://doi.org/10.1007/978-3-032-06770-8_14openalex-snapshot
Advanced Equivalence Checking for Quantum Circuits
inferredcites →https://doi.org/10.1007/978-3-032-06770-8_16openalex-snapshot
Random Stimuli Generation for the Verification of Quantum Circuits
inferredcites →https://doi.org/10.1007/978-3-642-28756-5_7openalex-snapshot
VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata
inferredcites →https://doi.org/10.1038/s41586-019-1666-5openalex-snapshot
Quantum supremacy using a programmable superconducting processor
inferredcites →https://doi.org/10.1088/1367-2630/13/4/043016openalex-snapshot
Interacting quantum observables: categorical algebra and diagrammatics
inferredcites →https://doi.org/10.1088/2058-9565/aab822openalex-snapshot
Quantum optimization using variational algorithms on near-term quantum devices
inferredcites →https://doi.org/10.1109/dac18074.2021.9586191openalex-snapshot
Bit-Slicing the Hilbert Space: Scaling Up Accurate Quantum Circuit Simulation
inferredcites →https://doi.org/10.1109/ismvl.2008.43openalex-snapshot
RevLib: An Online Resource for Reversible Functions and Reversible Circuits
inferredcites →https://doi.org/10.1109/qce53715.2022.00082openalex-snapshot
Partial Equivalence Checking of Quantum Circuits
inferredcites →https://doi.org/10.1109/sfcs.1994.365700openalex-snapshot
Algorithms for quantum computation: discrete logarithms and factoring
inferredcites →https://doi.org/10.1109/tcad.2018.2834427openalex-snapshot
Advanced Simulation of Quantum Computations
inferredcites →https://doi.org/10.1142/s0219749905001067openalex-snapshot
"NON-IDENTITY-CHECK" IS QMA-COMPLETE
inferredcites →https://doi.org/10.1145/2049706.2049708openalex-snapshot
Floyd--hoare logic for quantum programs
inferredcites →https://doi.org/10.1145/237814.237866openalex-snapshot
A fast quantum mechanical algorithm for database search
inferredcites →https://doi.org/10.1145/2791292openalex-snapshot
Fast
inferredcites →https://doi.org/10.1145/3453483.3454061openalex-snapshot
Quantum abstract interpretation
inferredcites →https://doi.org/10.1145/3489517.3530481openalex-snapshot
Accurate BDD-based unitary operator manipulation for scalable and robust quantum circuit verification
inferredcites →https://doi.org/10.1145/3591270openalex-snapshot
An Automata-Based Framework for Verification and Bug Hunting in Quantum Circuits
inferredcites →https://doi.org/10.1145/3704868openalex-snapshot
Verifying Quantum Circuits with Level-Synchronized Tree Automata
inferredcites →https://doi.org/10.4204/eptcs.287.1openalex-snapshot
Towards Large-scale Functional Verification of Universal Quantum Circuits

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-032-22749-2_21openalex-snapshot
Equivalence Checking of Quantum Circuits via Path-Sum and Weighted Model Counting
inferred← citeshttps://doi.org/10.1007/978-3-032-32537-2_15openalex-snapshot
A Practical Specification Language for Automatic Quantum Program Verification
inferred← citeshttps://doi.org/10.1145/3776712openalex-snapshot
Parameterized Verification of Quantum Circuits
inferred← citeshttps://doi.org/10.1145/3839506openalex-snapshot
Verifying Repeat-until-Success Protocols using Automata
inferred← citeshttps://doi.org/10.32388/h7d715openalex-snapshot
A Review of Formal Methods in Quantum Circuit Verification
inferred← citeshttps://doi.org/10.32388/h7d715.2openalex-snapshot
A Review of Formal Methods in Quantum Circuit Verification
inferred← citeshttps://doi.org/10.32388/h7d715.3openalex-snapshot
A Review of Formal Methods in Quantum Circuit Verification
inferred← citeshttps://doi.org/10.32388/h7d715.4openalex-snapshot
A Review of Formal Methods in Quantum Circuit Verification
inferred← citeshttps://doi.org/10.32388/h7d715.5openalex-snapshot
A Review of Formal Methods in Quantum Circuit Verification
inferred← citeshttps://doi.org/10.32388/h7d715.6openalex-snapshot
A Review of Formal Methods in Quantum Circuit Verification
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.