Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

CRC Press eBooks

Overview of Low-Dimensional Quantum Materials

Xixi Huang, Long Ren, Zongyu Huang, Jianxin Zhong

Published Sep 14, 2026• 0 citations
Publisher

Abstract

As Richard Feynman famously remarked in 1982, “Nature isn’t classical, and if you want to make a simulation of nature, you’d better make it quantum mechanical.” This insight underpins quantum information science, which seeks to exploit uniquely quantum phenomena to process, transmit, and store information beyond the capabilities of classical systems. In recent years, significant progress has been made toward realizing quantum computers. Notably, Google AI Quantum demonstrated a programmable superconducting processor (“Sycamore”) that performed a task beyond the practical reach of classical supercomputers, marking a milestone often referred to as “quantum supremacy.”

DOI
10.1201/9781003655305-2

Related papers

Quantum Information Processing

David Peter Divincenzo

Quantum Information Science is a cross-disciplinary subject that has arisen in the last twenty years. It concerns itself with the consequences of our most complete description of the physical world (that is, quantum mechanics) for the reliable, secure, private, and rapid processing of information, both in communication and computation. While its invention is often ascribed to the famous theoretical physicist Richard Feynman in the 1980s, his contributions were only one of many that initiated the field around that time. While he perceived that new types of physical devices, in which the quantum laws of superposition and entanglement function at the logical level, could give new power in the simulation of quantum physics, it was others (Bennett, Brassard) who showed that the uncertainty principle led to fundamentally more secure ways of communicating secret messages. It was yet others (Deutsch, Vazirani) who understood that quantum theory defined a new kind of Turing machine, and that not only quantum physics simulations, but potentially many other computational problems, are sped up in this machine. And it was yet another (Shor) who found a simple, very fast algorithm for prime factorization. The word "qubit" was coined only in 1995. Its introduction is indicative of a new mindset that has developed in recent years for studying and using quantum systems. "Qubit" now stands for a durable paradigm that spans a very wide variety of fields. It thus has many sub-meanings: first, it is the basic abstract unit of information for workers ranging from optical communication engineers to NMR spectroscopists to black-hole theorists. Second, it is the name we now routinely give to physical two level systems, as they are realized by photons, atomic and ionic eigenlevels, electronic and nuclear spin, structural defects in solids, and circulating-current states of superconducting devices. Physics has long dealt with some of these two-level systems, but calling them qubits implies a whole suite of interrelated ideas and capabilities that we ascribe to these systems: the ability to precisely set, and to precisely measure, the quantum state of one unique specimen, to avoid its coupling with the environment while at the same time strongly and controllably coupling the qubits together, to exploit the resulting quantum entanglement as a resource for metrological, cryptographic, and computational tasks. Quantum Information is a very diverse subject pursued today in many different directions, by many hundreds of researchers internationally: In theoretical physics, it has enlivened and sharpened the understanding of efficient representations of entangled many-particle wavefunctions, and has provided the prospect of applications for new concepts such as anyons and majorana fermions. Information theorists has benefitted from having a rigorous extension of the basis of their field, in which classical information theory is subsumed into a greatly broader subject. Theoretical computer scientists continue the search for new quantum algorithms, and have used quantum concepts to prove new results about the classification of computational complexity. Coding theorists have had the new and subtle problem of quantum error correction to analyse and conquer. Most strikingly, the program of experimental physics has been influenced in many directions by Quantum Information Science. State-of-the-art optics experiments transmit quantum states over long distances and perform precision manipulations in single quanta (atomic ions, impurity spins, quantum dots) in the quest to have working quantum cyptography and quantum computing. Quantum Hall systems, and topological insulators, are being assiduously examined for new elementary excitations for use as qubits. In the course of ten years, superconducting devices have improved by over four orders of magnitude in their quantum coherence, a metric made precise by the ideas of quantum computing. [...] DiVincenzo, David

WORLD SCIENTIFIC (EUROPE) eBooks•May 5, 2026•0 citations

Solid-state qubits

M. Fernando González-Zalba

The quantum world is fascinating. It presents a description of nature that defies our most rooted concepts about what reality is. For example, quantum objects possess \lq\lq spooky\rq\rq\ properties that allow them to be in multiple places at the same time, to move in different directions simultaneously, or to exist and not to exist. In other words, to live several parallel stories. Making use of these parallel stories to compute is the realm of quantum computation, a world in which information is processed using the laws of quantum physics. Nowadays, quantum computers are an object of an extensive experimental and theoretical research, since it is known that, on paper, these can solve many of the current computational challenges. These are the problems that even the most sophisticated supercomputers of today, or tomorrow, will not be able to solve.

arXiv:1801.06722•Jan 20, 2018•5 citations

Quantum supremacy using a programmable superconducting processor

