Sycamore processor

Last updated

The Sycamore processor Google Sycamore Chip 002.png
The Sycamore processor

Sycamore is a transmon superconducting quantum processor created by Google's Artificial Intelligence division. [1] It has 53 qubits. [2]

In 2019, Sycamore completed a task in 200 seconds that Google claimed, in a Nature paper, would take a state-of-the-art supercomputer 10,000 years to finish. Thus, Google claimed to have achieved quantum supremacy. To estimate the time that would be taken by a classical supercomputer, Google ran portions of the quantum circuit simulation on the Summit, one of the most powerful classical computers in the world. [3] [4] [5] [6] [7] [8] Later, IBM made a counter-argument, claiming that the task would only take 2.5 days on a classical system like Summit. [9] [10] If Google's claims are upheld, then it would represent an exponential leap in computing power. [11] [12] [13]

In August 2020, quantum engineers working for Google reported the largest chemical simulation on a quantum computer – a Hartree–Fock approximation with Sycamore paired with a classical computer that analyzed results to provide new parameters for the 12-qubit system. [14] [15] [16]

In April 2021, researchers working with Sycamore reported that they were able to realize the ground state of the toric code, a topologically ordered state, with 31 qubits. They showed long-range entanglement properties of the state by measuring non-zero topological entropy, simulating anyon interferometry and their braiding statistics, and preparing a topological quantum error correcting code with one logical qubit. [17]

In July 2021, a collaboration consisting of Google and multiple universities reported the observation of a discrete time crystal on the Sycamore processor. The chip of 20 qubits was used to obtain a many-body localization configuration of up and down spins. The configuration was stimulated with a laser to achieve a periodically driven "Floquet" system where all up spins are flipped for down and vice versa in periodic cycles which are multiples of the laser's cycles. No energy was absorbed from the laser so the system remained in a protected eigenstate order. [18] [19]

In 2022, the Sycamore processor was used to simulate traversable wormhole dynamics. [20]

See also

Related Research Articles

<span class="mw-page-title-main">Quantum computing</span> Technology that uses quantum mechanics

A quantum computer is a computer that takes advantage of quantum mechanical phenomena.

This is a timeline of quantum computing.

Quantum error correction (QEC) is used in quantum computing to protect quantum information from errors due to decoherence and other quantum noise. Quantum error correction is theorised as essential to achieve fault tolerant quantum computing that can reduce the effects of noise on stored quantum information, faulty quantum gates, faulty quantum preparation, and faulty measurements. This would allow algorithms of greater circuit depth.

Superconducting quantum computing is a branch of solid state quantum computing that implements superconducting electronic circuits using superconducting qubits as artificial atoms, or quantum dots. For superconducting qubits, the two logic states are the ground state and the excited state, denoted respectively. Research in superconducting quantum computing is conducted by companies such as Google, IBM, IMEC, BBN Technologies, Rigetti, and Intel. Many recently developed QPUs use superconducting architecture.

In physics, quantum acoustics is the study of sound under conditions such that quantum mechanical effects are relevant. For most applications, classical mechanics are sufficient to accurately describe the physics of sound. However very high frequency sounds, or sounds made at very low temperatures may be subject to quantum effects.

<span class="mw-page-title-main">Hartmut Neven</span> German scientist

Hartmut Neven is a scientist working in quantum computing, computer vision, robotics and computational neuroscience. He is best known for his work in face and object recognition and his contributions to quantum machine learning. He is currently Vice President of Engineering at Google where he is leading the Quantum Artificial Intelligence Lab which he founded in 2012.

<span class="mw-page-title-main">Quantum simulator</span> Simulators of quantum mechanical systems

Quantum simulators permit the study of a quantum system in a programmable fashion. In this instance, simulators are special purpose devices designed to provide insight about specific physics problems. Quantum simulators may be contrasted with generally programmable "digital" quantum computers, which would be capable of solving a wider class of quantum problems.

The Quantum Artificial Intelligence Lab is a joint initiative of NASA, Universities Space Research Association, and Google whose goal is to pioneer research on how quantum computing might help with machine learning and other difficult computer science problems. The lab is hosted at NASA's Ames Research Center.

