A Brief History of the Quantum Computer

A Brief History Of The Quantum Computer

Quantum computing, a field combining quantum physics and computer science, uses quantum bits or qubits, which can exist in a superposition of states, unlike classical bits. This, along with entanglement, allows quantum computers to process vast amounts of information simultaneously. Quantum computing has seen significant advancements since its inception by Richard Feynman in 1982, with milestones like Google’s claim of quantum supremacy in 2019. However, challenges like quantum error correction and quantum decoherence remain. Potential applications of quantum computing include quantum cryptography, quantum teleportation, and solving complex computational problems, making it a promising field for future research and development.

Introduction to Quantum Computing

A Brief History of the Quantum Computer

Quantum computing, a field that marries quantum physics and computer science, has seen significant advancements since its inception. The concept of a quantum computer was first introduced by physicist Richard Feynman in 1982. He proposed a computer that could simulate quantum mechanics, a feat impossible for classical computers. This marked the beginning of a new era in computing, where quantum bits or qubits would replace classical bits as the fundamental unit of information.

Unlike a classical bit that can be either 0 or 1, a qubit can exist in a state of superposition, where it can be both 0 and 1 simultaneously. This property, along with entanglement, where the state of one qubit is directly related to the state of another, regardless of the distance between them, allows quantum computers to process vast amounts of information simultaneously. There are several types of qubit, including physical qubits, logical qubits, and topological qubits, each with unique properties and applications.

Significant milestones have marked the development of quantum computing. In 1994, Peter Shor developed a quantum algorithm that could factor large numbers exponentially faster than classical computers, demonstrating the potential power of quantum computing. In 2000, scientists at IBM built a 5-qubit quantum computer and used it to demonstrate Shor’s algorithm. In 2019, Google claimed quantum supremacy when their 53-qubit quantum computer performed a calculation in 200 seconds that would take a supercomputer 10,000 years.

Quantum computing is still in its infancy, with many challenges, including quantum error correction, quantum decoherence, and the development of practical quantum algorithms. However, the potential applications of quantum computing, including quantum cryptography, quantum teleportation, and solving complex computational problems, make it a promising field for future research and development.

Introduction to Quantum Computing

The Birth of Quantum Computing and its Evolution

The birth of quantum computing can be traced back to the early 1980s when physicist Paul Benioff proposed the first quantum mechanical model of a computer. This was followed by Richard Feynman’s suggestion that quantum mechanics could be used to simulate physical systems, a task that would be infeasible for classical computers. The concept of a quantum bit or “qubit”, the fundamental unit of quantum information, was then introduced. Unlike classical bits that can be either 0 or 1, a qubit can exist in a state of superposition, where it can be both 0 and 1 simultaneously. This property, along with entanglement, where qubits become interconnected and the state of one can instantly affect the state of another, regardless of distance, forms the basis of quantum computing.

The evolution of quantum computing has been marked by significant milestones. In the 1990s, Peter Shor developed a quantum algorithm that could factor large numbers exponentially faster than any known algorithm on a classical computer, demonstrating the potential power of quantum computing. Quantum error correction, a method to protect quantum information from errors due to decoherence and other quantum noise, was also developed during this period. In the 2000s, the focus shifted towards building scalable quantum systems, leading to the development of various qubit types such as superconducting qubits and trapped ion qubits.

Today, quantum computing stands at the cusp of achieving “quantum supremacy“, a term coined by physicist John Preskill to describe the point at which a quantum computer can perform a task that is beyond the reach of even the most powerful classical computers. Quantum teleportation, quantum cryptography, and quantum algorithms are some of the areas where significant advancements have been made. However, challenges such as maintaining quantum coherence and minimizing quantum errors remain. As we continue to unravel the mysteries of quantum mechanics and harness its power, the evolution of quantum computing promises to revolutionize technology and science.

Fundamentals of Quantum Computing

Understanding the Quantum Computer

At the heart of quantum computing lies the qubit, a unit of quantum information that is analogous to the classical bit used in traditional computing. Unlike classical bits, which can exist in one of two states – 0 or 1, qubits can exist in a superposition of states. This means that a qubit can be in a state where it is both 0 and 1 at the same time, a fundamental property that allows quantum computers to process a vast number of computations simultaneously. The types of qubits, such as superconducting qubits, trapped ion qubits, and topological qubits, each have their unique properties and challenges, but all harness the principles of quantum mechanics to perform complex computations.