Frank Arute, Kunal Arya, Ryan Babbush +74 more

The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor1. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorithms in an exponentially large computational space. Here we report the use of a processor with programmable superconducting qubits2–7 to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 253 (about 1016). Measurements from repeated experiments sample the resulting probability distribution, which we verify using classical simulations. Our Sycamore processor takes about 200 seconds to sample one instance of a quantum circuit a million times—our benchmarks currently indicate that the equivalent task for a state-of-the-art classical supercomputer would take approximately 10,000 years. This dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy8–14 for this specific computational task, heralding a much-anticipated computing paradigm. Quantum supremacy is demonstrated using a programmable superconducting processor known as Sycamore, taking approximately 200 seconds to sample one instance of a quantum circuit a million times, which would take a state-of-the-art supercomputer around ten thousand years to compute.

arXiv:1910.11333•Nature•Oct 23, 2019•8,266 citations

Quantum Information Science

Ian A. Walmsley, P. L. Knight

Quantum technology has made great strides in recent years. While quantum computers offer many benefits, we are far from seeing them implemented on a mass scale. Here we review the basic building blocks of quantum information processing, identify the advantages of quantum physics over classical physics, explain how quantum communication protocols work and identify the challenges we need to overcome to realize a quantum computer.

Optics and Photonics News•Nov 1, 2002•28 citations

Redefining the Quantum Supremacy Baseline With a New Generation Sunway Supercomputer

Xin Liu, Chu Guo, Yong Liu +11 more

A major milestone in the era of noisy intermediate scale quantum computers is \textit{quantum supremacy} [Nature \textbf{574}, 505 (2019)] claimed on the Sycamore quantum processor of $53$ qubits, which can perform a random circuit sampling task within $200$ seconds while the same task is estimated to require a runtime of $10,000$ years on Summit. This record has been renewed with two recent experiments on the Zuchongzhi $2.0$ ($56$ qubits) and Zuchongzhi $2.1$ ($60$ qubits) quantum processors. On the other front of quantum supremacy comparison, there has also been continuous improvements on both the classical simulation algorithm as well as the underlying hardware. And a fair justification of the computational advantages for those quantum supremacy experiments would require to practically simulate the same problems on current top supercomputers, which is still in lack. Here we report the full-scale simulations of these problems on new generation Sunway supercomputer, based on a customized tensor network contraction algorithm. Our benchmark shows that the most challenging sampling task performed on Sycamore can be accomplished within $1$ week, thus collapsing the quantum supremacy claim of Sycamore. Additionally, we show that the XEB fidelities of the \textit{quantum supremacy circuits} with up to $14$ cycles can be verified in minutes, which also provides strong consistency check for quantum supremacy experiments. Our results redefine quantum supremacy baseline using the new generation Sunway supercomputer.

arXiv:2111.01066•Nov 1, 2021•19 citations

Quantum Simulations of Fundamental Physics

Martin J. Savage A

Simulating the dynamics of non-equilibrium matter under extreme conditions lies beyond the capabilities of classical computation alone. Remarkable advances in quantum information science and technology are profoundly changing how we understand and explore fundamental quantum many-body systems, and have brought us to the point of simulating essential aspects of these systems using quantum computers. I discuss highlights, opportunities and the challenges that lie ahead.