In quantum computing, quantum supremacy or quantum advantage is the goal of demonstrating that a programmable quantum computer can solve a problem that no classical computer can solve in any feasible amount of time, irrespective of the usefulness of the problem. The term was coined by John Preskill in 2012, but the concept dates to Yuri Manin's 1980 and Richard Feynman's 1981 proposals of quantum computing.

John M. Martinis is an American physicist and a professor of physics at the University of California, Santa Barbara. In 2014, the Google Quantum A.I. Lab announced that it had hired Martinis and his team in a multimillion dollar deal to build a quantum computer using superconducting qubits.

<span class="mw-page-title-main">Quantum gate teleportation</span>

Quantum gate teleportation is a quantum circuit construction where a gate is applied to target qubits by first applying the gate to an entangled state and then teleporting the target qubits through that entangled state.

<span class="mw-page-title-main">Sergio Boixo</span> Spanish physicist

Sergio Boixo has degrees in computer engineering, philosophy, mathematics, and master and PhD in physics, and is best known for his work on quantum computing. He is currently working as Chief Scientist Quantum Computer Theory for Google's Quantum Artificial Intelligence Lab, a team he joined in 2013, shortly after its foundation.

Quantum engineering is the development of technology that capitalizes on the laws of quantum mechanics. Quantum engineering uses quantum mechanics as a toolbox for the development of quantum technologies, such as quantum sensors or quantum computers.

In quantum computing, the variational quantum eigensolver (VQE) is a quantum algorithm for quantum chemistry, quantum simulations and optimization problems. It is a hybrid algorithm that uses both classical computers and quantum computers to find the ground state of a given physical system. Given a guess or ansatz, the quantum processor calculates the expectation value of the system with respect to an observable, often the Hamiltonian, and a classical optimizer is used to improve the guess. The algorithm is based on the variational method of quantum mechanics.

Cross-entropy benchmarking is a quantum benchmarking protocol which can be used to demonstrate quantum supremacy. In XEB, a random quantum circuit is executed on a quantum computer multiple times in order to collect a set of samples in the form of bitstrings . The bitstrings are then used to calculate the cross-entropy benchmark fidelity via a classical computer, given by

This glossary of quantum computing is a list of definitions of terms and concepts used in quantum computing, its sub-disciplines, and related fields.

<span class="mw-page-title-main">Marissa Giustina</span> American physicist

Marissa Giustina is an American physicist who is a senior research scientist at the Quantum Artificial Intelligence Lab. Her research considers the development of quantum computing and experimental tests of quantum theory.

Quantum random circuits (QRC) is a concept of incorporating an element of randomness into the local unitary operations and measurements of a quantum circuit. The idea is similar to that of random matrix theory which is to use the QRC to obtain almost exact results of non-integrable, hard-to-solve problems by averaging over an ensemble of outcomes. This incorporation of randomness into the circuits has many possible advantages, some of which are (i) the validation of quantum computers, which is the method that Google used when they claimed quantum supremacy in 2019., and (ii) understanding the universal structure of non-equilibrium and thermalization processes in quantum many-body dynamics.

<span class="mw-page-title-main">Pedram Roushan</span> Iranian-american physicist

Pedram Roushan is an Iranian-American physicist working at Google AI on quantum computing and quantum simulation.

