2. Quantum Information and Computational Models

Introduction and Context

Quantum computing begins with a change in the unit of information. Classical information is represented by bits whose states are conventionally denoted 0 and 1. Quantum information is represented by physical systems governed by quantum mechanics. The elementary unit, the qubit, can occupy a coherent superposition of basis states and can become entangled with other qubits. These properties do not simply make quantum computers faster versions of classical computers. They establish a different computational model, with different resources, limitations, algorithms, error mechanisms, and notions of information.

The distinction is foundational for doctoral study. A quantum algorithm is not valuable merely because it uses superposition; its computational advantage depends on how amplitudes interfere, how entanglement is structured, and how the final measurement extracts useful information. Similarly, a quantum circuit is not only a sequence of abstract gates. It is a mathematical description of physical transformations that must ultimately be implemented through control pulses, measurement devices, error-correction procedures, and an architecture with finite connectivity.

This chapter develops the principal language of quantum information and introduces the major models of quantum computation. It moves from state representation and elementary gates to no-cloning, teleportation, superdense coding, information measures, universality, and reversible computation. It then compares circuit-based, adiabatic, measurement-based, and topological approaches. The emphasis is both conceptual and analytical: the reader should understand what each model assumes, what computational resource it exploits, and what limitations affect its practical use.

Learning Objectives

By the end of this chapter, the reader should be able to:

1. Represent pure and mixed qubit states using vectors, density operators, and Bloch-sphere coordinates.

2. Explain the action of common quantum gates and construct simple quantum circuits.

3. Analyze measurement, entanglement, no-cloning, teleportation, and superdense coding.

4. Relate von Neumann entropy, measurement outcomes, and information capacity to quantum states.

5. Distinguish universality from computational efficiency and explain the role of reversible computation.

6. Compare circuit, adiabatic, measurement-based, and topological computational models.

7. Evaluate practical, technical, ethical, and research implications of quantum information systems.

The Qubit as a Physical and Mathematical Object

A computational qubit has two orthonormal basis states, written |0⟩ and |1⟩. A pure state is

|ψ⟩ = α|0⟩ + β|1⟩,

where α and β are complex probability amplitudes satisfying |α|² + |β|² = 1. Measurement in the computational basis produces 0 with probability |α|² and 1 with probability |β|². The amplitudes, rather than the probabilities alone, are central because their relative phase determines interference.

A global phase has no observable effect: |ψ⟩ and e^{iγ}|ψ⟩ describe the same physical state. A relative phase does matter. For example, the states (|0⟩ + |1⟩)/√2 and (|0⟩ − |1⟩)/√2 produce identical computational-basis probabilities, but they behave differently under subsequent gates. This distinction is a frequent source of error in introductory reasoning: equal measurement probabilities do not imply equivalent quantum states.

For n qubits, the computational basis contains 2^n states. A general pure state is

|ψ⟩ = Σ_x α_x|x⟩,

where x ranges over n-bit strings and Σ_x |α_x|² = 1. The state vector has exponentially many amplitudes, but this fact alone does not imply exponential computational power. Efficiently preparing, manipulating, and measuring those amplitudes is the substantive problem.

A state is separable when it can be written as a tensor product of subsystem states. If it cannot be written in that form, it is entangled. The Bell state

|Φ⁺⟩ = (|00⟩ + |11⟩)/√2

is entangled. Measuring either qubit in the computational basis gives a random result, but the two results are perfectly correlated. Entanglement is not equivalent to ordinary classical correlation: it concerns the structure of a joint quantum state and can persist across choices of measurement basis in ways that cannot be reproduced by a classical shared random variable under suitable experiments.

Density Operators and Mixed States

Not every quantum state is known as a definite state vector. A statistical mixture is represented by a density operator

ρ = Σ_i p_i |ψ_i⟩⟨ψ_i|,

where p_i ≥ 0 and Σ_i p_i = 1. A pure state satisfies ρ² = ρ and Tr(ρ²) = 1; a genuinely mixed state has Tr(ρ²) < 1. Density operators are indispensable for describing thermal noise, imperfect preparation, ignored environments, and subsystems of entangled states.

The probability of an outcome associated with a projector P is given by the Born rule, p = Tr(Pρ). More generally, a quantum measurement can be represented by positive operator-valued measure elements {E_m}, satisfying Σ_m E_m = I, with p(m) = Tr(E_mρ). This formalism allows the treatment of generalized measurements, noisy detectors, and quantum communication protocols.

