60 citations
- Université Paris-SaclayFR43 papers
- Centre National de la Recherche ScientifiqueFR36 papers
- CentraleSupélecFR17 papers
- Institut national de recherche en sciences et technologies du numériqueFR14 papers
- École Normale Supérieure - PSLFR11 papers
- École Normale Supérieure Paris-SaclayFR8 papers
- Laboratoire de Biologie et Pharmacologie AppliquéeFR8 papers
- Laboratoire Lorrain de Recherche en Informatique et ses ApplicationsFR8 papers
- Centre Inria de SaclayFR6 papers
- Institut Universitaire de FranceFR6 papers
- Université de LorraineFR6 papers
- Aix-Marseille UniversitéFR5 papers
22 papers · 1 filter
A dataflow programming framework for linear optical distributed quantum computing
Giovanni de Felice, Boldizsár Poór, Cole Comfort +4
Photonic systems offer a promising platform for interconnecting quantum processors and enabling scalable, networked architectures. Designing and verifying such architectures requir…
Quantum Circuit Equivalence Checking: A Tractable Bridge From Unitary to Hybrid Circuits
Jérome Ricciardi, Sébastien Bardin, Christophe Chareton +1
Equivalence checking of hybrid quantum circuits is of primary importance, given that quantum circuit transformations are omnipresent along the quantum compiler chain. While some ap…
Decoherence to quantum theory from a causally-indefinite post-quantum theory
James Hefford, Matt Wilson
We find a process satisfying the axioms of hyper-decoherence which produces standard quantum theory from the theory of quantum boxes (higher-order quantum theory with the non-signa…
Resource-Efficient Synthesis of Sparse Quantum States
Renaud Vilmart, Sunheang Ty, Chetra Mang
Preparing a quantum circuit that implements a given sparse state is an important building block that is necessary for many different quantum algorithms. In the context of fault-tol…
Double-Logarithmic Depth Block-Encodings of Simple Finite Difference Method's Matrices
Sunheang Ty, Renaud Vilmart, Axel TahmasebiMoradi +1
Solving differential equations is one of the most computationally expensive problems in classical computing, occupying the vast majority of high-performance computing resources dev…
A typology of quantum algorithms
Pablo Arnault, Pablo Arrighi, Steven Herbert +2
We draw the current landscape of quantum algorithms, by classifying about 130 quantum algorithms, according to the fundamental mathematical problems they solve, their real-world ap…