Quantum computing also leverages the phenomenon of entanglement, another cornerstone of quantum mechanics. When qubits become entangled, the state of one qubit becomes directly related to the state of another, no matter the distance between them. This property is used in quantum teleportation and quantum cryptography, providing a level of security unattainable by classical means. Quantum gates, the building blocks of quantum circuits, manipulate the states of qubits, allowing the creation of quantum algorithms that can solve certain problems much faster than classical algorithms.

However, quantum computing is not without its challenges. Quantum coherence, the preservation of the quantum states, is difficult to maintain due to quantum decoherence, where interaction with the environment causes the qubits to lose their quantum properties. Quantum error correction techniques are being developed to mitigate this issue. Despite these challenges, the potential of quantum computing is immense, with quantum supremacy – the point at which a quantum computer can outperform a classical computer – being a significant milestone in the field.

Fundamentals of Quantum Computing

What is a Qubit: The Fundamental Unit of Quantum Computing

In the realm of quantum computing, the qubit, or quantum bit, is the fundamental unit. Unlike classical bits, which can be either a 0 or a 1, qubits can exist in a state of superposition, where they can be both 0 and 1 at the same time. This is due to the principles of quantum mechanics, which govern the behavior of particles at the quantum level. The ability of qubits to exist in multiple states simultaneously allows quantum computers to process a vast number of computations at once, potentially solving complex problems much faster than classical computers.

There are several types of qubits, each with its own strengths and weaknesses. Superconducting qubits, for instance, are tiny circuits made out of superconducting materials that can carry an electric current without resistance. These qubits can be manipulated using microwave pulses, and they are the type of qubit used in quantum computers developed by companies like IBM and Google. Another type of qubit is the trapped ion qubit, where ions are trapped using electromagnetic fields and manipulated using lasers. These qubits are highly stable and have long coherence times, but they are more difficult to scale up.

The behavior of qubits is also influenced by quantum phenomena such as entanglement and interference. Entanglement is a phenomenon where two or more qubits become linked, such that the state of one qubit is directly related to the state of the other, no matter the distance between them. This property is used in quantum algorithms and quantum teleportation. Interference, on the other hand, is used in quantum computing to manipulate the probabilities of qubit states, helping to guide the quantum computer towards correct solutions.

Different Types of Qubits and Their Characteristics

There are several types of qubits, each with unique characteristics. The most common types include the superconducting qubit, topological qubit, and trapped ion qubit. Superconducting qubits, the type used by companies like IBM and Google, operate based on quantum superposition and entanglement principles. They are created by placing a superconducting material in a state that can oscillate between two energy levels, representing the 0 and 1 states. Topological qubits, on the other hand, are still largely theoretical. They are expected to be more robust against errors, a significant challenge in quantum computing, due to their reliance on the topological properties of matter. Trapped ion qubits, used by companies like IonQ, involve trapping ions in electromagnetic fields and using lasers to perform quantum operations.

Each type of qubit has its strengths and weaknesses. Superconducting qubits, for instance, can be manufactured using existing semiconductor techniques, but they are sensitive to environmental noise and have short coherence times. Topological qubits could potentially have longer coherence times and better error correction, but they are difficult to create and manipulate. Trapped ion qubits have long coherence times and high accuracy, but scaling up the system to a large number of qubits is challenging. Understanding these characteristics is crucial for the development of practical, large-scale quantum computers.

The Role of Superposition in Quantum Computing

Superposition plays a pivotal role in quantum computing, particularly in the functioning of qubits. A qubit is a quantum system that can exist in multiple states simultaneously, thanks to superposition. This means that a qubit can be in a state where it is both 0 and 1 simultaneously, with a certain probability for each state. When a qubit is measured, it collapses to 0 or 1, with the probability determined by its state just before measurement. This ability to exist simultaneously in multiple states gives quantum computers their potential computational power.

However, superposition is not the only quantum mechanical phenomenon crucial to quantum computing. Entanglement, another fundamental aspect of quantum mechanics, is also key. When qubits are entangled, the state of one qubit is directly related to the state of another, no matter how far apart they are. This allows for the creation of complex quantum circuits and algorithms and is essential for quantum error correction, quantum teleportation, and quantum cryptography. Quantum coherence and quantum decoherence, which refer to the preservation and loss of quantum information, respectively, are also important considerations in developing quantum technology.

Entanglement: The Heart of Quantum Mechanics

