Sycamore processor

Short description: 2019 quantum processor by Google

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, the most powerful classical computer in the world.[3][4][5][6] Later, IBM made a counter-argument, claiming that the task would only take 2.5 days on a classical system like Summit.[7][8] If Google's claims are upheld, then it would represent an exponential leap in computing power.[9][10][11][12]

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.[13][14][15]

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.[16]

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.[17][18]

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

## See also

* Jiuzhang
* Quantum random circuits

## References

1. ↑ Kan, Michael (23 October 2019). "Google Claims Quantum Computing Achievement, IBM Says Not So Fast". https://www.pcmag.com/news/371499/google-claims-quantum-computing-achievement-ibm-says-not-so.
2. ↑ Cho, Adrian (2 August 2022). "Ordinary computers can beat Google's quantum computer after all". https://www.science.org/content/article/ordinary-computers-can-beat-google-s-quantum-computer-after-all.
3. ↑ Arute, Frank; Arya, Kunal; Babbush, Ryan; Bacon, Dave; Bardin, Joseph C.; Barends, Rami; Biswas, Rupak; Boixo, Sergio et al. (October 2019). "Quantum supremacy using a programmable superconducting processor". Nature 574 (7779): 505–510. doi:10.1038/s41586-019-1666-5. ISSN 1476-4687. PMID 31645734. Bibcode: 2019Natur.574..505A.
4. ↑ Rincon, Paul (23 October 2019). "Google claims 'quantum supremacy' for computer". BBC News. https://www.bbc.co.uk/news/science-environment-50154993.
5. ↑ Gibney, Elizabeth (23 October 2019). "Hello quantum world! Google publishes landmark quantum supremacy claim". Nature 574 (7779): 461–462. doi:10.1038/d41586-019-03213-z. PMID 31645740. Bibcode: 2019Natur.574..461G.
6. ↑ "Google Claims Breakthrough in Blazingly Fast Computing" (in en-US). Associated Press via The New York Times. 23 October 2019. https://www.nytimes.com/aponline/2019/10/23/us/bc-us-google-quantum-computing.html.
7. ↑ "On "Quantum Supremacy"". 22 October 2019. https://www.ibm.com/blogs/research/2019/10/on-quantum-supremacy/.
8. ↑ Whyte, Chelsea (5 October 2019). "What next for quantum computers?". New Scientist 243 (3250): 15. doi:10.1016/S0262-4079(19)31852-4.
9. ↑ Shankland, Stephen (25 October 2019). "Quantum supremacy? Done. Now the hard work begins for mere quantum practicality". CNET. https://www.cnet.com/news/google-quantum-supremacy-only-first-taste-of-computing-revolution/.
10. ↑ Savage, Neil (24 October 2019). "Hands-On with Google's Quantum Computer". https://www.scientificamerican.com/article/hands-on-with-googles-quantum-computer/.
11. ↑ Mack, Eric (24 October 2019). "No, Google and Its Quantum Computer Aren't Killing Bitcoin Anytime Soon". https://www.inc.com/eric-mack/no-google-its-quantum-computer-arent-killing-bitcoin-anytime-soon.html.
12. ↑ "IBM Search". 26 February 2018. https://www.ibm.com/Search/.
13. ↑ Yirka, Bob (28 August 2020). "Google conducts largest chemical simulation on a quantum computer to date" (in en). Phys.org. https://phys.org/news/2020-08-google-largest-chemical-simulation-quantum.html.
14. ↑ Savage, Neil (24 October 2019). "Google's Quantum Computer Achieves Chemistry Milestone" (in en). Scientific American. https://www.scientificamerican.com/article/googles-quantum-computer-achieves-chemistry-milestone/.
15. ↑ Arute, Frank et al. (28 August 2020). "Hartree–Fock on a superconducting qubit quantum computer" (in en). Science 369 (6507): 1084–1089. doi:10.1126/science.abb9811. ISSN 0036-8075. PMID 32855334. Bibcode: 2020Sci...369.1084.. https://www.science.org/doi/10.1126/science.abb9811. Retrieved 7 September 2020.
16. ↑ Satzinger, K. J.; Liu, Y.; Smith, A.; Knapp, C.; Newman, M.; Jones, C.; Chen, Z.; Quintana, C. et al. (2 April 2021). "Realizing topologically ordered states on a quantum processor". Science 374 (6572): 1237–1241. doi:10.1126/science.abi8378. PMID 34855491. Bibcode: 2021Sci...374.1237S.
17. ↑ Mi, Xiao; Ippoliti, Matteo; Quintana, Chris; Greene, Amy; Chen, Zijun; Gross, Jonathan; Arute, Frank; Arya, Kunal et al. (2022). "Time-crystalline eigenstate order on a quantum processor". Nature 601 (7894): 531–536. doi:10.1038/s41586-021-04257-w. PMID 34847568. Bibcode: 2022Natur.601..531M.
18. ↑ Wolchover, Natalie (30 July 2021). "Eternal Change for No Energy: A Time Crystal Finally Made Real" (in en). https://www.quantamagazine.org/first-time-crystal-built-using-googles-quantum-computer-20210730/.
19. ↑ 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. doi:10.1038/s41586-022-05424-3. PMID 36450904. Bibcode: 2022Natur.612...51J. https://www.nature.com/articles/s41586-022-05424-3.

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Sycamore processor. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Engineering:Sycamore_processor&oldid=536303"