References

  1. ↑ Kan, Michael (23 October 2019). "Google Claims Quantum Computing Achievement, IBM Says Not So Fast". PCMAG.
  2. ↑ Cho, Adrian (2 August 2022). "Ordinary computers can beat Google's quantum computer after all". Science .
  3. ↑ "Summit" . Retrieved 2 April 2024.
  4. ↑ "Frontier remains world's most powerful supercomputer on Top500 list". 14 November 2023. Retrieved 2 April 2024.
  5. ↑ Arute, Frank; Arya, Kunal; Babbush, Ryan; Bacon, Dave; Bardin, Joseph C.; Barends, Rami; Biswas, Rupak; Boixo, Sergio; Brandao, Fernando G. S. L.; Buell, David A.; Burkett, Brian (October 2019). "Quantum supremacy using a programmable superconducting processor". Nature. 574 (7779): 505–510. arXiv: 1910.11333 . Bibcode:2019Natur.574..505A. doi: 10.1038/s41586-019-1666-5 . ISSN   1476-4687. PMID   31645734.
  6. ↑ Rincon, Paul (23 October 2019). "Google claims 'quantum supremacy' for computer". BBC News. Retrieved 23 October 2019.
  7. ↑ Gibney, Elizabeth (23 October 2019). "Hello quantum world! Google publishes landmark quantum supremacy claim". Nature. 574 (7779): 461–462. Bibcode:2019Natur.574..461G. doi: 10.1038/d41586-019-03213-z . PMID   31645740. S2CID   204836839.
  8. ↑ "Google Claims Breakthrough in Blazingly Fast Computing". Associated Press via The New York Times. 23 October 2019. Archived from the original on 3 November 2019. Retrieved 3 November 2019.
  9. ↑ "On "Quantum Supremacy"". IBM Research Blog. 22 October 2019. Archived from the original on 1 November 2019. Retrieved 28 October 2019.
  10. ↑ Whyte, Chelsea (5 October 2019). "What next for quantum computers?". New Scientist. 243 (3250): 15. doi:10.1016/S0262-4079(19)31852-4. S2CID   209993144.
  11. ↑ Shankland, Stephen (25 October 2019). "Quantum supremacy? Done. Now the hard work begins for mere quantum practicality". CNET.
  12. ↑ Savage, Neil (24 October 2019). "Hands-On with Google's Quantum Computer". Scientific American.
  13. ↑ Mack, Eric (24 October 2019). "No, Google and Its Quantum Computer Aren't Killing Bitcoin Anytime Soon". Inc.com.
  14. ↑ Yirka, Bob (28 August 2020). "Google conducts largest chemical simulation on a quantum computer to date". Phys.org. Retrieved 7 September 2020.
  15. ↑ Savage, Neil (24 October 2019). "Google's Quantum Computer Achieves Chemistry Milestone". Scientific American. Retrieved 7 September 2020.
  16. ↑ Arute, Frank; et al. (28 August 2020). "Hartree–Fock on a superconducting qubit quantum computer". Science. 369 (6507): 1084–1089. arXiv: 2004.04174 . Bibcode:2020Sci...369.1084.. doi:10.1126/science.abb9811. ISSN   0036-8075. PMID   32855334. S2CID   215548188 . Retrieved 7 September 2020.
  17. ↑ Satzinger, K. J.; Liu, Y.; Smith, A.; Knapp, C.; Newman, M.; Jones, C.; Chen, Z.; Quintana, C.; Mi, X.; Dunsworth, A.; Gidney, C. (2 April 2021). "Realizing topologically ordered states on a quantum processor". Science. 374 (6572): 1237–1241. arXiv: 2104.01180 . Bibcode:2021Sci...374.1237S. doi:10.1126/science.abi8378. PMID   34855491. S2CID   233025160.
  18. ↑ Mi, Xiao; Ippoliti, Matteo; Quintana, Chris; Greene, Amy; Chen, Zijun; Gross, Jonathan; Arute, Frank; Arya, Kunal; Atalaya, Juan; Babbush, Ryan; Bardin, Joseph C. (2022). "Time-crystalline eigenstate order on a quantum processor". Nature. 601 (7894): 531–536. arXiv: 2107.13571 . Bibcode:2022Natur.601..531M. doi:10.1038/s41586-021-04257-w. PMC   8791837 . PMID   34847568.
  19. ↑ Wolchover, Natalie (30 July 2021). "Eternal Change for No Energy: A Time Crystal Finally Made Real". Quanta Magazine. Retrieved 30 July 2021.
  20. ↑ Jafferis, Daniel; Zlokapa, Alexander; Lykken, Joseph D.; Kolchmeyer, David K.; Davis, Samantha I.; Lauk, Nikolai; Neven, Hartmut; Spiropulu, Maria (2022). "Traversable wormhole dynamics on a quantum processor". Nature. 612 (7938): 51–55. Bibcode:2022Natur.612...51J. doi:10.1038/s41586-022-05424-3. PMID   36450904. S2CID   254099207.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.