Zobrazeno 1 - 10
of 65
pro vyhledávání: '"Dmitri Maslov"'
Autor:
Dmitri Maslov, Willers Yang
Publikováno v:
npj Quantum Information, Vol 9, Iss 1, Pp 1-9 (2023)
Abstract A Hadamard-free Clifford transformation is a circuit composed of quantum Phase (P), CZ, and CNOT gates. It is known that such a circuit can be written as a three-stage computation, -P-CZ-CNOT-, where each stage consists only of gates of the
Externí odkaz:
https://doaj.org/article/213423752f75487483397d30d34bf1c5
Publikováno v:
npj Quantum Information, Vol 8, Iss 1, Pp 1-12 (2022)
Abstract Clifford group lies at the core of quantum computation—it underlies quantum error correction, its elements can be used to perform magic state distillation and they form randomized benchmarking protocols, Clifford group is used to study qua
Externí odkaz:
https://doaj.org/article/730a9b93eab445dd9282c75a00c82c16
Autor:
Ewout van den Berg, Sergey Bravyi, Jay M. Gambetta, Petar Jurcevic, Dmitri Maslov, Kristan Temme
Publikováno v:
Physical Review Research, Vol 5, Iss 3, p 033193 (2023)
Generating samples from the output distribution of a quantum circuit is a ubiquitous task used as a building block of many quantum algorithms. Here we show how to accomplish this task on a noisy quantum processor lacking full-blown error correction f
Externí odkaz:
https://doaj.org/article/8485be8fe5e44aac8507d96c2c968734
Autor:
Dmitri Maslov, Ben Zindorf
Publikováno v:
IEEE Transactions on Quantum Engineering, Vol 3, Pp 1-8 (2022)
We seek to develop better upper bound guarantees on the depth of quantum $\text {CZ}$ gate, cnot gate, and Clifford circuits than those reported previously. We focus on the number of qubits $n\,{\leq }\,$1 345 000 (de Brugière et al., 2021), which r
Externí odkaz:
https://doaj.org/article/d714fff174434b3b87e350cb22f20e9b
Publikováno v:
npj Quantum Information, Vol 4, Iss 1, Pp 1-12 (2018)
Quantum computation: optimizing quantum circuits A new software tool significantly reduces the size of arbitrary quantum circuits, automatically optimizing the number of gates required for running algorithms. Yunseong Nam and colleagues from the Univ
Externí odkaz:
https://doaj.org/article/db98af5e361345b4b60bf97577dc99cb
Publikováno v:
Quantum, Vol 5, p 580 (2021)
The Clifford group is a finite subgroup of the unitary group generated by the Hadamard, the CNOT, and the Phase gates. This group plays a prominent role in quantum error correction, randomized benchmarking protocols, and the study of entanglement. He
Externí odkaz:
https://doaj.org/article/7d0859525d074bea9cde649fb06421fc
Autor:
Yuri Alexeev, Dave Bacon, Kenneth R. Brown, Robert Calderbank, Lincoln D. Carr, Frederic T. Chong, Brian DeMarco, Dirk Englund, Edward Farhi, Bill Fefferman, Alexey V. Gorshkov, Andrew Houck, Jungsang Kim, Shelby Kimmel, Michael Lange, Seth Lloyd, Mikhail D. Lukin, Dmitri Maslov, Peter Maunz, Christopher Monroe, John Preskill, Martin Roetteler, Martin J. Savage, Jeff Thompson
Publikováno v:
PRX Quantum, Vol 2, Iss 1, p 017001 (2021)
The great promise of quantum computers comes with the dual challenges of building them and finding their useful applications. We argue that these two challenges should be considered together, by codesigning full-stack quantum computer systems along w
Externí odkaz:
https://doaj.org/article/371e02b88ec147458098d4647a32d784
Autor:
Dmitri Maslov, Yunseong Nam
Publikováno v:
New Journal of Physics, Vol 20, Iss 3, p 033018 (2018)
In this paper we study the ways to use a global entangling operator to efficiently implement circuitry common to a selection of important quantum algorithms. In particular, we focus on the circuits composed with global Ising entangling gates and arbi
Externí odkaz:
https://doaj.org/article/dc30743a3aa14c0b9e766efd43e2a46b
Autor:
Dmitri Maslov
Publikováno v:
New Journal of Physics, Vol 19, Iss 2, p 023035 (2017)
We study the problem of compilation of quantum algorithms into optimized physical-level circuits executable in a quantum information processing (QIP) experiment based on trapped atomic ions. We report a complete strategy: starting with an algorithm i
Externí odkaz:
https://doaj.org/article/fc0b0ad824694434824c1fb7b1025bbb
Publikováno v:
IEEE Transactions on Computers. 71:1170-1180
The Hidden Weighted Bit function plays an important role in the study of classical models of computation. A common belief is that this function is exponentially hard for the implementation by reversible ancilla-free circuits, even though introducing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1dda6deec30cbf419f49e85fbd279890
https://doi.org/10.1109/tc.2021.3076435
https://doi.org/10.1109/tc.2021.3076435