On the public citation graph

Verifying Quantum Circuits with Level-Synchronized Tree Automata

https://doi.org/10.1145/3704868
0 signed · 66 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/3-540-55210-3_181openalex-snapshot
Equality and disequality constraints on direct subterms in tree automata
inferredcites →https://doi.org/10.1007/978-3-030-25543-5_12openalex-snapshot
Formal Verification of Quantum Algorithms Using Quantum Hoare Logic
inferredcites →https://doi.org/10.1007/978-3-030-72019-3_6openalex-snapshot
An Automated Deductive Verification Framework for Circuit-building Quantum Programs
inferredcites →https://doi.org/10.1007/978-3-031-27481-7_12openalex-snapshot
symQV: Automated Symbolic Verification of Quantum Programs
inferredcites →https://doi.org/10.1007/978-3-031-32157-3_1openalex-snapshot
Efficient Implementation of LIMDDs for Quantum Circuit Simulation
inferredcites →https://doi.org/10.1007/978-3-031-37709-9_11openalex-snapshot
Symbolic Quantum Simulation with Quasimodo
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-031-38499-8_10openalex-snapshot
A Theory of Cartesian Arrays (with Applications in Quantum Circuit Verification)
inferredcites →https://doi.org/10.1007/978-3-031-45332-8_10openalex-snapshot
Fast Equivalence Checking of Quantum Circuits of Clifford Gates
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-540-28644-8_3openalex-snapshot
A Survey of Regular Model Checking
inferredcites →https://doi.org/10.1007/978-3-540-69166-2_18openalex-snapshot
Quantum Entanglement Analysis Based on Abstract Interpretation
inferredcites →https://doi.org/10.1007/978-3-642-00982-2_38openalex-snapshot
Rigid Tree Automata
inferredcites →https://doi.org/10.1007/978-3-642-17511-4_20openalex-snapshot
Dafny: An Automatic Program Verifier for Functional Correctness
inferredcites →https://doi.org/10.1007/978-3-642-28729-9_11openalex-snapshot
Extending ${\cal H}_1$ -Clauses with Path Disequalities
inferredcites →https://doi.org/10.1007/978-94-017-0849-4_10openalex-snapshot
Going Beyond Bell’s Theorem
inferredcites →https://doi.org/10.1007/s10009-011-0205-yopenalex-snapshot
Abstract regular (tree) model checking
inferredcites →https://doi.org/10.1016/j.ic.2010.11.015openalex-snapshot
Rigid tree automata and applications
inferredcites →https://doi.org/10.1017/s0960129506005251openalex-snapshot
Quantum weakest preconditions
inferredcites →https://doi.org/10.1038/nature23474openalex-snapshot
Quantum machine learning
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-2630openalex-snapshot
Elementary Excitations in Fractional Quantum Hall Effect from Classical Constraints
inferredcites →https://doi.org/10.1098/rspa.2017.0551openalex-snapshot
Quantum machine learning: a classical perspective
inferredcites →https://doi.org/10.1103/physreva.102.062612openalex-snapshot
Efficient quantum circuits for quantum computational chemistry
inferredcites →https://doi.org/10.1103/physrevlett.91.147902openalex-snapshot
Efficient Classical Simulation of Slightly Entangled Quantum Computations
inferredcites →https://doi.org/10.1103/revmodphys.92.015003openalex-snapshot
Quantum computational chemistry
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.2006.35openalex-snapshot
QMDD: A Decision Diagram Structure for Reversible and Quantum Circuits
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/lics.2005.1openalex-snapshot
A Functional Quantum Programming Language
inferredcites →https://doi.org/10.1109/lics.2019.8785779openalex-snapshot
Quantum Hoare Logic with Ghost Variables
inferredcites →https://doi.org/10.1109/qce53715.2022.00082openalex-snapshot
Partial Equivalence Checking of Quantum Circuits
inferredcites →https://doi.org/10.1109/tcad.2018.2834427openalex-snapshot
Advanced Simulation of Quantum Computations
inferredcites →https://doi.org/10.1137/050644756openalex-snapshot
Simulating Quantum Computation by Contracting Tensor Networks
inferredcites →https://doi.org/10.1142/s0129054107004929openalex-snapshot
BISIMULATION MINIMIZATION OF TREE AUTOMATA
inferredcites →https://doi.org/10.1142/s012905411000743xopenalex-snapshot
TREE AUTOMATA WITH GLOBAL CONSTRAINTS
inferredcites →https://doi.org/10.1145/167088.167097openalex-snapshot
Quantum complexity theory
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/2491956.2462177openalex-snapshot
Quipper
inferredcites →https://doi.org/10.1145/3314221.3314584openalex-snapshot
An applied quantum Hoare logic
inferredcites →https://doi.org/10.1145/3453483.3454061openalex-snapshot
Quantum abstract interpretation
inferredcites →https://doi.org/10.1145/3456877openalex-snapshot
Quantum Hoare Logic with Classical Variables
inferredcites →https://doi.org/10.1145/3458817.3476169openalex-snapshot
SV-sim
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/3514355openalex-snapshot
A Tensor Network based Decision Diagram for Representation of Quantum Circuits
inferredcites →https://doi.org/10.1145/3519939.3523433openalex-snapshot
Quartz: superoptimization of Quantum circuits
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/360248.360252openalex-snapshot
Symbolic execution and program testing
inferredcites →https://doi.org/10.23919/date.2019.8715261openalex-snapshot
IBM’s Qiskit Tool Chain: Working with and Developing for Real Quantum Computers
inferredcites →https://doi.org/10.4204/eptcs.287.1openalex-snapshot
Towards Large-scale Functional Verification of Universal Quantum Circuits
inferredcites →https://doi.org/10.48550/arxiv.2003.02055openalex-snapshot
Thermodynamics of a Quantum Annealer
inferredcites →https://doi.org/10.5281/zenodo.2573505openalex-snapshot
Qiskit/qiskit-metapackage: Qiskit 0.43.0

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-031-90660-2_5openalex-snapshot
AutoQ 2.0: From Verification of Quantum Circuits to Verification of Quantum Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-97439-7_16openalex-snapshot
On the Verification of Quantum Circuits (Research Challenges and Opportunities)
inferred← citeshttps://doi.org/10.1007/978-3-031-98685-7_2openalex-snapshot
FeynmanDD: Quantum Circuit Analysis with Classical Decision Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-031-98685-7_3openalex-snapshot
D-Hammer: Efficient Equational Reasoning for Labelled Dirac Notation
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.1007/978-3-032-32537-2_19openalex-snapshot
Quokka#: Quantum Computing with #SAT
inferred← citeshttps://doi.org/10.1007/s10009-026-00845-1openalex-snapshot
Challenges in Quantum Programs Analysis
inferred← citeshttps://doi.org/10.1145/3725728openalex-snapshot
An Automata-Based Framework for Verification and Bug Hunting in Quantum Circuits
inferred← citeshttps://doi.org/10.1145/3776658openalex-snapshot
An Expressive Assertion Language for Quantum Programs
inferred← citeshttps://doi.org/10.1145/3776712openalex-snapshot
Parameterized Verification of Quantum Circuits
inferred← citeshttps://doi.org/10.1145/3779212.3790134openalex-snapshot
Borrowing Dirty Qubits in Quantum Programs
inferred← citeshttps://doi.org/10.1145/3839506openalex-snapshot
Verifying Repeat-until-Success Protocols using Automata
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.