Cover Image

Flexible Type-Based Resource Estimation in Quantum Circuit Description Languages

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Colledan, Andrea, Lago, Ugo Dal
Format:	Preprint
Published:	2024
Subjects:	Programming Languages Computational Complexity 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

Reasonable Space for the $λ$-Calculus, Logarithmically
by: Accattoli, Beniamino, et al.
Published: (2022)

On Circuit Description Languages, Indexed Monads, and Resource Analysis
by: Sakayori, Ken, et al.
Published: (2025)

Linearization via Rewriting (Long Version)
by: Lago, Ugo Dal, et al.
Published: (2025)

A Characterization of Basic Feasible Functionals Through Higher-Order Rewriting and Tuple Interpretations
by: Baillot, Patrick, et al.
Published: (2024)

Multi types and reasonable space
by: Accattoli, Beniamino, et al.
Published: (2022)

Verification of Recursively Defined Quantum Circuits
by: Ying, Mingsheng, et al.
Published: (2024)

Quantum Circuits Are Just a Phase
by: Heunen, Chris, et al.
Published: (2025)

Kleene algebra with commutativity conditions is undecidable
by: de Amorim, Arthur Azevedo, et al.
Published: (2024)

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

SAQR-QC: A Logic for Scalable but Approximate Quantitative Reasoning about Quantum Circuits
by: Yu, Nengkun, et al.
Published: (2025)

Program Synthesis is $Σ_3^0$-Complete
by: Kim, Jinwoo
Published: (2024)

LFPL: Revisited and Mechanized
by: Glover, Nathaniel, et al.
Published: (2026)

Complete and tractable machine-independent characterizations of second-order polytime
by: Hainry, Emmanuel, et al.
Published: (2022)

Reversible Computation with Stacks and "Reversible Management of Failures"
by: Palazzo, Matteo, et al.
Published: (2025)

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

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

From Time to Space: The Impact of Linearity in Higher-Order Datalog
by: Charalambidis, Angelos, et al.
Published: (2026)

The Power of Negation in Higher-Order Datalog
by: Charalambidis, Angelos, et al.
Published: (2025)

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

Counting and Sampling Traces in Regular Languages
by: de Colnet, Alexis, et al.
Published: (2025)

Satisfiability of commutative vs. non-commutative CSPs
by: Bulatov, Andrei A., et al.
Published: (2024)

Symbolic Specification and Reasoning for Quantum Data and Operations
by: Ying, Mingsheng
Published: (2025)

Traq: Estimating the Quantum Cost of Classical Programs
by: Peduri, Anurudh, et al.
Published: (2025)

A Practical Quantum Hoare Logic with Classical Variables, I
by: Ying, Mingsheng
Published: (2024)

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

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

A Schematic Definition of Quantum Polynomial Time Computability
by: Yamakami, Tomoyuki
Published: (2018)

Compiling Quantum Lambda-Terms into Circuits via the Geometry of Interaction
by: Chardonnet, Kostia, et al.
Published: (2026)

Cypher is Turing-Complete: A Formal Proof via 2-Counter Machine Simulation
by: Halftermeyer, Pierre
Published: (2026)

Towards a Characterization of Two-way Bijections in a Reversible Computational Model
by: Palazzo, Matteo, et al.
Published: (2025)

A faster FPRAS for #NFA
by: Meel, Kuldeep S., et al.
Published: (2023)

Truly Supercritical Trade-offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler-Leman
by: de Rezende, Susanna F., et al.
Published: (2024)

Uniformity within Parameterized Circuit Classes
by: Hegeman, Steef, et al.
Published: (2025)

A programming language combining quantum and classical control
by: Dave, Kinnari, et al.
Published: (2025)

Optimal Lower Bounds for Symmetric Modular Circuits
by: Pago, Benedikt
Published: (2026)

On the Descriptive Complexity of Vertex Deletion Problems
by: Bannach, Max, et al.
Published: (2024)

The Descriptive Complexity of Relation Modification Problems
by: Chudigiewitsch, Florian, et al.
Published: (2026)

On the Unprovability of Circuit Size Bounds in Intuitionistic $\mathsf{S}^1_2$
by: Chen, Lijie, et al.
Published: (2024)

QbC: Quantum Correctness by Construction
by: Peduri, Anurudh, et al.
Published: (2023)

2-ASP(Q) programs with weak constraints: Complexity and efficient implementation
by: Cuteri, Andrea, et al.
Published: (2026)