Always private
DuckDuckGo never tracks your searches.
Learn More
You can hide this reminder in Search Settings
All regions
Argentina
Australia
Austria
Belgium (fr)
Belgium (nl)
Brazil
Bulgaria
Canada (en)
Canada (fr)
Catalonia
Chile
China
Colombia
Croatia
Czech Republic
Denmark
Estonia
Finland
France
Germany
Greece
Hong Kong
Hungary
Iceland
India (en)
Indonesia (en)
Ireland
Israel (en)
Italy
Japan
Korea
Latvia
Lithuania
Malaysia (en)
Mexico
Netherlands
New Zealand
Norway
Pakistan (en)
Peru
Philippines (en)
Poland
Portugal
Romania
Russia
Saudi Arabia
Singapore
Slovakia
Slovenia
South Africa
Spain (ca)
Spain (es)
Sweden
Switzerland (de)
Switzerland (fr)
Taiwan
Thailand (en)
Turkey
Ukraine
United Kingdom
US (English)
US (Spanish)
Vietnam (en)
Safe search: moderate
Strict
Moderate
Off
Any time
Any time
Past day
Past week
Past month
Past year
  1. link.aps.org

    We consider a model of quantum computation in which the set of elementary operations is limited to Clifford unitaries, the creation of the state $\\ensuremath{\\mid}0 $, and qubit measurement in the computational basis. In addition, we allow the creation of a one-qubit ancilla in a mixed state $\\ensuremath{\\rho}$, which should be regarded as a parameter of the model. Our goal is to determine ...
    Author:Sergey Bravyi, Alexei KitaevPublished:2005
  2. Was this helpful?
  3. researchgate.net

    Then, given the ability to perform all of the Clifford gates and inject noisy ancilla states, we can use magic state distillation to perform universal quantum computation [36]. ...
  4. semanticscholar.org

    We consider a model of quantum computation in which the set of elementary operations is limited to Clifford unitaries, the creation of the state |0>, and qubit measurement in the computational basis. In addition, we allow the creation of a one-qubit ancilla in a mixed state rho, which should be regarded as a parameter of the model. Our goal is to determine for which rho universal quantum ...
  5. researchgate.net

    Finally, methods for implementing faulttolerant Clifford gates [56] and magic-state distillation [57, 58] within these code families should be ascertained for realising universal quantum ...
  6. We consider a model of quantum computation in which the set of elementary operations is limited to Clifford unitaries, the creation of the state $|0\\rangle$ computational basis. In addition, we allow the creation of a one-qubit ancilla in a mixed state $ρ$, which should be regarded as a parameter of the model. Our goal is to determine for which $ρ$ universal quantum computation (UQC) can be ...
  7. semanticscholar.org

    A new family of models for measurement-based quantum computation which are deterministic and approximately universal, and capable of producing all Clifford gates and all diagonal gates in the n-th level of the Clifford hierarchy is introduced.
  8. studylib.net

    PHYSICAL REVIEW A 71, 022316 共2005兲 Universal quantum computation with ideal Clifford gates and noisy ancillas Sergey Bravyi* and Alexei Kitaev† Institute for Quantum Information, California Institute of Technology, Pasadena, 91125 California, USA 共Received 6 May 2004; published 22 February 2005兲 We consider a model of quantum computation in which the set of elementary operations is ...
  9. quantumcomputing.stackexchange.com

    In the paper Universal quantum computation with ideal Clifford gates and noisy ancillas, it is claimed that a circuit composed by Clifford gates, plus a so-called "magic state", can perform any quantum computation. This paper is based on the formalism developed for fault tolerance.

    Can’t find what you’re looking for?

    Help us improve DuckDuckGo searches with your feedback

Custom date rangeX