The Bloch Sphere

Every single-qubit density operator can be written as

ρ = 1/2(I + r_xX + r_yY + r_zZ) = 1/2(I + r·σ),

where X, Y, and Z are Pauli matrices and r is a real three-dimensional Bloch vector. Pure states lie on the unit sphere, while mixed states lie inside it. The poles represent |0⟩ and |1⟩; points on the equator represent equal-weight superpositions with different relative phases.

Unitary single-qubit operations rotate the Bloch vector. This geometric picture is useful for visualizing state preparation, phase changes, and control errors. It also clarifies that a general physical noise process need not be a simple rotation: depolarization contracts the vector toward the center, while dephasing reduces transverse components and preserves, approximately, the computational-basis populations.

Gates, Circuits, and Interference

A closed quantum evolution is represented by a unitary operator U satisfying U†U = I. Unitarity preserves inner products and therefore preserves total probability. Common single-qubit gates include:

• The Pauli-X gate, which exchanges |0⟩ and |1⟩ and functions as a quantum NOT operation.
• The Pauli-Z gate, which leaves |0⟩ unchanged and adds a minus sign to |1⟩.
• The Pauli-Y gate, combining bit and phase changes with complex factors.
• The Hadamard gate H, which maps |0⟩ to (|0⟩ + |1⟩)/√2 and |1⟩ to (|0⟩ − |1⟩)/√2.
• Phase gates, which change relative phase without necessarily changing computational-basis probabilities.

A controlled-NOT gate, or CNOT, flips a target qubit if and only if a control qubit is |1⟩. Acting on |+⟩|0⟩, where |+⟩ = (|0⟩ + |1⟩)/√2, the sequence CNOT(H⊗I) applied to |00⟩ produces |Φ⁺⟩. This compact circuit illustrates how a product state can become entangled.

A quantum circuit is a composition of gates followed by measurements. Gates may operate on one or several qubits, and circuit depth is often more significant than gate count because errors accumulate during prolonged execution. Hardware connectivity also matters: if two logical qubits are not physically adjacent, additional routing operations may be required.

The computational significance of interference can be seen in HZH = X and HXH = Z. A phase that is invisible in one measurement basis can become a measurable population difference after a basis-changing operation. Quantum algorithms are therefore designed not merely to create many amplitudes but to amplify amplitudes of desirable outcomes and cancel undesirable ones.

No-Cloning, Teleportation, and Superdense Coding

The No-Cloning Principle

There is no physical operation that can copy every unknown quantum state. Suppose a unitary U copied arbitrary states using a blank register:

U(|ψ⟩|0⟩) = |ψ⟩|ψ⟩.

For two states |ψ⟩ and |φ⟩, preservation of inner products would require

⟨ψ|φ⟩ = (⟨ψ|φ⟩)².

This holds generally only for identical or orthogonal states, not for arbitrary nonorthogonal states. The no-cloning theorem protects quantum cryptographic protocols from unrestricted interception and explains why quantum error correction cannot simply duplicate a qubit. Error correction instead encodes information into entangled states and measures syndromes without directly revealing the logical state.

Quantum Teleportation

Quantum teleportation transfers an unknown state using a shared entangled pair, two classical bits, and a measurement. The sender combines the unknown state with her half of a Bell pair, applies a CNOT and a Hadamard, and measures two qubits. The two classical outcomes identify one of four Pauli corrections that the receiver applies to the remaining qubit.

Teleportation does not transport matter or transmit information faster than light. The receiver cannot reconstruct the state before receiving the classical measurement results. It also does not violate no-cloning: the sender’s original state is destroyed by measurement, while the receiver obtains the state only after a conditional correction. The protocol demonstrates the operational value of entanglement as a resource for communication and distributed quantum computation.

Superdense Coding

Superdense coding reverses the resource relationship. If two parties share a Bell pair, one party can encode two classical bits by applying one of four operations—typically I, X, Z, or XZ—to her qubit and then sending that single qubit to the other party. A Bell-basis measurement identifies the two-bit message. Thus one transmitted qubit, supplemented by one pre-shared entangled pair, can convey two classical bits. The protocol does not create information from nothing; the entanglement was established as a prior resource.

Information Measures and Quantum Capacity

Classical uncertainty is measured by Shannon entropy:

H(X) = −Σ_x p(x) log₂ p(x).

