Zobrazeno 1 - 10
of 188
pro vyhledávání: '"Kliuchnikov SO"'
We present new optimal and heuristic algorithms for exact synthesis of multi-qubit unitaries and isometries. For example, our algorithms find Clifford and T circuits for unitaries with entries in $\mathbb{Z}[i,1/\sqrt{2}]$. The optimal algorithms are
Externí odkaz:
http://arxiv.org/abs/2405.19302
We give a simple description of rectangular matrices that can be implemented by a post-selected stabilizer circuit. Given a matrix with entries in dyadic cyclotomic number fields $\mathbb{Q}(\exp(i\frac{2\pi}{2^m}))$, we show that it can be implement
Externí odkaz:
http://arxiv.org/abs/2404.17677
Autor:
Kliuchnikov, Vadym, Schoute, Eddie
Non-Clifford gates are frequently exclusively implemented on fault-tolerant architectures by first distilling magic states in specialised magic-state factories. In the rest of the architecture, the computational space, magic states can then be consum
Externí odkaz:
http://arxiv.org/abs/2403.18900
Stabilizer channels are stabilizer circuits that implement logical operations while mapping from an input stabilizer code to an output stabilizer code. They are widely used to implement fault tolerant error correction and logical operations in stabil
Externí odkaz:
http://arxiv.org/abs/2401.12017
The ubiquity of stabilizer circuits in the design and operation of quantum computers makes techniques to verify their correctness essential. The simulation of stabilizer circuits, which aims to replicate their behavior using a classical computer, is
Externí odkaz:
http://arxiv.org/abs/2309.08676
Autor:
Beverland, Michael E., Murali, Prakash, Troyer, Matthias, Svore, Krysta M., Hoefler, Torsten, Kliuchnikov, Vadym, Low, Guang Hao, Soeken, Mathias, Sundaram, Aarthi, Vaschillo, Alexander
While quantum computers promise to solve some scientifically and commercially valuable problems thought intractable for classical machines, delivering on this promise will require a large-scale quantum machine. Understanding the impact of architectur
Externí odkaz:
http://arxiv.org/abs/2211.07629
We describe a space-time optimized circuit for the table lookup subroutine from lattice-surgery surface code primitives respecting 2D grid connectivity. Table lookup circuits are ubiquitous in quantum computing, allowing the presented circuit to be u
Externí odkaz:
http://arxiv.org/abs/2211.01133
We present a language extension for parallel quantum programming to (1) remove ambiguities concerning parallelism in current quantum programming languages and (2) facilitate space-time tradeoff investigations in quantum computing. While the focus of
Externí odkaz:
http://arxiv.org/abs/2210.03680
Publikováno v:
Quantum 7, 1208 (2023)
We give a novel procedure for approximating general single-qubit unitaries from a finite universal gate set by reducing the problem to a novel magnitude approximation problem, achieving an immediate improvement in sequence length by a factor of 7/9.
Externí odkaz:
http://arxiv.org/abs/2203.10064
Autor:
Kliuchnikov, Vadym
We show that the number of T-depth one unitaries on $n$ qubits is $ \sum_{m=1}^{n}\tfrac{1}{m!}\prod_{k=0}^{m-1}(4^n/2^k - 2^k) \times \# \mathcal{C}_n, $ where $\#\mathcal{C}_n$ is the size of the $n$-qubit Clifford group, that is the number of unit
Externí odkaz:
http://arxiv.org/abs/2202.04163