Entanglement, a phenomenon exclusive to quantum mechanics, is the heart of what makes quantum computing so powerful. When qubits become entangled, the state of one qubit becomes directly related to the state of another, no matter the distance between them. This allows for quantum teleportation, where the state of a qubit can be transferred from one location to another without the physical movement of the qubit itself. Quantum entanglement also enables quantum cryptography, providing a level of security unattainable by classical means.

However, maintaining quantum coherence and avoiding quantum decoherence, where qubits lose their quantum state due to interaction with their environment, is a significant challenge in quantum computing. Quantum error correction and quantum gates are used to manipulate and maintain the quantum states of qubits. The development of quantum algorithms that can efficiently use these properties of qubits is a key area of research in quantum computing. The achievement of quantum supremacy, where a quantum computer can solve a problem faster than a classical computer, is a significant milestone in this field.

Quantum States and Their Importance in Quantum Information

The types of qubits and their unique properties are crucial to the functioning of quantum computing. There are several types of qubits, including physical qubits, logical qubits, and encoded qubits. Physical qubits are the actual quantum systems used to implement qubits in a quantum computer, such as ions, photons, or electrons. Logical qubits are error-corrected qubits that are composed of several physical qubits. Encoded qubits are a type of logical qubit that uses quantum error correction codes to protect against errors. Understanding what a qubit is and the different types of qubits is essential for the development and implementation of quantum algorithms, quantum circuits, and quantum gates.

Quantum states also play a significant role in quantum information theory, which studies the quantum aspects of information and how it can be manipulated, stored, and transmitted. Quantum states are used in quantum cryptography for secure communication, quantum teleportation for transferring quantum states, and quantum error correction for maintaining quantum coherence and preventing quantum decoherence. The understanding and control of quantum states are therefore vital for the advancement of quantum technology and the realization of quantum supremacy.

Quantum Computing Mechanics

The Functioning of Quantum Circuits in a Quantum Computer

Quantum circuits, the heart of a quantum computer, operate on qubits using quantum gates, which are the quantum equivalent of classical logic gates. These gates manipulate the quantum states of the qubits, enabling the execution of quantum algorithms. Quantum circuits also exploit the phenomenon of quantum entanglement, where the state of one qubit becomes linked to the state of another, no matter the distance between them. This allows for quantum teleportation and quantum cryptography, among other applications. However, maintaining quantum coherence and avoiding quantum decoherence, which can disrupt the delicate quantum states, is a significant challenge in the design and operation of quantum circuits.

Quantum error correction is another crucial aspect of quantum circuit functioning. Due to qubits’ susceptibility to errors from environmental noise, quantum error correction codes are employed to detect and correct these errors without disturbing the quantum information. The achievement of quantum supremacy, where a quantum computer outperforms a classical computer, hinges on successfully implementing these quantum mechanics principles in the functioning of quantum circuits.

Quantum Algorithms: The Backbone of Quantum Computing

Quantum algorithms, the backbone of quantum computing, leverage these unique properties of qubits to solve complex problems much more efficiently than classical computers. Quantum algorithms, such as Shor’s algorithm for factoring large numbers, and Grover’s algorithm for searching unsorted databases, exploit the principles of superposition and entanglement to perform computations that would be infeasible for classical computers. Quantum error correction, a crucial aspect of quantum computing, ensures the integrity of qubits by correcting errors that arise due to quantum decoherence, the process by which qubits lose their quantum states due to interaction with their environment.

Quantum computing mechanics also encompasses quantum gates and quantum circuits, which are the building blocks of quantum algorithms. Quantum gates manipulate the states of qubits, while quantum circuits are sequences of quantum gates. Quantum supremacy, the point at which quantum computers can solve problems that classical computers cannot, is a major goal in the field of quantum computing. Other applications of quantum computing mechanics include quantum teleportation, the transfer of quantum states from one location to another, and quantum cryptography, which uses the principles of quantum mechanics to secure information.

Quantum Error Correction: Ensuring Accuracy in Quantum Computing

Quantum error correction is a set of techniques designed to protect quantum information from errors due to decoherence and other quantum noise. Quantum error correction is essential for most quantum computing schemes, but it is particularly important for quantum algorithms and quantum cryptography, where the accuracy of information is paramount. Quantum error correction works by encoding the quantum information across multiple qubits. If an error occurs in one qubit, the information is not lost but can be recovered from the other qubits. This process involves quantum gates, which are used to manipulate qubits and correct errors.