For a quantum state, the corresponding von Neumann entropy is

S(ρ) = −Tr(ρ log₂ρ).

If the eigenvalues of ρ are λ_i, then S(ρ) = −Σ_i λ_i log₂λ_i. A pure state has zero von Neumann entropy, although measurement outcomes in a selected basis may be random. This distinction is important: entropy of the state concerns the density operator, whereas uncertainty in a particular measurement concerns the chosen measurement distribution.

For a maximally mixed qubit, ρ = I/2, the entropy is one bit. For a maximally entangled two-qubit pure state, the joint entropy is zero, but each individual qubit has entropy one. The subsystems are locally maximally uncertain while the joint state is perfectly specified. This is one reason classical intuition about entropy and correlation must be applied carefully.

The quantum mutual information of a bipartite state ρ_AB is

I(A:B) = S(ρ_A) + S(ρ_B) − S(ρ_AB),

where reduced states are obtained by partial trace. Mutual information quantifies total correlations, including classical and quantum contributions. Other measures, such as coherent information and entanglement entropy, become important in quantum communication and fault-tolerant computing.

Quantum information theory also distinguishes accessible information from the full mathematical description of a state. A qubit may encode continuous parameters in amplitudes, but a single measurement yields limited classical data. Consequently, exponential state-space dimension should not be confused with the ability to read out exponentially many independent classical values.

Reversibility, Universality, and Computational Power

Classical irreversible operations such as AND and OR lose information: several input combinations map to one output. A physically reversible computation must be one-to-one. The Toffoli gate, a controlled-controlled-NOT, is universal for reversible classical computation. It can simulate ordinary logic when ancillary bits are supplied and later returned or managed appropriately.

Quantum evolution between measurements is reversible because it is unitary. Quantum circuits can nevertheless implement irreversible algorithms by introducing ancillas, storing intermediate information, and measuring or discarding systems at the end. Reversibility has thermodynamic significance: logically irreversible erasure is associated with a minimum heat dissipation in idealized settings, commonly expressed through Landauer’s principle.

A gate set is universal if arbitrary unitary transformations can be approximated to desired accuracy using finite circuits over that set. A typical universal arrangement combines arbitrary single-qubit operations with an entangling two-qubit gate such as CNOT. In practical fault-tolerant computation, one often uses a finite discrete universal set, such as Clifford gates together with a non-Clifford gate. Universality does not guarantee efficient compilation. The number of gates, approximation accuracy, connectivity, error correction, and classical control overhead determine practical usefulness.

The Gottesman–Knill result illustrates this distinction. Circuits composed only of stabilizer operations can be simulated efficiently classically under specified conditions, despite involving entanglement. A source of quantum advantage generally requires resources beyond efficiently simulable structure, often including non-Clifford operations, carefully engineered interference, or problem-specific mathematical structure.

Four Computational Models

The Gate or Circuit Model

The circuit model expresses computation as a sequence of initialized qubits, unitary gates, measurements, and classical feed-forward. It is the dominant abstraction for quantum algorithms such as factoring, amplitude amplification, phase estimation, and variational methods. Its strengths are modularity, a clear programming model, and compatibility with compiler technology and error-correction theory.

Its practical weaknesses include decoherence, imperfect gates, measurement latency, limited qubit connectivity, and the enormous overhead of fault tolerance. Circuit complexity must therefore be assessed at several levels: logical gate count, circuit depth, T-count or other costly-gate measures, physical gate count, and space-time volume.

Adiabatic and Annealing Models

Adiabatic quantum computation begins with a Hamiltonian H_0 whose ground state is easy to prepare and gradually changes it into a problem Hamiltonian H_1. If the evolution is sufficiently slow relative to the relevant spectral gap, the system remains near its instantaneous ground state. The final state can encode a solution to an optimization problem.

Quantum annealing is related but often allows open-system dynamics, thermal transitions, and heuristic schedules rather than satisfying the strict conditions of the adiabatic theorem. These distinctions matter when comparing theoretical universality with commercial optimization devices. Small spectral gaps can require very long evolution, and noise may assist or obstruct transitions. The quality of an annealing result must therefore be evaluated against classical baselines, embedding overhead, parameter sensitivity, and reproducibility.

Measurement-Based Quantum Computation

