Quantum computing's potential is immense, promising super-polynomial reductions in execution time, energy use, and memory requirements compared to classical computers. This technology has the power to revolutionize scientific applications such as simulating many-body quantum systems for molecular structure understanding, factorization of large integers, enhance machine learning, and in the process, disrupt industries like telecommunications, material science, pharmaceuticals and artificial intelligence. However, quantum computing's potential is curtailed by noise, further complicated by non-stationary noise parameter distributions across time and qubits. This dissertation focuses on the persistent issue of noise in quantum computing, particularly non-stationarity of noise parameters in transmon processors.
Quantum computing's potential is immense, promising super-polynomial reductions in execution time, energy use, and memory requirements compared to classical computers. This technology has the power to revolutionize scientific applications such as simulating many-body quantum systems for molecular structure understanding, factorization of large integers, enhance machine learning, and in the process, disrupt industries like telecommunications, material science, pharmaceuticals and artificial intelligence. However, quantum computing's potential is curtailed by noise, further complicated by non-stationary noise parameter distributions across time and qubits. This dissertation focuses on the persistent issue of noise in quantum computing, particularly non-stationarity of noise parameters in transmon processors.
Quantum computing represents a revolutionary leap in computational power, leveraging the principles of quantum mechanics to process information in fundamentally new ways. Unlike classical computers, which use bits to represent data as 0s or 1s, quantum computers use quantum bits or qubits, enabling the phenomena of superposition and entanglement to perform complex calculations more efficiently (Nielsen & Chuang, 2010). This article explores the basic principles of quantum computing, the different models and algorithms that have been developed, and the current state of quantum hardware. The power of quantum computing lies in its ability to solve certain types of problems exponentially faster than classical computers. For instance, Shor's algorithm can factorize large integers in polynomial time, posing a significant threat to classical encryption methods (Shor, 1997). Similarly, Grover's algorithm provides a quadratic speedup for unstructured search problems, showcasing the potential for dramatic improvements in database search capabilities (Grover, 1996). These algorithms exemplify how quantum computing can revolutionize fields that rely on complex computations. Quantum hardware, however, is still in its nascent stage, with significant challenges to be overcome. Current quantum computers, such as those developed by IBM and Google, have demonstrated quantum supremacy but are limited by issues of qubit coherence and error rates (Arute et al., 2019). Quantum error correction and the development of more stable qubit technologies are critical areas of ongoing research (Preskill, 2018). Despite these challenges, recent advancements in quantum hardware and algorithms continue to drive the field forward, promising transformative impacts on industries such as cryptography, drug discovery, and artificial intelligence. As quantum computing continues to advance, it holds the promise of solving problems that are currently intractable for classical computers, paving the way for unprecedented technological and scientific advancements (Shor, 1997; Grover, 1996). This article provides a comprehensive overview of the current landscape of quantum computing, discussing its foundational principles, key algorithms, hardware challenges, and potential applications. By understanding these aspects, we can better appreciate the profound implications of quantum computing for the future of technology and science.
Quantum computing isn't merely another step forward in technology; it represents a leap into an entirely new paradigm for understanding information. By harnessing the strange but powerful principles of quantum mechanics, quantum computers use qubits that can exist in multiple states at once, connect instantly through entanglement, and solve certain problems far faster than any classical machine. This paper explores the fundamentals of quantum computing, from its theoretical roots to the breakthroughs and setbacks shaping its present. We examine the engineering and scientific challenges - from fragile qubits to daunting scalability issues - and the immense promise they hold for fields like cryptography, artificial intelligence, drug discovery, and materials science. Finally, we consider the future impact of this technology, both its opportunities and its risks, and how it may redefine industries, research methods, and even our approach to solving humanity's hardest problems. The purpose of this paper is to examine the fundamental principles, developmental trajectory, current challenges, and prospective impacts of quantum computing across scientific, industrial, and societal domains. Given its potential to reshape computational capabilities and address complex global challenges, this study holds significance for researchers, policymakers, and industry leaders seeking to understand and navigate the transition toward quantum technologies.
Quantum computing, built on the principles of quantum mechanics, has emerged as a transformative paradigm with the potential to revolutionize computational capabilities, enabling solutions to problems that are currently intractable for classical systems. Quantum computing integrates hardware, architectures, and software for improved applications while utilizing superposition, entanglement, and interference to promote materials science, cryptography, optimization, and artificial intelligence. Sections introduce and describe the model components needed in order to create quantum processors, including qubits, quantum gates and control electronics, as well as a review of new developments in quantum software frameworks and programming tools. Notable examples, such as Shor’s algorithm for cryptographic caveat, Grover’s algorithm for inefficient search processes, and quantum-enhanced optimization, illuminate the position of quantum computing as a means of tackling tough problems that span disciplines, such as pharmaceuticals, predictors of climate, and finance modeling. However, the field continues to face significant challenges, like limited scalability, quantum gate error rates, qubit coherence times, and difficulties integrating with classical systems. Future efforts will focus on developing hybrid quantum-classical systems, scalable architectures, and industry- specific applications to transition quantum computing from exploration to practical deployment. This review provides a comprehensive analysis of quantum computing, covering its potential, trends, and challenges, while exploring hardware-software integration, classicalquantum comparisons, and insights to guide research and industry in unlocking its revolutionary possibility.
The paradigm of quantum computing is a new frontier of computation based on phenomena of quantum physics. Quantum computing offers a gateway to the realm of scientific exploration that is inaccessible to conventional computing. But to fully realize this capability, we often have to deal with roadblocks due to inherent problems such as the fragile nature of qubits, which makes them highly susceptible to noise from the external environment and within. Therefore, an in-depth understanding of various types of noise in qubits and the possible ways to tackle them is vital and indispensable for devising a solution. In this work, we explore the different kinds of noise that plague a quantum computing system. In addition, it contains a discussion on the techniques to suppress them, which are open for further investigation.
Quantum computing is emerging as a revolutionary field with the potential to redefine modern technology. Unlike classical computers, which rely on binary computation, quantum computers leverage quantum bits (qubits) to perform complex calculations at unprecedented speeds. This paper explores the transformative impact of quantum computing across various technological domains, including cryptography, artificial intelligence, data processing, and optimization problems. In cryptography, quantum algorithms such as Shor’s algorithm pose challenges to traditional encryption methods, necessitating the development of quantum-resistant cryptographic techniques. In artificial intelligence and machine learning, quantum computing enhances pattern recognition and accelerates data analysis. Furthermore, industries such as pharmaceuticals, material science, and logistics benefit from quantum-driven advancements in molecular simulations, material design, and supply chain optimization. Despite its immense potential, challenges such as hardware limitations, error correction, and high implementation costs hinder widespread adoption. However, continuous research and advancements in quantum algorithms, superconducting qubits, and quantum networking are expected to overcome these barriers, paving the way for a new era of technological innovation.
Quantum computing promises to revolutionize several scientific and technological domains through fundamentally new ways of processing information. Among its most compelling applications is digital quantum simulation, where quantum computers are used to replicate the behavior of other quantum systems. This could enable the study of problems that are otherwise intractable on classical computers, transforming fields such as quantum chemistry, condensed matter physics, and materials science. Despite this potential, realizations of practical quantum advantage for relevant problems are hindered by imperfections of current devices. This also affects quantum hardware based on superconducting circuits which is among the most advanced and scalable platforms. The envisaged long-term solution of fault-tolerant quantum computers that correct their own errors remains out of reach mainly due to the associated qubit number overhead. As a result, the field has developed strategies that combine quantum and classical resources, exploit hardware-native operations, and employ error mitigation techniques to extract meaningful results from noisy data. This doctoral thesis contributes to this broader effort by exploring methods for advancing quantum simulation across the full computational stack, including hardware-level innovations, refined techniques for noise modeling and error mitigation, and algorithmic improvements enabled by efficient measurement processing.