#### Filter Results:

- Full text PDF available (12)

#### Publication Year

1990

2016

- This year (0)
- Last 5 years (11)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca
- Quantum Information & Computation
- 2013

In this paper, we show the equivalence of the set of unitaries computable by the circuits over the Clifford and T library and the set of unitaries over the ring Z[ 1 âˆš 2 , i], in the single-qubitâ€¦ (More)

- Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca
- Physical review letters
- 2013

Decomposing unitaries into a sequence of elementary operations is at the core of quantum computing. Information theoretic arguments show that approximating a random unitary with precision Îµ requiresâ€¦ (More)

- Vadym Kliuchnikov
- ArXiv
- 2013

Implementing a unitary operation using a universal gate set is a fundamental problem in quantum computing. The problem naturally arises when we want to implement some quantum algorithm on a faultâ€¦ (More)

- Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca
- IEEE Transactions on Computers
- 2016

We present an algorithm, along with its implementation that finds T-optimal approximations of single-qubit Z-rotations using quantum circuits consisting of Clifford and T gates. Our algorithm isâ€¦ (More)

- Vadym Kliuchnikov, Alex Bocharov, Krysta Marie Svore
- Physical review letters
- 2014

We address the problem of compiling quantum operations into braid representations for non-Abelian quasiparticles described by the Fibonacci anyon model. We classify the single-qubit unitaries thatâ€¦ (More)

- Simon Forest, David Gosset, Vadym Kliuchnikov, David McKinnon
- 2015

We generalize an efficient exact synthesis algorithm for single-qubit unitaries over the Clifford+T gate set which was presented by Kliuchnikov, Maslov and Mosca. Their algorithm takes as input anâ€¦ (More)

- Vadym Kliuchnikov, Dmitri Maslov
- ArXiv
- 2013

We study optimal synthesis of Clifford circuits, and apply the results to peep-hole optimization of quantum circuits. We report optimal circuits for all Clifford operations with up to four inputs. Weâ€¦ (More)

- Vadym Kliuchnikov, Jon Yard
- ArXiv
- 2015

Exact synthesis is a tool used in algorithms for approximating an arbitrary qubit unitary with a sequence of quantum gates from some finite set. These approximation algorithms find asymptoticallyâ€¦ (More)

The efficiency of compiling high-level quantum algorithms into instruction sets native to quantum computers defines the moment in the future when we will be able to solve interesting and importantâ€¦ (More)

- A. V. Korolev, G. G. Avtandilov, Vadym Kliuchnikov, A V Gubchenko, A V Chernookov, M. I. Perel'man
- Grudnaia i serdechno-sosudistaia khirurgiia
- 1990