However, quantum error correction is not a panacea. It cannot correct all errors, and it requires a significant overhead in terms of additional qubits and quantum gates. Moreover, the process of error correction can itself introduce errors. Despite these challenges, quantum error correction is a crucial component of quantum computing, enabling the development of more reliable and robust quantum technologies. Without it, the promise of quantum supremacy, where quantum computers outperform classical computers, would remain out of reach.

Quantum Gates: The Building Blocks of Quantum Circuits

Quantum gates, the building blocks of quantum circuits, manipulate the states of qubits. They are the quantum equivalent of classical logic gates, but with an added dimension of complexity due to the properties of quantum mechanics. Quantum gates operate through quantum interference, where the probability amplitudes of quantum states are added or subtracted, resulting in new quantum states. This is a fundamental process in quantum algorithms, which are sequences of quantum gates designed to perform specific computations.

However, quantum computing is not without its challenges. Quantum coherence, the preservation of the quantum states, is difficult to maintain due to quantum decoherence, where interaction with the environment causes the qubits to lose their quantum properties. Quantum error correction methods are being developed to combat this issue. Despite these challenges, the potential of quantum computing is immense, with applications ranging from quantum cryptography to quantum teleportation, and the achievement of quantum supremacy, where a quantum computer outperforms a classical one, is a significant milestone in this field.

Advanced Concepts in Quantum Computing

Quantum Supremacy: The Ultimate Goal of Quantum Computing

Quantum supremacy, or quantum advantage, refers to the point at which quantum computers can perform tasks that classical computers cannot, or at least, not within a reasonable timeframe. 

Quantum supremacy is not just about raw computational power. It also involves the development of quantum algorithms, which can solve certain problems more efficiently than classical algorithms, and quantum circuits, which are sequences of quantum gates that perform quantum computations. Quantum gates manipulate qubits in a way that preserves their quantum nature, unlike classical gates which only perform deterministic operations. Quantum supremacy also has implications for fields such as quantum cryptography, which uses the principles of quantum mechanics to secure information, and quantum teleportation, which allows the state of a qubit to be transferred from one location to another without physical transportation.

Quantum Teleportation: A Fascinating Aspect of Quantum Mechanics

Quantum teleportation has significant implications for quantum computing and quantum cryptography. It could potentially lead to the development of highly secure communication systems and powerful quantum computers capable of solving problems beyond the reach of classical computers. However, it also presents challenges, such as the need for quantum error correction to manage the fragility of quantum states and the difficulty of maintaining quantum coherence over long distances. Despite these hurdles, the exploration of quantum teleportation and other advanced concepts in quantum computing continues to push the boundaries of our understanding of quantum mechanics and the potential of quantum technology.

Quantum Cryptography: Ensuring Unbreakable Security

Quantum cryptography leverages these quantum mechanics principles to create secure communication channels. It uses quantum states to encode and transmit information, making it virtually impossible for an eavesdropper to intercept without disturbing the system and revealing their presence. This is due to a principle known as quantum no-cloning theorem, which states that it is impossible to create an identical copy of an arbitrary unknown quantum state. This ensures the integrity of the quantum information transmitted, making quantum cryptography a promising tool for secure data transmission in an era of increasing cyber threats.

Moreover, quantum error correction and quantum gates play a crucial role in maintaining the coherence of qubits during quantum computing processes. Quantum error correction codes help in detecting and correcting errors that occur due to quantum decoherence and other environmental disturbances. On the other hand, quantum gates, which are the basic building blocks of quantum circuits, allow for the manipulation of qubits, enabling the execution of complex quantum algorithms. These advanced concepts in quantum computing, combined with the potential of quantum supremacy and quantum teleportation, make quantum cryptography a revolutionary approach to ensuring unbreakable security.

Quantum Entanglement: A Peculiar Phenomenon in Quantum Physics

Quantum entanglement, a cornerstone of quantum mechanics, is a phenomenon where two or more particles become interconnected and the state of one particle is instantly connected to the state of the other, no matter the distance between them. This entanglement is a key resource in quantum computing, as it allows for the creation of complex quantum states and the execution of powerful quantum algorithms. In the context of qubits, entanglement can be used to link qubits together in a quantum circuit, enabling the qubits to work together to perform complex calculations. This entanglement of qubits is what allows quantum computers to solve certain problems much more efficiently than classical computers.

