5 papers · 1 filter
Minimality of the Pure Qubit ZX Calculus
Harry K. Stoltz, Renaud Vilmart
The ZX calculus is a graphical language for reasoning about quantum processes. In this paper, we develop a minimal pure-qubit ZX calculus based on the work of Vilmart [arXiv:1812.0…
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…
The decohered ZX-calculus
Titouan Carette, Daniela Cojocaru, Renaud Vilmart
The discard ZX-calculus is known to be complete and universal for mixed-state quantum mechanics, allowing for both quantum and classical processes. However, if the quantum aspects…
Minimality in Finite-Dimensional ZW-Calculi
Marc de Visme, Renaud Vilmart
The ZW-calculus is a graphical language capable of representing 2-dimensional quantum systems (qubit) through its diagrams, and manipulating them through its equational theory. We…
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…