Parameterized equivalence checking of quantum circuit generators via weighted automata
quant-ph
Submitted: 2026-11-09
Updated: 2026-11-09
Code: https://github.com/alpha7en/ladder_ec
Terminology
Sources
- Going Beyond Bell's Theorem
- An approximate Fourier transform useful in quantum factoring
- Equivalence Checking of Parameterised Quantum Circuits
- Cutoff Theorems for the Equivalence of Parameterized Quantum Circuits (Extended)
- MQT Bench: Benchmarking Software and Design Automation Tools for Quantum Computing
- Application-Oriented Performance Benchmarks for Quantum Computing
- A Survey on Testing and Analysis of Quantum Software
- QuanBench: Benchmarking Quantum Code Generation with Large Language Models
- Advanced Equivalence Checking for Quantum Circuits
- Equivalence Checking of Quantum Circuits with the ZX-Calculus
- Parameterized Verification of Quantum Circuits (Technical Report)
- A Case for Synthesis of Recursive Quantum Unitary Programs
- Finite automata for caching in matrix product algorithms
- Connecting Weighted Automata, Tensor Networks and Recurrent Neural Networks through Spectral Learning
- Quantum Tensor Networks, Stochastic Processes, and Weighted Automata
- Notes on Equivalence and Minimization of Weighted Automata
- Sequential generation of entangled multi-qubit states
- A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
- Matrix Product State Representations
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements