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

    Jun 17, 2024G. Wang, S. Sim, and P. D. Johnson, State preparation boosters for early fault-tolerant quantum computation, Quantum 6, 829 (2022). Z. Ding and L. Lin, , Even shorter quantum circuit for phase estimation on early fault-tolerant quantum computers with applications to ground-state energy estimation, ArXiv:2211.11973.
  2. Was this helpful?
  3. Nov 24, 2023Over the past decade, research in quantum computing has tended to fall into one of two camps: near-term intermediate scale quantum (NISQ) and fault-tolerant quantum computing (FTQC). Yet, a growing body of work has been investigating how to use quantum computers in transition between these two eras. This envisions operating with tens of thousands to millions of physical qubits, able to support ...
  4. journals.aps.org

    As a concrete example, we show that, for the canonical task of phase estimation, in a regime of moderate scalability and using just over one million physical qubits, the "reach'' of the quantum computer can be extended (compared to the standard approach) from 90-qubit instances to over 130-qubit instances using a simple early fault-tolerant ...
  5. pasquans2.eu

    While small-scale quantum computers are today a reality, the scalable, fault tolerant quantum computer we are dreaming of is still far in the future. But there is significant new physics and relevant applications which we can actually "do" in the coming years with intermediate-scale quantum devices already existing in our labs today.
  6. quantum-journal.org

    Nov 20, 2024[2] Amara Katabarwa, Katerina Gratsea, Athena Caesura, and Peter D. Johnson, "Early Fault-Tolerant Quantum Computing", PRX Quantum 5 2, 020101 (2024). [3] Yutaro Akahoshi, Kazunori Maruyama, Hirotaka Oshima, Shintaro Sato, and Keisuke Fujii, "Partially Fault-Tolerant Quantum Computing Architecture with Error-Corrected Clifford Gates and Space ...
  7. ui.adsabs.harvard.edu

    Over the past decade, research in quantum computing has tended to fall into one of two camps: near-term intermediate scale quantum (NISQ) and fault-tolerant quantum computing (FTQC). Yet, a growing body of work has been investigating how to use quantum computers in transition between these two eras. This envisions operating with tens of thousands to millions of physical qubits, able to support ...
  8. link.aps.org

    May 26, 2023Phase estimation is one of the most important quantum primitives. This paper focuses on designing phase-estimation algorithms that are suitable for early fault-tolerant quantum computers. Compared with full fault-tolerant computers, early fault-tolerant quantum computers have a limited number of logical qubits and limited circuit depths. Thus ...
  9. The project. Launched in April 2023, PASQuanS2 sets out to transform the development of programmable quantum simulation in Europe over the next seven years.Following a two-stage approach, one of the major objectives of this first project phase PASQuanS2.1 (running for the next 3.5 years), is the development of quantum simulators with at least 2,000 atoms and a path towards 10,000 while ...
  10. to over 130-qubit instances using a simple early fault-tolerant quantum algorithm, which reduces the number of operations per circuit by a factor of 100 and increases the number of circuit repe-titions by a factor of 10,000. This clarifies the role that such algorithms might play in the era of

    Can’t find what you’re looking for?

    Help us improve DuckDuckGo searches with your feedback

Custom date rangeX