Zobrazeno 1 - 10
of 330
pro vyhledávání: '"Maslov, Dmitri"'
Establishing an advantage for (white-box) computations by a quantum computer against its classical counterpart is currently a key goal for the quantum computation community. A quantum advantage is achieved once a certain computational capability of a
Externí odkaz:
http://arxiv.org/abs/2402.03211
Autor:
Bravyi, Sergey, Cross, Andrew W., Gambetta, Jay M., Maslov, Dmitri, Rall, Patrick, Yoder, Theodore J.
Publikováno v:
Nature 627, 778-782 (2024)
Quantum error correction becomes a practical possibility only if the physical error rate is below a threshold value that depends on a particular quantum code, syndrome measurement circuit, and decoding algorithm. Here we present an end-to-end quantum
Externí odkaz:
http://arxiv.org/abs/2308.07915
Autor:
Berg, Ewout van den, Bravyi, Sergey, Gambetta, Jay M., Jurcevic, Petar, Maslov, Dmitri, Temme, Kristan
Publikováno v:
Phys. Rev. Research 5, 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:
http://arxiv.org/abs/2212.03937
Autor:
Maslov, Dmitri, Yang, Willers
Publikováno v:
npj Quantum Information 9, 96 (2023)
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 specified
Externí odkaz:
http://arxiv.org/abs/2210.16195
Publikováno v:
Phys. Rev. Lett. 129, 230501 (2022)
We consider quantum circuits composed of single-qubit operations and global entangling gates generated by Ising-type Hamiltonians. It is shown that such circuits can implement a large class of unitary operators commonly used in quantum algorithms at
Externí odkaz:
http://arxiv.org/abs/2207.08691
Autor:
Maslov, Dmitri, Zindorf, Ben
Publikováno v:
IEEE Transactions on Quantum Engineering 3, 1-8 (2022)
We seek to develop better upper bound guarantees on the depth of quantum CZ gate, CNOT gate, and Clifford circuits than those reported previously. We focus on the number of qubits $n\,{\leq}\,$1,345,000 [1], which represents the most practical use ca
Externí odkaz:
http://arxiv.org/abs/2201.05215
Publikováno v:
Quantum 5, 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:
http://arxiv.org/abs/2105.02291
Publikováno v:
npj Quantum Information 8(1), 1-12 (2022)
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 quantum ent
Externí odkaz:
http://arxiv.org/abs/2012.06074
Publikováno v:
Nature Physics 17, 894-897 (2021)
Quantum computations promise the ability to solve problems intractable in the classical setting. Restricting the types of computations considered often allows to establish a provable theoretical advantage by quantum computations, and later demonstrat
Externí odkaz:
http://arxiv.org/abs/2008.06478
Publikováno v:
IEEE Transactions on Computers 71(5), 1170-1180 (2022)
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:
http://arxiv.org/abs/2007.05469