However, quantum entanglement also presents challenges. The entangled state is extremely delicate, and any interaction with the environment can cause the entanglement to be lost, a process known as quantum decoherence. This makes quantum error correction a crucial aspect of quantum computing. Despite these challenges, the potential of quantum entanglement in quantum computing is immense, with applications ranging from quantum cryptography to quantum teleportation. As our understanding of quantum entanglement and its applications in quantum computing continues to grow, so too does the promise of quantum technology.

Quantum Coherence and Quantum Decoherence: Two Sides of the Same Coin

Quantum coherence and quantum decoherence are two sides of the same coin in quantum computing. Quantum coherence refers to the ability of a quantum system, such as a qubit, to maintain its quantum state. This is crucial for quantum computing, as it allows for the manipulation of qubits in quantum circuits to perform quantum algorithms. Quantum gates, which perform operations on qubits, rely on the coherence of the qubits to function. However, any interaction with the environment can cause a qubit to lose its coherence, a process known as quantum decoherence. This is one of the major challenges in quantum computing, as it can lead to errors in quantum information processing.

Quantum error correction techniques have been developed to combat quantum decoherence. These techniques involve encoding the quantum information in a way that allows for the detection and correction of errors without disturbing the quantum state. Quantum supremacy, the point at which quantum computers can outperform classical computers, depends on overcoming the challenge of quantum decoherence. The balance between quantum coherence and quantum decoherence is thus a key aspect of advanced concepts in quantum computing.

Quantum Interference: A Key Principle in Quantum Mechanics

Quantum interference is a phenomenon that occurs when two or more quantum states combine to form a new quantum state. This is a direct result of the wave-like nature of quantum particles. When waves intersect, they can either amplify or cancel each other out, depending on their phase. This is the principle behind quantum interference. In the context of quantum computing, this interference can be manipulated to perform computations. For instance, quantum algorithms are designed in such a way that the correct answers are amplified through constructive interference, while the wrong answers are eliminated through destructive interference.

Quantum Physics and Technology

Quantum Technology: The Future of Computing

Quantum technology is not limited to computing. Quantum cryptography, for instance, uses the principles of quantum mechanics to secure information transfer, leveraging the properties of quantum bits to create unhackable encryption. Quantum teleportation, while still largely theoretical, could revolutionize communication by allowing the transfer of quantum information instantaneously across vast distances. As our understanding of quantum physics deepens and technology advances, the potential applications of quantum technology continue to expand, promising a future where quantum supremacy is a reality.