In measurement-based, or one-way, computation, a highly entangled resource state—often a cluster state—is prepared first. Computation proceeds through adaptive single-qubit measurements. Measurement outcomes are random, but later measurement bases are adjusted through classical feed-forward so that the intended logical transformation is realized up to known corrections.

This model separates resource preparation from computation and can be advantageous in photonic systems, where measurements are comparatively natural. It also provides a powerful theoretical framework for studying entanglement as a computational resource. The cost of preparing a sufficiently large and fault-tolerant resource state, however, is substantial.

Topological Quantum Computation

Topological approaches encode information in nonlocal degrees of freedom associated with exotic quasiparticles or protected states. Logical operations arise from braiding or other topology-sensitive processes, making them less sensitive to certain local perturbations. In the idealized anyon model, the history of exchanges rather than microscopic path details determines the transformation.

Topological protection is not absolute. Real devices must create, manipulate, distinguish, and measure suitable excitations while controlling disorder and thermal effects. Moreover, not every set of anyons supports a computationally universal braid group; additional operations or magic-state techniques may be required. The model is therefore promising because of its error-resilience architecture, but it remains experimentally demanding.

An Illustrative Case: Choosing a Model for Quantum Optimization

Background

Consider a fictional logistics company, Meridian Freight, seeking to reduce vehicle-routing costs across a network of depots. The optimization contains binary assignment variables, capacity constraints, time windows, and penalties for missed deliveries. Management proposes using a quantum annealer because the problem can be expressed in a quadratic unconstrained binary optimization form.

Situation and Analysis

The research team first observes that the mathematical encoding is not itself evidence of quantum advantage. Constraints must be converted into penalty terms, and the resulting coefficients may have a large dynamic range. Mapping the logical variables onto hardware may require chains of physical qubits, increasing vulnerability to noise. The team also identifies a classical mixed-integer solver and a hybrid decomposition method as credible baselines.

The problem is then analyzed at three levels. At the formulation level, penalties must be large enough to discourage violations but not so large that the objective becomes numerically ill-conditioned. At the hardware level, embedding size, chain break frequency, calibration drift, and annealing schedule are measured. At the organizational level, the value of a solution depends on delivery savings, integration cost, explainability, and operational reliability.

Approach and Outcome

Meridian conducts a controlled benchmark using identical instances, time budgets, and quality metrics. A hybrid quantum-classical workflow generates candidate solutions, while classical local search repairs constraint violations and improves feasible routes. The quantum device performs competitively on selected small and structured instances, but the classical solver remains stronger on the full operational workload. The company therefore adopts the hybrid workflow for experimentation rather than replacing its classical optimization platform.

Learning Points

The case illustrates four principles. First, computational model selection must follow problem structure rather than technological enthusiasm. Second, encoding and data movement can dominate theoretical algorithmic benefits. Third, a quantum component may be useful as a heuristic or subroutine without delivering asymptotic speedup. Fourth, credible evaluation requires reproducible baselines, feasibility checks, cost accounting, and domain-specific outcomes.

Limitations, Risks, and Common Errors

A common conceptual mistake is to treat superposition as parallel classical computation whose results can all be read out. Measurement prevents such unrestricted extraction. Another mistake is to regard entanglement as sufficient for speedup; entanglement can occur in efficiently simulable circuits and must be combined with an algorithmic mechanism for useful interference.

Physical implementations face decoherence, leakage outside the computational subspace, control crosstalk, calibration drift, measurement error, and correlated noise. Error correction can suppress logical errors only when physical error rates, code distance, decoding, and resource overhead satisfy demanding conditions. A model that is elegant mathematically may be difficult to scale technologically.

Quantum protocols also create security and governance risks. Quantum communication does not automatically secure endpoints, classical authentication, software, or key-management infrastructure. Quantum computing research has implications for current public-key cryptography, particularly through algorithms that threaten factoring- and discrete-logarithm-based systems at sufficient scale. Organizations should therefore consider cryptographic inventory, migration planning, and post-quantum alternatives without claiming that present-day quantum devices can break deployed systems universally.

Research claims require methodological discipline. Reported speedups should specify instance distributions, preprocessing, compilation, error mitigation, hardware access time, classical overhead, and baseline quality. Comparisons that omit these factors can confuse a narrow benchmark advantage with a general computational advantage.

Professional and Ethical Considerations

