Cover Image

Rewriting and Completeness of Sum-Over-Paths in Dyadic Fragments of Quantum Computing

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Vilmart, Renaud
Format:	Preprint
Published:	2023
Subjects:	Logic in Computer Science Quantum Physics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The decohered ZX-calculus
by: Carette, Titouan, et al.
Published: (2025)

The Many-Worlds Calculus
by: Chardonnet, Kostia, et al.
Published: (2022)

Potential for Polynomial Solution for NP-Complete Problems using Quantum Computation
by: Badihian, Neema Rustin
Published: (2025)

Simpler Presentations for Many Fragments of Quantum Circuits
by: Blake, Colin
Published: (2026)

Complete Quantum Relational Hoare Logics from Optimal Transport Duality
by: Barthe, Gilles, et al.
Published: (2025)

A Complete Equational Theory for Real-Clifford+CH Quantum Circuits
by: Clément, Alexandre
Published: (2026)

The Tensor-Plus Calculus
by: Chardonnet, Kostia, et al.
Published: (2025)

A Complete Equational Presentation of Qudit Circuits via Polycontrolled PROPs
by: Blake, Colin
Published: (2026)

A Complete and Natural Rule Set for Multi-Qutrit Clifford Circuits
by: Li, Sarah Meng, et al.
Published: (2025)

Quantum First-Order Logics That Capture Logarithmic-Time/Space Quantum Computability
by: Yamakami, Tomoyuki
Published: (2025)

Quadratic Sums-of-Powers for Fixed-Parameter Tractable Quantum-Circuit Simulation
by: de Colnet, Alexis, et al.
Published: (2026)

A Complete Graphical Language for Linear Optical Circuits with Finite-Photon-Number Sources and Detectors
by: Heurtel, Nicolas
Published: (2024)

A Duality Theorem for Classical-Quantum States with Applications to Complete Relational Program Logics
by: Barthe, Gilles, et al.
Published: (2025)

Quantum references
by: Unruh, Dominique
Published: (2021)

Bayesian Inference in Quantum Programs
by: Gehnen, Christina, et al.
Published: (2025)

No Scratch Quantum Computing by Reducing Qubit Overhead for Efficient Arithmetics
by: Faizy, Omid, et al.
Published: (2025)

Simulating Quantum Circuits by Model Counting
by: Mei, Jingyi, et al.
Published: (2024)

The Computability Path Order for Beta-Eta-Normal Higher-Order Rewriting (Full Version)
by: Niederhauser, Johannes, et al.
Published: (2025)

Quantum Petri Nets with Event Structures semantics
by: Joachim, Julien Saan, et al.
Published: (2025)

End-to-End Formalization of Quantum Error Correction
by: Ehatamm, Mattias, et al.
Published: (2026)

Quantum Petri Nets with Event Structure semantics
by: Joachim, Julien Saan, et al.
Published: (2025)

Algebraic Structure of Quantum Controlled States and Operators
by: Agnew, Edwin, et al.
Published: (2026)

RapunSL: Untangling Quantum Computing with Separation, Linear Combination and Mixing
by: Matsushita, Yusuke, et al.
Published: (2025)

Qunity: A Unified Language for Quantum and Classical Computing (Extended Version)
by: Voichick, Finn, et al.
Published: (2022)

Verifying Quantum Phase Estimation (QPE) using Prove-It
by: Witzel, Wayne M., et al.
Published: (2023)

Formal Verification of Quantum Programs: Theory, Tools and Challenges
by: Lewis, Marco, et al.
Published: (2021)

QReach: A Reachability Analysis Tool for Quantum Markov Chains
by: Dai, Aochu, et al.
Published: (2025)

Proceedings of the 21st International Conference on Quantum Physics and Logic
by: Díaz-Caro, Alejandro, et al.
Published: (2024)

A Quantum-Control Lambda-Calculus with Multiple Measurement Bases
by: Díaz-Caro, Alejandro, et al.
Published: (2025)

Proceedings of the 22nd International Conference on Quantum Physics and Logic
by: Díaz-Caro, Alejandro, et al.
Published: (2025)

Operator Spaces, Linear Logic and the Heisenberg-Schrödinger Duality of Quantum Theory
by: Lindenhovius, Bert, et al.
Published: (2025)

Formally Verifying Quantum Phase Estimation Circuits with 1,000+ Qubits
by: Govindankutty, Arun, et al.
Published: (2026)

Verification of Quantum Circuits through Barrier Certificates using a Scenario Approach
by: Hu, Siwei, et al.
Published: (2025)

Complete equational theories for classical and quantum Gaussian relations
by: Booth, Robert I., et al.
Published: (2024)

Strong Structural Bounds for MaxSAT: The Fine Details of Using Neuromorphic and Quantum Hardware Accelerators
by: Bannach, Max, et al.
Published: (2024)

Basic interactive algorithms: Preview
by: Gurevich, Yuri
Published: (2025)

SAT, Gadgets, Max2XOR, and Quantum Annealers
by: Ansótegui, Carlos, et al.
Published: (2024)

MerLean: An Agentic Framework for Autoformalization in Quantum Computation
by: Ren, Yuanjie, et al.
Published: (2026)

Search-Driven Clause Learning for Product-State Quantum $k$-SAT (PRODSAT-QSAT)
by: González-Castillo, Samuel, et al.
Published: (2026)

A Rewriting Theory for Quantum Lambda-Calculus
by: Faggian, Claudia, et al.
Published: (2024)