Zobrazeno 1 - 10
of 37
pro vyhledávání: '"Brugière, Timothée"'
We devise greedy heuristics tailored for synthesizing quantum circuits that implement a specified set of Pauli rotations. Our heuristics are designed to minimize either the count of entangling gates or the depth of entangling gates, and they can be a
Externí odkaz:
http://arxiv.org/abs/2404.03280
We focus on the depth optimization of CNOT circuits on hardwares with limited connectivity. We adapt the algorithm from Kutin et al. that implements any $n$-qubit CNOT circuit in depth at most $5n$ on a Linear Nearest Neighbour (LNN) architecture. Ou
Externí odkaz:
http://arxiv.org/abs/2303.07302
We tackle the problem of Clifford isometry compilation, i.e, how to synthesize a Clifford isometry into an executable quantum circuit. We propose a simple framework for synthesis that only exploits the elementary properties of the Clifford group and
Externí odkaz:
http://arxiv.org/abs/2212.06928
Autor:
de Brugière, Timothée Goubault, Baboulin, Marc, Valiron, Benoît, Martiel, Simon, Allouche, Cyril
Publikováno v:
Science of Computer Programming, Volume 214, 1 February 2022, 102726
Current proposals for quantum compilers require the synthesis and optimization of linear reversible circuits and among them CNOT circuits. Since these circuits represent a significant part of the cost of running an entire quantum circuit, we aim at r
Externí odkaz:
http://arxiv.org/abs/2201.06457
Autor:
de Brugière, Timothée Goubault, Baboulin, Marc, Valiron, Benoît, Martiel, Simon, Allouche, Cyril
Publikováno v:
IEEE Transactions on Quantum Engineering, vol. 2, pp. 1-22, 2021, Art no. 3102422
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 minimize the execution time (the depth) for a class of circuits referred to
Externí odkaz:
http://arxiv.org/abs/2201.06380
Autor:
de Brugière, Timothée Goubault, Baboulin, Marc, Valiron, Benoît, Martiel, Simon, Allouche, Cyril
Publikováno v:
ACM Transactions on Quantum Computing, Volume 2, Issue 3, Article 11, pp 1-26, 2021
Linear reversible circuits represent a subclass of reversible circuits with many applications in quantum computing. These circuits can be efficiently simulated by classical computers and their size is polynomially bounded by the number of qubits, mak
Externí odkaz:
http://arxiv.org/abs/2201.06508
We present a framework for the synthesis of phase polynomials that addresses both cases of full connectivity and partial connectivity for NISQ architectures. In most cases, our algorithms generate circuits with lower CNOT count and CNOT depth than th
Externí odkaz:
http://arxiv.org/abs/2104.00934
Publikováno v:
Quantum 6, 729 (2022)
Qubit routing is a key problematic related to quantum circuit compilation. It consists in rewriting a quantum circuit by adding the least possible number of instructions to make the circuit compliant with some architecture's connectivity constraints.
Externí odkaz:
http://arxiv.org/abs/2012.09663
Publikováno v:
Proceedings of ICCS, LNCS 11537, pp. 3-16, 2019
We provide a simple framework for the synthesis of quantum circuits based on a numerical optimization algorithm. This algorithm is used in the context of the trapped-ions technology. We derive theoretical lower bounds for the number of quantum gates
Externí odkaz:
http://arxiv.org/abs/2004.07714
Publikováno v:
Computer Physics Communication 248:107001 (2020)
The synthesis of a quantum circuit consists in decomposing a unitary matrix into a series of elementary operations. In this paper, we propose a circuit synthesis method based on the QR factorization via Householder transformations. We provide a two-s
Externí odkaz:
http://arxiv.org/abs/2004.07710