Quantum technologies are dual-use. They may improve scientific simulation, materials design, logistics, and secure communication, but they may also affect surveillance, cryptanalysis, military planning, and concentration of technological power. Researchers should communicate uncertainty, avoid overstating commercial readiness, protect sensitive data, and disclose benchmark conditions.

Governance should include access controls for cloud quantum platforms, audit trails for experiments, reproducible software environments, and responsible handling of cryptographic information. Ethical evaluation should also consider who benefits from quantum infrastructure, whether public claims are evidence-based, and whether scarce research resources are allocated transparently. In doctoral work, mathematical elegance must be accompanied by experimental validity and clear limits of inference.

Current Directions and Best Practices

Current development is increasingly focused on noisy intermediate-scale devices, error mitigation, fault-tolerant architectures, logical qubits, quantum networking, photonic integration, and quantum-classical workflows. Variational algorithms continue to attract attention because they delegate part of the optimization to classical processors, although trainability, barren plateaus, measurement cost, and noise remain serious concerns. Quantum machine learning should be assessed by data-loading cost and statistical benefit, not merely by the presence of a parameterized circuit.

Best practice begins with a precise problem definition and a classical reference implementation. Researchers should select the computational model according to available structure, estimate qubit and depth requirements before hardware deployment, and distinguish logical from physical resources. They should validate state preparation and measurement, document transpilation and error mitigation, use independent repetitions, and report uncertainty. For communication protocols, they should account explicitly for entanglement distribution, classical channels, authentication, and loss. For theoretical claims, they should separate universality, complexity, fault tolerance, and practical advantage rather than treating them as interchangeable.

Chapter Summary

Quantum information replaces classical bits with states whose amplitudes, phases, entanglement, and measurement statistics obey quantum mechanics. Qubits are represented by state vectors or density operators; the Bloch sphere provides a geometric description of single-qubit states. Unitary gates and measurements form circuits in which interference, rather than superposition alone, drives algorithmic behavior.

The no-cloning theorem limits copying of unknown states, while teleportation and superdense coding demonstrate how entanglement supports communication when combined with classical channels or physical transmission. Shannon and von Neumann entropy provide complementary information measures, and mutual information describes correlations. Reversible computation and universal gate sets establish the formal basis for quantum circuits, but universality does not imply efficiency or practical advantage.

Circuit, adiabatic, measurement-based, and topological models organize computation around different physical and informational resources. Each has distinct implementation challenges, overheads, and research prospects. Sound quantum-computing practice requires careful benchmarking, attention to noise and encoding, responsible security analysis, and a clear separation between theoretical possibility and demonstrated utility.

Key Terms

Qubit: The fundamental unit of quantum information, represented by a two-dimensional quantum state.

Superposition: A coherent linear combination of basis states.

Amplitude: A complex coefficient whose squared magnitude determines measurement probability.

Relative phase: The phase difference between components of a superposition, affecting interference.

Density operator: A positive, unit-trace operator representing pure or mixed quantum states.

Bloch sphere: A geometric representation of every single-qubit state.

Unitary operator: A reversible linear transformation preserving inner products and total probability.

Entanglement: A nonseparable structure of a composite quantum state.

Measurement: An interaction that produces classical outcomes according to the Born rule.

No-cloning theorem: The principle that an arbitrary unknown quantum state cannot be perfectly copied.

Quantum teleportation: Transfer of an unknown quantum state using entanglement, classical communication, and conditional correction.

Superdense coding: A protocol that transmits two classical bits through one qubit using shared entanglement.

Von Neumann entropy: S(ρ) = −Tr(ρ log₂ρ), a measure of quantum-state uncertainty.

Quantum mutual information: A measure of total correlation between quantum subsystems.

Reversible computation: Computation in which each output uniquely determines the input.

Universality: The ability of a gate set or model to approximate arbitrary desired computations.

Adiabatic computation: Computation based on slowly evolving a system between Hamiltonian ground states.

Cluster state: A highly entangled resource state used in measurement-based computation.

Topological computation: Computation that encodes information in topology-sensitive degrees of freedom.

Fault tolerance: Techniques that preserve logical computation despite physical errors.

Review Questions

Short Answer Questions

1. Why does relative phase matter even when two states have identical computational-basis measurement probabilities?

2. Distinguish a pure state from a mixed state using the density operator.

3. What information is supplied by the Bloch vector of a qubit?

4. Why does teleportation not violate either no-cloning or relativistic causality?

5. What is the difference between universality and efficient quantum computation?

Long Answer Questions