arXiv:2503.23233•International Workshop on Chiral Dynamics (CD)•Nov 28, 2025•4 citations
As Richard Feynman famously remarked in 1982, “Nature isn’t classical, and if you want to make a simulation of nature, you’d better make it quantum mechanical.” This insight underpins quantum information science, which seeks to exploit uniquely quantum phenomena to process, transmit, and store information beyond the capabilities of classical systems. In recent years, significant progress has been made toward realizing quantum computers. Notably, Google AI Quantum demonstrated a programmable superconducting processor (“Sycamore”) that performed a task beyond the practical reach of classical supercomputers, marking a milestone often referred to as “quantum supremacy.”
Quantum Information Science is a cross-disciplinary subject that has arisen in the last twenty years. It concerns itself with the consequences of our most complete description of the physical world (that is, quantum mechanics) for the reliable, secure, private, and rapid processing of information, both in communication and computation. While its invention is often ascribed to the famous theoretical physicist Richard Feynman in the 1980s, his contributions were only one of many that initiated the field around that time. While he perceived that new types of physical devices, in which the quantum laws of superposition and entanglement function at the logical level, could give new power in the simulation of quantum physics, it was others (Bennett, Brassard) who showed that the uncertainty principle led to fundamentally more secure ways of communicating secret messages. It was yet others (Deutsch, Vazirani) who understood that quantum theory defined a new kind of Turing machine, and that not only quantum physics simulations, but potentially many other computational problems, are sped up in this machine. And it was yet another (Shor) who found a simple, very fast algorithm for prime factorization. The word "qubit" was coined only in 1995. Its introduction is indicative of a new mindset that has developed in recent years for studying and using quantum systems. "Qubit" now stands for a durable paradigm that spans a very wide variety of fields. It thus has many sub-meanings: first, it is the basic abstract unit of information for workers ranging from optical communication engineers to NMR spectroscopists to black-hole theorists. Second, it is the name we now routinely give to physical two level systems, as they are realized by photons, atomic and ionic eigenlevels, electronic and nuclear spin, structural defects in solids, and circulating-current states of superconducting devices. Physics has long dealt with some of these two-level systems, but calling them qubits implies a whole suite of interrelated ideas and capabilities that we ascribe to these systems: the ability to precisely set, and to precisely measure, the quantum state of one unique specimen, to avoid its coupling with the environment while at the same time strongly and controllably coupling the qubits together, to exploit the resulting quantum entanglement as a resource for metrological, cryptographic, and computational tasks. Quantum Information is a very diverse subject pursued today in many different directions, by many hundreds of researchers internationally: In theoretical physics, it has enlivened and sharpened the understanding of efficient representations of entangled many-particle wavefunctions, and has provided the prospect of applications for new concepts such as anyons and majorana fermions. Information theorists has benefitted from having a rigorous extension of the basis of their field, in which classical information theory is subsumed into a greatly broader subject. Theoretical computer scientists continue the search for new quantum algorithms, and have used quantum concepts to prove new results about the classification of computational complexity. Coding theorists have had the new and subtle problem of quantum error correction to analyse and conquer. Most strikingly, the program of experimental physics has been influenced in many directions by Quantum Information Science. State-of-the-art optics experiments transmit quantum states over long distances and perform precision manipulations in single quanta (atomic ions, impurity spins, quantum dots) in the quest to have working quantum cyptography and quantum computing. Quantum Hall systems, and topological insulators, are being assiduously examined for new elementary excitations for use as qubits. In the course of ten years, superconducting devices have improved by over four orders of magnitude in their quantum coherence, a metric made precise by the ideas of quantum computing. [...] DiVincenzo, David
The quantum world is fascinating. It presents a description of nature that defies our most rooted concepts about what reality is. For example, quantum objects possess \lq\lq spooky\rq\rq\ properties that allow them to be in multiple places at the same time, to move in different directions simultaneously, or to exist and not to exist. In other words, to live several parallel stories. Making use of these parallel stories to compute is the realm of quantum computation, a world in which information is processed using the laws of quantum physics. Nowadays, quantum computers are an object of an extensive experimental and theoretical research, since it is known that, on paper, these can solve many of the current computational challenges. These are the problems that even the most sophisticated supercomputers of today, or tomorrow, will not be able to solve.
The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor1. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorithms in an exponentially large computational space. Here we report the use of a processor with programmable superconducting qubits2–7 to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 253 (about 1016). Measurements from repeated experiments sample the resulting probability distribution, which we verify using classical simulations. Our Sycamore processor takes about 200 seconds to sample one instance of a quantum circuit a million times—our benchmarks currently indicate that the equivalent task for a state-of-the-art classical supercomputer would take approximately 10,000 years. This dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy8–14 for this specific computational task, heralding a much-anticipated computing paradigm. Quantum supremacy is demonstrated using a programmable superconducting processor known as Sycamore, taking approximately 200 seconds to sample one instance of a quantum circuit a million times, which would take a state-of-the-art supercomputer around ten thousand years to compute.
A major milestone in the era of noisy intermediate scale quantum computers is \textit{quantum supremacy} [Nature \textbf{574}, 505 (2019)] claimed on the Sycamore quantum processor of 535353 qubits, which can perform a random circuit sampling task within 200200200 seconds while the same task is estimated to require a runtime of 10,00010,00010,000 years on Summit. This record has been renewed with two recent experiments on the Zuchongzhi 2.02.02.0 (565656 qubits) and Zuchongzhi 2.12.12.1 (606060 qubits) quantum processors. On the other front of quantum supremacy comparison, there has also been continuous improvements on both the classical simulation algorithm as well as the underlying hardware. And a fair justification of the computational advantages for those quantum supremacy experiments would require to practically simulate the same problems on current top supercomputers, which is still in lack. Here we report the full-scale simulations of these problems on new generation Sunway supercomputer, based on a customized tensor network contraction algorithm. Our benchmark shows that the most challenging sampling task performed on Sycamore can be accomplished within 111 week, thus collapsing the quantum supremacy claim of Sycamore. Additionally, we show that the XEB fidelities of the \textit{quantum supremacy circuits} with up to 141414 cycles can be verified in minutes, which also provides strong consistency check for quantum supremacy experiments. Our results redefine quantum supremacy baseline using the new generation Sunway supercomputer.