This chapter points out the limitations in simulating quantum systems in classical computers. It describes the various stages of quantum simulation using quantum computers and relevant quantum circuits. Quantum simulators are classified into two types: analog quantum simulators and digital quantum simulators. In an analog quantum simulator the physical properties of a targeted model are reproduced on a physical set-up under externally controlled conditions. Quantum simulation will be considered successful only if the initial state preparation, the implementation of the time evolution and the measurements of observables are realized using only polynomial resources. The chapter discusses the quantum circuits for measurement of the dynamical correlation functions and the spectrum of the Hermitian operators. Computing the time evolution operator is equivalent to the task of implementing a unitary matrix and any unitary transformation can be done in a quantum computer using a universal set of quantum gates.
This chapter points out the limitations in simulating quantum systems in classical computers. It describes the various stages of quantum simulation using quantum computers and relevant quantum circuits. Quantum simulators are classified into two types: analog quantum simulators and digital quantum simulators. In an analog quantum simulator the physical properties of a targeted model are reproduced on a physical set-up under externally controlled conditions. Quantum simulation will be considered successful only if the initial state preparation, the implementation of the time evolution and the measurements of observables are realized using only polynomial resources. The chapter discusses the quantum circuits for measurement of the dynamical correlation functions and the spectrum of the Hermitian operators. Computing the time evolution operator is equivalent to the task of implementing a unitary matrix and any unitary transformation can be done in a quantum computer using a universal set of quantum gates.
This chapter introduces the basic principles of quantum computation. We shall adhere to the quantum circuit model of computation, with which it is easy to work and which is close to physical implementations. We shall not discuss the more abstract quantum Turing machine model, which, however, has been shown to be equivalent to the circuit model. The elementary unit of quantum information and the basic building block of quantum computation is the qubit, a two-level quantum system that can be prepared, manipulated and measured in a controlled way. A quantum computer can be seen as a collection of n qubits and therefore its wave function resides in a 2 n -dimensional complex Hilbert space. As far as coupling to the environment may be neglected, its evolution in time is unitary and governed by the Schrödinger equation. A quantum computation is composed of three basic steps: preparation of the input state, implementation of the desired unitary transformation acting on this state and measurement of the output state. The output of the measurement process is inherently probabilistic and the probabilities of the different possible outputs are set by the basic postulates of quantum mechanics. Therefore, in a quantum algorithm we must, in general, repeat several times the algorithm to obtain the correct solution of our problem with probability as close to one as desired. In this sense, quantum algorithms are analogous to classical probabilistic algorithms. However, the superposition principle and quantum entanglement open up new possibilities for computation. Quantum computers are potentially more powerful than classical (deterministic or probabilistic) computers due to quantum interference and entanglement. We show that, analogously to classical computation, there exists a small set of gates that are universal, that is, any unitary transformation can be decomposed into a sequence of these gates. We then discuss the implementation of the basic Boolean functions and arithmetic operations on a quantum computer.
This chapter introduces the basic concepts of digital quantum simulation. The study of the computational complexity of problems in quantum simulation helps us better understand how quantum computers can surpass classical computers. The chapter briefly summarizes a few important examples of complexity classes of decision problems. Quantum algorithms are procedures for applying elementary quantum logic gates to complete certain unitary transformations of the input state. The steps involved in carrying out a digital quantum simulation consist of three parts: state preparation, time evolution, and measurement of observables. The chapter provides an overview of state preparation and simulation of time evolution. The use of Suzuki–Trotter formulas in quantum simulation for time-independent sparse Hamiltonians is reviewed. The chapter reviews a method to effect nondestructive measurements of constants of the motion within the adiabatic model.
Quantum Gates and Circuits IntroductionQuantum gates and quantum circuits form the operational core of quantum computation.While earlier chapters focused on the mathematical structure of quantum states and the physical realization of qubits, this chapter addresses how quantum information is manipulated.In classical computing, logic gates such as AND, OR, and NOT operate on bits to implement algorithms.In quantum computing, quantum gates perform analogous roles, but they act on qubits and obey the laws of quantum mechanics [101].Quantum gates differ fundamentally from classical logic gates in several ways.First, quantum gates must be reversible, because the evolution of closed quantum systems is governed by unitary transformations.Second, quantum gates operate on probability amplitudes, not deterministic bit values.Third, quantum gates can generate superposition and entanglement, which have no classical counterparts.These properties allow quantum circuits to exploit interference effects to achieve computational advantages [102].This chapter presents a detailed theoretical discussion of quantum gates and circuits, including both single-qubit and multi-qubit gates.Mathematical representations using unitary matrices are provided, followed by practical implementation using Julia.The chapter concludes with the construction of simple quantum circuits and interpretation of their outputs. Quantum Gates as Unitary OperatorsA quantum gate is mathematically represented by a unitary matrix U acting on a quantum-state vector | : 10.
Quantum circuits If the state of a quantum system is a kind of information, then the dynamics of that system is a kind of information processing. This is the basic idea behind quantum computing , which seeks to exploit the physics of quantum systems to do useful information processing. In this chapter we will acquaint ourselves with a few of the ideas of quantum computing, using the idealized quantum circuit model. Then we will turn our attention to an actual quantum process, nuclear magnetic resonance , that can be understood as a realization of quantum information processing. In a quantum circuit, we have a set of n qubit systems whose dynamical evolution is completely under our control. We represent the evolution as a sequence of unitary operators, each of which acts on one or more of the qubits. Graphically, we represent the qubits as a set of horizontal lines, and the various stages of their evolution as a series of boxes or other symbols showing the structure of the sequence of operations. In such a diagram, time runs from left to right (see Fig. 18.1.). The n qubits form a kind of “computer,” and its overall evolution amounts to a “computation.” The key idea is that very complicated unitary operations on the n qubits can be built up step-by-step from many simple operations on one, two or a few qubits.
Quantum circuits—built from local unitary gates and local measurements—are a new playground for quantum many-body physics and a tractable setting to explore universal collective phenomena far from equilibrium. These models have shed light on longstanding questions about thermalization and chaos, and on the underlying universal dynamics of quantum information and entanglement. In addition, such models generate new sets of questions and give rise to phenomena with no traditional analog, such as dynamical phase transitions in quantum systems that are monitored by an external observer. Quantum circuit dynamics is also topical in view of experimental progress in building digital quantum simulators that allow control of precisely these ingredients. Randomness in the circuit elements allows a high level of theoretical control, with a key theme being mappings between real-time quantum dynamics and effective classical lattice models or dynamical processes. Many of the universal phenomena that can be identified in this tractable setting apply to much wider classes of more structured many-body dynamics.
Recent publications have introduced the concept of quantum-like (QL) bits, along with their associated QL-states and QL-gate operations, emerging from the dynamics of complex synchronized networks. The present work builds on this framework to present a simulation of quantum dynamics in spin systems. We focus on the transverse field Ising model, a widely studied Hamiltonian for interacting spin systems. We show how circuits, built using the QL analog of quantum gates, can be used to prepare an arbitrary initial wavepacket and simulate the time evolution of the resulting state for extracting physical observables such as magnetization. Beyond the statevector dynamics, we introduce a set of metrics that characterize how QL-circuit operations transform the underlying graph connections. These metrics quantify the microscopic coupling, phase coherence, and effective inter-block coupling generated by the circuit. These graph-level quantities provide constraints and design targets for potential physical implementations, indicating where interconnection resources, phase control, and effective coupling strength must be engineered in a hardware realization. Overall, this study demonstrates how classical resources can be harnessed to simulate quantum systems and we discuss the advantages and limitations.