1. Explain how a Hadamard gate followed by a CNOT gate can generate a Bell state. Discuss the role of interference and entanglement.

2. Derive the no-cloning argument using preservation of inner products and explain its implications for quantum error correction.

3. Compare Shannon entropy and von Neumann entropy, including the entropy of a pure entangled state and its subsystems.

4. Compare circuit, adiabatic, measurement-based, and topological models in terms of resource assumptions, computation mechanism, and practical limitations.

5. Explain reversible computation, the Toffoli gate, universal gate sets, and the difference between logical and physical resource costs.

Analytical / Application Questions

1. A two-qubit state is prepared as (|00⟩ + |11⟩)/√2. Analyze the measurement probabilities, reduced states, joint entropy, and mutual information.

2. Design an evaluation framework for deciding whether a quantum annealing workflow improves a logistics problem. Specify baselines, metrics, hardware factors, and organizational outcomes.

3. A researcher claims that a circuit has a quantum advantage because it contains many entangled qubits. Critically assess the claim using simulability, interference, readout limitations, noise, and benchmarking principles.

22. Multiple Choice Questions with Answers

Question 1

A qubit is prepared in the state (|0⟩ + |1⟩)/√2. What is the probability of obtaining 1 in a computational-basis measurement?

A. 0

B. 1/4

C. 1/2

D. 1

Correct Answer: C. 1/2

Question 2

Which statement correctly distinguishes global and relative phase?

A. Both are always observable in a single-qubit measurement

B. Global phase is unobservable, while relative phase can affect interference

C. Relative phase is unobservable under all gates

D. Global phase changes measurement probabilities directly

Correct Answer: B. Global phase is unobservable, while relative phase can affect interference

Question 3

What operation sequence creates |Φ⁺⟩ = (|00⟩ + |11⟩)/√2 from |00⟩?

A. X on the first qubit, followed by Z

B. H on the first qubit, followed by CNOT with the first as control

C. Z on both qubits, followed by measurement

D. CNOT followed by X on the target

Correct Answer: B. H on the first qubit, followed by CNOT with the first as control

Question 4

Why can an unknown arbitrary quantum state not be copied perfectly?

A. Measurement devices cannot detect amplitudes

B. Unitary evolution cannot preserve inner products under universal copying

C. Quantum states always contain zero information

D. Entangled states cannot be represented mathematically

Correct Answer: B. Unitary evolution cannot preserve inner products under universal copying

Question 5

In quantum teleportation, what is required in addition to a shared entangled pair?

A. Two classical bits and a conditional correction

B. A second copy of the unknown state

C. Superluminal communication

D. A universal cloning gate

Correct Answer: A. Two classical bits and a conditional correction

Question 6

A maximally entangled two-qubit pure state has which entropy pattern?

A. Joint entropy one and each subsystem entropy zero

B. Joint entropy zero and each subsystem entropy one

C. All three entropies are one

D. All three entropies are zero

Correct Answer: B. Joint entropy zero and each subsystem entropy one

Question 7

Which statement about universality is most accurate?

A. A universal set necessarily provides a practical speedup

B. Universality means arbitrary operations can be approximated, but not necessarily efficiently or fault-tolerantly

C. Universality applies only to classical gates

D. A universal set requires no entangling gate

Correct Answer: B. Universality means arbitrary operations can be approximated, but not necessarily efficiently or fault-tolerantly

Question 8

What is the defining computational mechanism of measurement-based quantum computation?

A. Repeated irreversible copying of qubits

B. Adaptive measurements on a prepared entangled resource state

C. Thermal relaxation into a classical bit string

D. Only classical reversible gates

Correct Answer: B. Adaptive measurements on a prepared entangled resource state

Question 9

Why might an adiabatic computation fail to remain in the desired ground state?

A. The system has no Hamiltonian

B. The evolution may be too rapid relative to a small spectral gap

C. Unitary evolution destroys normalization

D. Measurement is performed before initialization

Correct Answer: B. The evolution may be too rapid relative to a small spectral gap

Question 10

Which evidence would most strongly support a practical quantum advantage claim?

A. The circuit contains a large number of qubits alone

B. The device uses superposition without reporting outputs

C. A reproducible comparison against strong classical baselines with equivalent costs and quality metrics

D. The algorithm is described using quantum terminology

Correct Answer: C. A reproducible comparison against strong classical baselines with equivalent costs and quality metrics