The circuit model of quantum computation is reformulated as a multilayer network theory [3] called a Quantum Multiverse Network (QuMvN). The QuMvN formulation allows us to interpret the quantum wave function as a combination of ergodic Markov Chains where each Markov Chain occupies a different layer in the QuMvN structure. Layers of a QuMvN are separable components of the corresponding wave function. Single qubit measurement is defined as a state transition of the Markov Chain that emits either a $0$ or $1$ making each layer of the QuMvN a Discrete Information Source. A message is equivalent to a possible measurement outcome and the message length is the number of qubits. Therefore, the quantum wave function can be treated as a combination of multiple discrete information sources analogous to what Shannon called a "mixed" information source [18]. We show the QuMvN model has significant advantages in the classical simulation of some quantum circuits by implementing quantum gates as edge transformations on the QuMvNs. We implement a quantum virtual machine capable of simulating quantum circuits using the QuMvN model and use our implementation to classically simulate Shor's Algorithm [19]. We present results from multiple simulations of Shor's Algorithm culminating in a $70$ qubit simulation of Shor's Algorithm on a commodity cloud server with $96$ CPUS and $624$GB of RAM. Lastly, the source of quantum speedups is discussed in the context of layers in the QuMvN framework and how randomized algorithms can push the quantum supremacy boundary.
The circuit model of quantum computation is reformulated as a multilayer network theory [3] called a Quantum Multiverse Network (QuMvN). The QuMvN formulation allows us to interpret the quantum wave function as a combination of ergodic Markov Chains where each Markov Chain occupies a different layer in the QuMvN structure. Layers of a QuMvN are separable components of the corresponding wave function. Single qubit measurement is defined as a state transition of the Markov Chain that emits either a 0 or 1 making each layer of the QuMvN a Discrete Information Source. A message is equivalent to a possible measurement outcome and the message length is the number of qubits. Therefore, the quantum wave function can be treated as a combination of multiple discrete information sources analogous to what Shannon called a "mixed" information source [18]. We show the QuMvN model has significant advantages in the classical simulation of some quantum circuits by implementing quantum gates as edge transformations on the QuMvNs. We implement a quantum virtual machine capable of simulating quantum circuits using the QuMvN model and use our implementation to classically simulate Shor's Algorithm [19]. We present results from multiple simulations of Shor's Algorithm culminating in a 70 qubit simulation of Shor's Algorithm on a commodity cloud server with 96 CPUS and 624GB of RAM. Lastly, the source of quantum speedups is discussed in the context of layers in the QuMvN framework and how randomized algorithms can push the quantum supremacy boundary.
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 quantum computing as a new computational paradigm built on superposition, entanglement, interference, and measurement and establishes its relevance to quantum searching and optimization. It first defines the core information primitives—qubits, quantum gates, and quantum circuits—and explains how they enable nonclassical state manipulation compared with deterministic bit-based processing. This chapter then surveys three major models of quantum computation: the gate-based circuit model for algorithmic execution via unitary gate sequences, the measurement-based model using pre-entangled resource states with computation driven by adaptive measurements, and the adiabatic model that encodes solutions in the ground state of a gradually evolved system, aligning naturally with annealing-style optimization. A structured comparison between classical and quantum computing highlights differences in data representation, intrinsic parallelism, scalability constraints, and error behavior and situates quantum supremacy as a task-specific benchmark rather than a universal replacement for classical machines. This chapter connects these foundations to application-critical algorithms, emphasizing Grover’s search and Shor’s factoring as canonical demonstrations of computational advantage. Finally, it motivates the book’s focus by mapping quantum search and optimization to practical domains including database querying, cryptography and post-quantum security, financial risk and fraud analytics, supply-chain logistics, scientific simulation, and emerging workflows such as quantum-assisted drug discovery and routing problems, while noting current hardware limitations and the need for robust error control.
A medium-scale quantum computer with full universal quantum computing capability is necessary for various practical aims and testing applications. Here we report a 34-qubit quantum virtual machine (QtVM) based on a medium server. Our QtVM can run quantum assembly language with graphic interfaces. The QtVM is implemented with single qubit rotation gate, single to multiple controlled NOT gates to realize the universal quantum computation. Remarkably, it can realize a series of basic functions, such as, the "if" conditional programming language based on single-shot projective measurement results, "for" iteration programming language, build in arithmetic calculation. The measurement can be single-shot and arbitrary number of multi-shot types. In addition, there is in principle no limitation on number of logic gates implemented for quantum computation. By using QtVM, we demonstrate the simulation of dynamical quantum phase transition of transverse field Ising model by quantum circuits, where 34 qubits with one million gates are realized. We also show the realization of programmable Shor algorithm for factoring 15 and 35.
In the preceding chapter we established that a suitable set of quantum gates, complemented by quantum error correction, allows us to produce a desired multiqubit unitary transformation. This transformation is one of the three steps in a quantum computation; the others, of course, are the preparation of the qubits in their initial state and the measurement of them after the transformation has been implemented. A quantum computation is designed to solve a problem or class of problems. The power of quantum computers is that they can do this, at least for some problems, very much more efficiently and quickly than any conventional computer based on classical logic operations. If we can build a quantum computer then a number of important problems which are currently intractable will become solvable. The potential for greatly enhanced computational power is, in itself, reason enough to study quantum computers, but there is another. Moore’s law is the observation that the number of transistors on a chip doubles roughly every eighteen months. A simple corollary is that computer performance also doubles on the same timescale. Associated with this exponential improvement is a dramatic reduction in the size of individual components. If the pace is to be kept up then it is inevitable that quantum effects will become increasingly important and ultimately will limit the operation of the computer. In these circumstances it is sensible to consider the possibility of harnessing quantum effects to realize quantum information processors and computers. We start with a brief introduction to the theory of computer science, the principles of which underlie the operation of what we shall refer to as classical computers. These include all existing machines and any based on the manipulation of classical bits. The development of computer science owes much to Turing, who devised a simple but powerful model of a computing device: the Turing machine. It its most elementary form, this consists of four elements. (i) A tape for data storage, which acts as a memory. This tape has a sequence of spaces, each of which has on it one of a finite set of symbols. (ii) A processor, which controls the operations of the machine.
Quantum algorithms present a quadratically improved complexity over classical ones for certain sampling tasks. For instance, the Quantum Amplitude Estimation (QAE) algorithm promises to speed up the estimation of the mean of certain functions, given access to the quantum state corresponding to the probability distribution to be sampled from. Classically, samples are often obtained by simulating a Markov chain. In this work, we experimentally use encodings of Markov chains to prepare quantum states and run a quantum Markov Chain Monte Carlo (qMCMC) algorithm on Quantinuum System Model H2 and Quantinuum Helios quantum computers. We first demonstrate that it is possible to obtain accurate results by operating directly on the physical qubits. Crucially, to pave the way toward fault-tolerant execution, we also implement these algorithms using logical qubits protected by the Iceberg Quantum Error Detection (QED) code. By applying multiple rounds of mid-circuit QED during a random walk, we successfully catch and filter out hardware errors. These experiments demonstrate the feasibility of qMCMC on quantum hardware, bringing us closer to realizing quadratic quantum speedups with broad applications ranging from molecular modeling to machine learning and finance.
The approach we considered so far for computing using quantum mechanics relies on preparing a suitable initial state, applying single and two-qubit quantum gates, and performing measurements. It is known as the circuit model of quantum computing. Howeveer, this is not the only approach. In this chapter, we will cover a few alternatives. Some still rely on circuits to some extend, but they either explore alternative paradigms of fault tolerance, utilize protocols that do not require entangling gates, or avoid multi-shot computations. One of these alternative approaches is entirely based on measurements. Another requires fine tunning gates and repeating measurments.