Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Classical reduction and quantum induction in constrained systems

Nicolaas P. Landsman, P. Nattermann, Doebner, H.-D., Wolfgang Scherer

Published Jan 1, 1997• 0 citations
OpenAlex

Related papers

Forward and Backward Constrained Bisimulations for Quantum Circuits Using Decision Diagrams

Lukas Burgholzer, Antonio Jiménez-Pastor, Kim G. Larsen +3 more

Efficient methods for the simulation of quantum circuits on classical computers are crucial for their analysis due to the exponential growth of the problem size with the number of qubits. Here we study lumping methods based on bisimulation, an established class of techniques that has been proven successful for (classic) stochastic and deterministic systems such as Markov chains and ordinary differential equations. Forward constrained bisimulation yields a lower-dimensional model which exactly preserves quantum measurements projected on a linear subspace of interest. Backward constrained bisimulation gives a reduction that is valid on a subspace containing the circuit input, from which the circuit result can be fully recovered. We provide an algorithm to compute the constraint bisimulations yielding coarsest reductions in both cases, using a duality result relating the two notions. As applications, we provide theoretical bounds on the size of the reduced state space for well-known quantum algorithms for search, optimization, and factorization. Using a prototype implementation, we report significant reductions on a set of benchmarks. In particular, we show that constrained bisimulation can boost decision-diagram-based quantum circuit simulation by several orders of magnitude, allowing thus for substantial synergy effects.

arXiv:2308.09510•ACM Transactions on Quantum Computing•Jan 18, 2025•6 citations

Constrained Quantum Optimization meets Model Reduction

Max Tschaikowski, Andrea Vandin

Quantum optimization algorithms promise advantages for difficult problems but are costly to simulate and analyze on classical machines. Recently, constrained quantum optimization has been investigated through the lens of Quantum Zeno dynamics, an approach which constrains the search to a subspace by means of quantum measurements. Exploiting that quantum measurements are projections, we propose a model reduction approach and show that simulations can be conducted in a lower-dimensional space. As possible applications, we demonstrate exponential state-space reduction of constrained quantum optimization in case of random 3-SAT and agent coordination problems over graphs.

quant-pharXiv:2604.23317•Lecture notes in computer science•Apr 28, 2026•0 citations

QUANTUM REDUCTION OF CONSTRAINED SYSTEMS

WORLD SCIENTIFIC eBooks•Jun 23, 2013•0 citations

On quantum theory of constrained systems

V. Pažma

Czechoslovak Journal of Physics•Jul 1, 1982•0 citations

Asymptotic Compression of Interactive Quantum Communication using Type-Constrained de Finetti Reduction

Louis Desruisseaux, Simon Ducharme, Gurleen Padda +1 more

For many information processing tasks, de Finetti-style theorems can often simplify the analysis in worst-case input scenarios for which the task exhibits some permutation-invariance symmetry, as they can allow for a reduction from an analysis on worst-case inputs to that of i.i.d. inputs. If further information is available on the inputs, it might be advantageous to reflect this information in the de Finetti reduction. In our work, we focus on a form of such constraint, based on the type of the input. This allows us to obtain a conceptually simple proof of a new de Finetti reduction for classical probability distributions, derived from elementary properties from the method of types. We apply our constrained de Finetti reduction to the compression of quantum interactive communication protocols with classical inputs, and prove that the prior-free quantum information cost equals the worst-case input amortized quantum communication cost.

quant-pharXiv:2606.24746•Jun 24, 2026•0 citations

“Formal” Versus “Empirical” Approaches to Quantum–Classical Reduction

Joshua Rosaler

arXiv:1511.06376•Topoi•Aug 31, 2015•11 citations
Efficient methods for the simulation of quantum circuits on classical computers are crucial for their analysis due to the exponential growth of the problem size with the number of qubits. Here we study lumping methods based on bisimulation, an established class of techniques that has been proven successful for (classic) stochastic and deterministic systems such as Markov chains and ordinary differential equations. Forward constrained bisimulation yields a lower-dimensional model which exactly preserves quantum measurements projected on a linear subspace of interest. Backward constrained bisimulation gives a reduction that is valid on a subspace containing the circuit input, from which the circuit result can be fully recovered. We provide an algorithm to compute the constraint bisimulations yielding coarsest reductions in both cases, using a duality result relating the two notions. As applications, we provide theoretical bounds on the size of the reduced state space for well-known quantum algorithms for search, optimization, and factorization. Using a prototype implementation, we report significant reductions on a set of benchmarks. In particular, we show that constrained bisimulation can boost decision-diagram-based quantum circuit simulation by several orders of magnitude, allowing thus for substantial synergy effects.
Quantum optimization algorithms promise advantages for difficult problems but are costly to simulate and analyze on classical machines. Recently, constrained quantum optimization has been investigated through the lens of Quantum Zeno dynamics, an approach which constrains the search to a subspace by means of quantum measurements. Exploiting that quantum measurements are projections, we propose a model reduction approach and show that simulations can be conducted in a lower-dimensional space. As possible applications, we demonstrate exponential state-space reduction of constrained quantum optimization in case of random 3-SAT and agent coordination problems over graphs.
For many information processing tasks, de Finetti-style theorems can often simplify the analysis in worst-case input scenarios for which the task exhibits some permutation-invariance symmetry, as they can allow for a reduction from an analysis on worst-case inputs to that of i.i.d. inputs. If further information is available on the inputs, it might be advantageous to reflect this information in the de Finetti reduction. In our work, we focus on a form of such constraint, based on the type of the input. This allows us to obtain a conceptually simple proof of a new de Finetti reduction for classical probability distributions, derived from elementary properties from the method of types. We apply our constrained de Finetti reduction to the compression of quantum interactive communication protocols with classical inputs, and prove that the prior-free quantum information cost equals the worst-case input amortized quantum communication cost.