output
20172025
most citedReducing the Depth of Linear Reversible Quantum Circuits

35 citations

18 papers

cs.HC2025

Conch: Competitive Debate Analysis via Visualizing Clash Points and Hierarchical Strategies

Qianhe Chen, Yong Wang, Yixin Yu +3

In-depth analysis of competitive debates is essential for participants to develop argumentative skills and refine strategies, and further improve their debating performance. Howeve…

quant-ph2023★ 3 cited

Small k-pairable states

Nathan Claudet, Mehdi Mhalla, Simon Perdrix

A -pairable -qubit state is a resource state that allows Local Operations and Classical Communication (LOCC) protocols to generate EPR-pairs among any -disjoint pairs of t…

cs.CC2023

Hardness of monadic second-order formulae over succinct graphs

Guilhem Gamard, Aliénor Goubault-Larrecq, Pierre Guillon +3

Our main result is a succinct counterpoint to Courcelle's meta-theorem as follows: every cw-nontrivial monadic second-order (MSO) property is either NP-hard or coNP-hard over graph…

cs.LO2022

A programming language characterizing quantum polynomial time

Emmanuel Hainry, Romain Péchoux, Mário Silva

We introduce a first-order quantum programming language, named FOQ, whose terminating programs are reversible. We restrict FOQ to a strict and tractable subset, named PFOQ, of term…

quant-ph2022★ 35 cited

Reducing the Depth of Linear Reversible Quantum Circuits

Timothée Goubault de Brugière, Marc Baboulin, Benoît Valiron +2

In quantum computing the decoherence time of the qubits determines the computation time available and this time is very limited when using current hardware. In this paper we minimi…

nlin.AO2022★ 6 cited

Delayed Dynamics with Transient Resonating Oscillations

Kenta Ohira, Toru Ohira

Recently, we have studied a delay differential equation which has a coefficient that is a linear function of time. The equation has shown the oscillatory transient dynamics appear…