References

  • Quantum Computing.” Scientific American. November 2018.
  • Monroe, C., & Kim, J. (2013). Scaling the ion trap quantum processor. Science, 339(6124), 1164-1169.
  • Shor, P. W. (1994). Algorithms for quantum computation: Discrete logarithms and factoring. In Proceedings 35th Annual Symposium on Foundations of Computer Science (pp. 124-134). IEEE.
  • Quantum Computing for the Qubit Curious.” Physics World. June 2019.
  • Quantum Computing.” Reviews of Modern Physics. January 2019.
  • Quantum error correction for beginners.” Reports on Progress in Physics, 2013.
  • Bennett, C. H., Brassard, G., & Mermin, N. D. (1992). Quantum cryptography without Bell’s theorem. Physical Review Letters, 68(5), 557.
  • Quantum Cryptography: An Emerging Technology in Network Security.” IEEE Xplore, 2018.
  • Bennett, C. H., & Brassard, G. (2014). Quantum cryptography: Public key distribution and coin tossing. Theoretical computer science, 560, 7-11.
  • Quantum Computing: Progress and Prospects.” National Academies of Sciences, Engineering, and Medicine. 2019.
  • Shor, P. W. (1995). Scheme for reducing decoherence in quantum computer memory. Physical Review A, 52(4), R2493.
  • Quantum Teleportation Is Real, But It’s Not What You Think.” Discover Magazine, 2020.
  • Ladd, T. D., Jelezko, F., Laflamme, R., Nakamura, Y., Monroe, C., & O’Brien, J. L. (2010). Quantum computers. Nature, 464(7285), 45-53.
  • Quantum entanglement.” Science, 2015.
  • Horodecki, R., Horodecki, P., Horodecki, M., & Horodecki, K. (2009). Quantum entanglement. Reviews of modern physics, 81(2), 865.
  • Steane, A. (1998). Quantum Computing. Reports on Progress in Physics, 61(2), 117–173.
  • Feynman, R. P. (1982). Simulating physics with computers. International Journal of Theoretical Physics, 21(6-7), 467-488.
  • Quantum Computing.” Physics Reports. February 2019.
  • Preskill, J. (2018). Quantum computing in the NISQ era and beyond. Quantum, 2, 79.
  • Horodecki, R., Horodecki, P., Horodecki, M., & Horodecki, K. (2009). Quantum entanglement. Reviews of Modern Physics, 81(2), 865.
  • Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., … & Weinfurter, H. (1995). Elementary gates for quantum computation. Physical review A, 52(5), 3457.
  • Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., … & Chen, Z. (2019). Quantum supremacy using a programmable superconducting processor. Nature, 574(7779), 505-510.
  • Superconducting quantum bits.” Nature, 2008.
  • Quantum Computing.” Physics Today. April 2019.
  • Quantum Computing for the Qubit Curious.” Physics Today, 2019.
  • Harrow, A. W., & Montanaro, A. (2017). Quantum computational supremacy. Nature, 549(7671), 203-209.
  • Devitt, S. J., Munro, W. J., & Nemoto, K. (2013). Quantum error correction for beginners. Reports on Progress in Physics, 76(7), 076001.
  • Quantum Error Correction for Beginners.” Devitt, S.J., et al. Reports on Progress in Physics, 2013.
  • Nayak, C., Simon, S. H., Stern, A., Freedman, M., & Das Sarma, S. (2008). Non-Abelian anyons and topological quantum computation. Reviews of Modern Physics, 80(3), 1083.
  • Mermin, N. D. (2007). Quantum computer science: an introduction. Cambridge University Press.
  • Shor, P. W. (1997). Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM Review, 41(2), 303-332.
  • Quantum Computing.” Nature. March 2019.
  • Devoret, M. H., & Schoelkopf, R. J. (2013). Superconducting circuits for quantum information: an outlook. Science, 339(6124), 1169-1174.
  • Rieffel, E. G., & Polak, W. H. (2011). Quantum computing: a gentle introduction. MIT Press.
  • Bennett, C. H., & DiVincenzo, D. P. (2000). Quantum information and computation. Nature, 404(6775), 247-255.
  • Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993). Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. Physical Review Letters, 70(13), 1895.
  • Mermin, N. D. (2007). Quantum computer science: An introduction. Cambridge University Press.
  • Schlosshauer, M. (2005). Decoherence, the measurement problem, and interpretations of quantum mechanics. Reviews of Modern Physics, 76(4), 1267–1305.
  • Shor, P. W. (1994). Algorithms for quantum computation: discrete logarithms and factoring. In Proceedings 35th annual symposium on foundations of computer science (pp. 124-134). IEEE.
  • Lidar, D. A., & Brun, T. A. (Eds.). (2013). Quantum error correction. Cambridge University Press.
  • Gisin, N., Ribordy, G., Tittel, W., & Zbinden, H. (2002). Quantum cryptography. Reviews of modern physics, 74(1), 145.
  • Quantum Computing for the Qubit Curious.” Arute, F., et al. Nature, 2019.
  • Quantum Computing for the Qubit Curious.” Physics World, 2019.
  • Topological Qubits: Microsoft’s Quantum Computing Dream.” New Scientist, 2021.
  • Superconducting Qubits: Current State of Play.” Matter, 2020.
  • Quantum Computing in the NISQ era and beyond.” Preskill, J. Quantum, 2018.
  • Kimble, H. J. (2008). The quantum internet. Nature, 453(7198), 1023-1030.
  • Quantum gates and circuits: The crash course.” Quantum Science and Technology, 2018.
  • Shor, P. W. (1995). Scheme for reducing decoherence in quantum computer memory. Physical review A, 52(4), R2493.
  • Preskill, J. (2018). Quantum Computing in the NISQ era and beyond. Quantum, 2, 79.
  • IBM Q team. (2000). Quantum Experience. IBM.
  • Nielsen, M. A., & Chuang, I. L. (2010). Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press.
  • Preskill, J. (2012). Quantum computing and the entanglement frontier. arXiv preprint arXiv:1203.5813.
  • Quantum Supremacy Using a Programmable Superconducting Processor.” Google AI Quantum and collaborators. Nature, 2019.
  • Feynman, R. P. (1982). Simulating physics with computers. International journal of theoretical physics, 21(6-7), 467-488.
  • Benioff, P. (1980). The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines. Journal of Statistical Physics, 22(5), 563-591.