Zobrazeno 1 - 10
of 2 530
pro vyhledávání: '"A. Perdrix"'
Autor:
Claudet, Nathan, Perdrix, Simon
Stabilizer states form a ubiquitous family of quantum states that can be graphically represented through the graph state formalism. A fundamental property of graph states is that applying a local complementation - a well-known and extensively studied
Externí odkaz:
http://arxiv.org/abs/2409.20183
We present an efficient algorithm to reduce the number of non-Clifford gates in quantum circuits and the number of parametrized rotations in parametrized quantum circuits. The method consists in finding rotations that can be merged into a single rota
Externí odkaz:
http://arxiv.org/abs/2407.07846
Autor:
Claudet, Nathan, Perdrix, Simon
Local sets, a graph structure invariant under local complementation, have been originally introduced in the context of quantum computing for the study of quantum entanglement within the so-called graph state formalism. A local set in a graph is made
Externí odkaz:
http://arxiv.org/abs/2402.10678
Autor:
Cautrès, Maxime, Claudet, Nathan, Mhalla, Mehdi, Perdrix, Simon, Savin, Valentin, Thomassé, Stéphan
Publikováno v:
ICALP 2024
We study the notion of $k$-stabilizer universal quantum state, that is, an $n$-qubit quantum state, such that it is possible to induce any stabilizer state on any $k$ qubits, by using only local operations and classical communications. These states g
Externí odkaz:
http://arxiv.org/abs/2402.06260
In this paper, we study quantitative properties of quantum programs. Properties of interest include (positive) almost-sure termination, expected runtime or expected cost, that is, for example, the expected number of applications of a given quantum ga
Externí odkaz:
http://arxiv.org/abs/2312.13657
We introduce the first minimal and complete equational theory for quantum circuits. Hence, we show that any true equation on quantum circuits can be derived from simple rules, all of them being standard except a novel but intuitive one which states t
Externí odkaz:
http://arxiv.org/abs/2311.07476
A $k$-pairable $n$-qubit state is a resource state that allows Local Operations and Classical Communication (LOCC) protocols to generate EPR-pairs among any $k$-disjoint pairs of the $n$ qubits. Bravyi et al. introduced a family of $k$-pairable $n$-q
Externí odkaz:
http://arxiv.org/abs/2309.09956
Although quantum circuits have been ubiquitous for decades in quantum computing, the first complete equational theory for quantum circuits has only recently been introduced. Completeness guarantees that any true equation on quantum circuits can be de
Externí odkaz:
http://arxiv.org/abs/2303.03117
The Clifford$+T$ gate set is commonly used to perform universal quantum computation. In such setup the $T$ gate is typically much more expensive to implement in a fault-tolerant way than Clifford gates. To improve the feasibility of fault-tolerant qu
Externí odkaz:
http://arxiv.org/abs/2302.07040
We introduce a new characterisation of determinism in Measurement-Based Quantum Computing. MBQC consists in performing local measurements over a large entangled state represented by a graph. The ability to perform an overall deterministic computation
Externí odkaz:
http://arxiv.org/abs/2207.09368