Quantum simulation is one of the most relevant applications of quantum computation for the near future, due to its scientific impact and also because quantum simulation algorithms are typically less demanding than generalized quantum computations. Ultimately, the success of a quantum simulation depends on the amount and reliability of information one is able to extract from the results. In such a context, this work reviews the theory behind quantum simulation, with a focus on digital quantum simulation. The concepts of efficiency and reliability in quantum simulations are discussed, particularly for implementations of digital simulation algorithms in state-of-the-art quantum computers. A review of approaches for quantum characterization, verification and validation techniques (QCVV) is also presented. A digital quantum simulation of the Schrödinger equation for a single particle in 1 spatial dimension was experimentally implemented and analyzed, along with a quantum state tomography procedure for characterization of the final quantum state and evaluation of simulation reliability. From the literature, it is shown that digital quantum simulation is theoretically sound and experimentally feasible, with several applications in a wide range of physics-related fields. Nonetheless, a number of conditions arise that must be observed for a truly efficient implementation of a digital quantum simulation, from theoretical conception to experimental circuit design. The review of QCVV techniques highlights the need for characterization and validation techniques that could be efficiently implemented for current models of quantum computation, particularly in instances where classical verification is not tractable. However, there are proposals for efficient verification procedures when a set of parameters defining the final result of the simulation is known. The experimental simulation demonstrated partial success in comparison with an ideal quantum simulation. From the results it is apparent that better coherence times, better reliability and finer control are as decisive for the advancement of quantum computing power as the more-publicized number of qubits of a given device.
Quantum simulation is one of the most relevant applications of quantum computation for the near future, due to its scientific impact and also because quantum simulation algorithms are typically less demanding than generalized quantum computations. Ultimately, the success of a quantum simulation depends on the amount and reliability of information one is able to extract from the results. In such a context, this work reviews the theory behind quantum simulation, with a focus on digital quantum simulation. The concepts of efficiency and reliability in quantum simulations are discussed, particularly for implementations of digital simulation algorithms in state-of-the-art quantum computers. A review of approaches for quantum characterization, verification and validation techniques (QCVV) is also presented. A digital quantum simulation of the Schrödinger equation for a single particle in 1 spatial dimension was experimentally implemented and analyzed, along with a quantum state tomography procedure for characterization of the final quantum state and evaluation of simulation reliability. From the literature, it is shown that digital quantum simulation is theoretically sound and experimentally feasible, with several applications in a wide range of physics-related fields. Nonetheless, a number of conditions arise that must be observed for a truly efficient implementation of a digital quantum simulation, from theoretical conception to experimental circuit design. The review of QCVV techniques highlights the need for characterization and validation techniques that could be efficiently implemented for current models of quantum computation, particularly in instances where classical verification is not tractable. However, there are proposals for efficient verification procedures when a set of parameters defining the final result of the simulation is known. The experimental simulation demonstrated partial success in comparison with an ideal quantum simulation. From the results it is apparent that better coherence times, better reliability and finer control are as decisive for the advancement of quantum computing power as the more-publicized number of qubits of a given device.
Rapid progress in quantum technology has transformed quantum computing and quantum information science from theoretical possibilities into tangible engineering challenges. Breakthroughs in quantum algorithms, quantum simulations, and quantum error correction are bringing useful quantum computation closer to fruition. These remarkable achievements have been facilitated by advances in quantum characterization, verification, and validation (QCVV). QCVV methods and protocols enable scientists and engineers to scrutinize, understand, and enhance the performance of quantum information-processing devices. In this tutorial, we review the fundamental principles underpinning QCVV, and introduce a diverse array of QCVV tools used by quantum researchers. We define and explain QCVV’s core models and concepts—quantum states, measurements, and processes—and illustrate how these building blocks are leveraged to examine a target system or operation. We survey and introduce protocols ranging from simple qubit characterization to advanced benchmarking methods. Along the way, we provide illustrated examples and detailed descriptions of the protocols, highlight the advantages and disadvantages of each, and discuss their potential scalability to future large-scale quantum computers. This tutorial serves as a guidebook for researchers unfamiliar with the benchmarking and characterization of quantum computers, and also as a detailed reference for experienced practitioners.
Quantum characterization, verification, and validation (QCVV) is a set of techniques to probe, describe, and assess the behavior of quantum bits (qubits), quantum information-processing registers, and quantum computers. QCVV protocols probe and describe the effects of unwanted decoherence so that it can be eliminated or mitigated. They can be usefully divided into characterization techniques that estimate predictive models for a device's behavior from data, and benchmarking techniques that assess overall performance of a device. In this introductory article, we briefly summarize the history of QCVV, introduce the mathematical models and metrics upon which it relies, and then summarize the foundational fields of tomography, randomized benchmarking, and holistic benchmarks. We conclude with brief descriptions of (and references to) advanced topics including gate set tomography, phase estimation, Pauli noise learning, characterization of mid-circuit measurements and non-Markovianity, classical shadows, verification and certification, and logical qubit assessment.
Quantum computing is an emerging technology that has the potential to change the perspectives and applications of computing in general. A wide range of applications are enabled: from faster algorithmic solutions of classically still difficult problems to theoretically more secure communication protocols. A quantum computer uses the quantum mechanical effects of particles or particle-like systems, and a major similarity between quantum and classical computers consists of both being abstracted as information processing machines. Whereas a classical computer operates on classical digital information, the quantum computer processes quantum information, which shares similarities with analog signals. One of the central differences between the two types of information is that classical information is more fault-tolerant when compared to its quantum counterpart. Faults are the result of the quantum systems being interfered by external noise, but during the last decades quantum error correction codes (QECC) were proposed as methods to reduce the effect of noise. Reliable quantum circuits are the result of designing circuits that operate directly on encoded quantum information, but the circuit’s reliability is also increased by supplemental redundancies, such as sub-circuit repetitions. Reliable quantum circuits have not been widely used, and one of the major obstacles is their vast associated resource overhead, but recent quantum computing architectures show promising scalabilities. Consequently the number of particles used for computing can be more easily increased, and that the classical control hardware (inherent for quantum computation) is also more reliable. Reliable quantum circuits haev been investigated for almost as long as general quantum computing, but their limited adoption (until recently) has not generated enough interest into their systematic design. The continuously increasing practical relevance of reliability motivates the present thesis to investigate some of the first answers to questions related to the background and the methods forming a reliable quantum circuit design stack. The specifics of quantum circuits are analysed from two perspectives: their probabilistic behaviour and their topological properties when a particular class of QECCs are used. The quantum phenomena, such as entanglement and superposition, are the computational resources used for designing quantum circuits. The discrete nature of classical information is missing for quantum information. An arbitrary quantum system can be in an infinite number of states, which are linear combinations of an exponential number of basis states. Any nontrivial linear combination of more than one basis states is called a state superposition. The effect of superpositions becomes evident when the state of the system is inferred (measured), as measurements are probabilistic with respect to their output: a nontrivial state superposition will collapse to one of the component basis states, and the measurement result is known exactly only after the measurement. A quantum system is, in general, composed from identical subsystems, meaning that a quantum computer (the complete system) operates on multiple similar particles (subsystems). Entanglement expresses the impossibility of separating the state of the subsystems from the state of the complete system: the nontrivial interactions between the subsystems result into a single indivisible state. Entanglement is an additional source of probabilistic behaviour: by measuring the state of a subsystem, the states of the unmeasured subsystems will probabilistically collapse to states from a well defined set of possible states. Superposition and entanglement are the building blocks of quantum information teleportation protocols, which in turn are used in state-of-the-art fault-tolerant quantum computing architectures. Information teleportation implies that the state of a subsystem is moved to a second subsystem without copying any information during the process. The probabilistic approach towards the design of quantum circuits is initiated by the extension of classical test and diagnosis methods. Quantum circuits are modelled similarly to classical circuits by defining gate-lists, and missing quantum gates are modelled by the single missing gate fault. The probabilistic approaches towards quantum circuits are facilitated by comparing these to stochastic circuits, which are a particular type of classical digital circuits. Stochastic circuits can be considered an emulation of analogue computing using digital components. A first proposed design method, based on the direct comparison, is the simulation of quantum circuits using stochastic circuits by mapping each quantum gate to a stochastic computing sub-circuit. The resulting stochastic circuit is compiled and simulated on FPGAs. The obtained results are encouraging and illustrate the capabilities of the proposed simulation technique. However, the exponential number of possible quantum basis states was translated into an exponential number of stochastic computing elements. A second contribution of the thesis is the proposal of test and diagnosis methods for both stochastic and quantum circuits. Existing verification (tomographic) methods of quantum circuits were targeting the reconstruction of the gate-lists. The repeated execution of the quantum circuit was followed by different but specific measurement at the circuit outputs. The similarities between stochastic and quantum circuits motivated the proposal of test and diagnosis methods that use a restricted set of measurement types, which minimise the number of circuit executions. The obtained simulation results show that the proposed validation methods improve the feasibility of quantum circuit tomography for small and medium size circuits. A third contribution of the thesis is the algorithmic formalisation of a problem encountered in teleportation-based quantum computing architectures. The teleportation results are probabilistic and require corrections represented as quantum gates from a particular set. However, there are known commutation properties of these gates with the gates used in the circuit. The corrections are not applied as dynamic gate insertions (during the circuit’s execution) into the gate-lists, but their effect is tracked through the circuit, and the corrections are applied only at circuit outputs. The simulation results show that the algorithmic solution is applicable for very large quantum circuits. Topological quantum computing (TQC) is based on a class of fault-tolerant quantum circuits that use the surface code as the underlying QECC. Quantum information is encoded in lattice-like structures and error protection is enabled by the topological properties of the lattice. The 3D structure of the lattice allows TQC computations to be visualised similarly to knot diagrams. Logical information is abstracted as strands and strand interactions (braids) represent logical quantum gates. Therefore, TQC circuits are abstracted using a geometrical description, which allows circuit input-output transformations (correlations) to be represented as geometric sub-structures. TQC design methods were not investigated prior to this work, and the thesis introduces the topological computational model by first analysing the necessary concepts. The proposed TQC design stack follows a top-down approach: an arbitrary quantum circuit is decomposed into the TQC supported gate set; the resulting circuit is mapped to a lattice of appropriate dimensions; relevant resulting topological properties are extracted and expressed using graphs and Boolean formulas. Both circuit representations are novel and applicable to TQC circuit synthesis and validation. Moreover, the Boolean formalism is broadened into a formal mechanism for proving circuit correctness. The thesis introduces TQC circuit synthesis, which is based on a novel logical gate geometric description, whose formal correctness is demonstrated. Two synthesis methods are designed, and both use a general planar representation of the circuit. Initial simulation results demonstrate the practicality and performance of the methods. An additional group of proposed design methods solves the problem of automatic correlation construction. The methods use validity criteria which were introduced and analysed beforehand in the thesis. Input-output correlations existing in the circuit are inferred using both the graph and the Boolean representation. The thesis extends the TQC state-of-the-art by recognising the importance of correlations in the validation process: correlation construction is used as a sub-routine for TQC circuit validation. The presented cross-layer validation procedure is useful when investigating both the QECC and the circuit, while a second proposed method is QECC-independent. Both methods are scalable and applicable even to very large circuits. The thesis completes with the analysis of TQC circuit identities, where the developed Boolean formalism is used. The proofs of former known circuit identities were either missing or complex, and the presented approach reduces the length of the proofs and represents a first step towards standardising them. A new identity is developed and detailed during the process of illustrating the known circuit identities. Reliable quantum circuits are a necessity for quantum computing to become reality, and specialised design methods are required to support the quest for scalable quantum computers. This thesis used a twofold approach towards this target: firstly by focusing on the probabilistic behaviour of quantum circuits, and secondly by considering the requirements of a promising quantum computing architecture, namely TQC. Both approaches resulted in a set of design methods enabling the investigation of reliable quantum circuits. The thesis contributes with the proposal of a new quantum simulation technique, no
Quantum simulation, as a practical application of noisy quantum computing, has aided the study of exotic quantum matters and the implementation of algorithms that outperform classical approaches. Superconducting qubits, one of the most promising candidates for realizing universal quantum computing, possess state-of-the-art features like easy integration of qubits, long coherence time, and high-fidelity single- and two-qubit gates. These characteristics have enabled applications of digital quantum simulation in the fields of physics, chemistry, and computer science. In this review, we first present the basic concepts of superconducting qubits, quantum gates, and digital quantum simulations. We also explore recent progress in digital quantum simulations using superconducting qubits, especially in relation to quantum chemistry, quantum matters, combinatorial optimization, and quantum machine learning. Finally, we address the current challenges of digital quantum simulation with superconducting qubits, and provide a perspective on the future of the field.
Abstract The past few years have witnessed the concrete and fast spreading of quantum technologies for practical computation and simulation. In particular, quantum computing platforms based on either trapped ions or superconducting qubits have become available for simulations and benchmarking, with up to few tens of qubits that can be reliably initialized, controlled, and measured. The present Review aims at giving a comprehensive outlook on the state‐of‐the‐art capabilities offered from these near‐term noisy devices as universal quantum simulators, that is, programmable quantum computers potentially able to calculate the time evolution of many physical models. First, a pedagogic overview on the basic theoretical background pertaining digital quantum simulations is given, with a focus on hardware‐dependent mapping of spin‐type Hamiltonians into the corresponding quantum circuit as a key initial step toward simulating more complex models. Then, the main experimental achievements obtained in the last decade are reviewed, focusing on the digital quantum simulation of such spin models by employing two leading quantum architectures. Their performances are compared, and future challenges are outlined, also in view of prospective hybrid technologies, towards the ultimate goal of reaching the long‐sought quantum advantage for the simulation of complex many‐body models in the physical sciences.
In this research paper, I have thoroughly described about the topic “study on Verification and Testing Strategies for Quantum Circuits.” The research on quantum circuit verification and testing methodologies examines how to ensure the dependability and functioning of quantum computing systems, which are crucial to their transformational potential. Quantum circuits use superposition and entanglement, which need verification and testing methods. Innovative quantum circuit-specific methodologies are needed since conventional computing methods fail in quantum computing. A major research area is simulation-based verification, which compares simulated quantum circuit outputs to genuine hardware implementations. Developers may identify circuit design or implementation problems by comparing simulated and predicted results, enabling incremental improvement. Randomized benchmarking procedures may also evaluate quantum circuit integrity and error rates. These protocols quantify operational features of circuits by submitting them to randomized operations and evaluating their performance against preset benchmarks, leading attempts to enhance reliability and performance. Fault-tolerant methods, such as error correction codes, reduce quantum hardware noise and mistakes, improving quantum circuit reliability. The incorporation of error correcting techniques makes quantum circuits more resilient to environmental perturbations, making them more practical. Advanced quantum metrology and characterization methods provide accurate measurement and characterization of quantum systems, making quantum circuit testing and validation easier. These approaches help identify circuit performance improvements by correctly characterizing quantum features and behavior. This research integrates simulation-based verification, randomized benchmarking procedures, fault-tolerant approaches, and quantum metrology to ensure quantum circuit functioning and dependability. This research advances quantum technologies and realizes their transformative potential in cryptography, materials science, and other fields by explaining verification and testing strategies tailored to quantum computing systems