What Is Quantum Information?

Short Definition

Quantum information is the study of how information can be represented, transformed, transmitted, protected, measured, and simulated when its physical carrier obeys quantum mechanics. It asks which tasks are possible, which are impossible, how accurately they can be performed, and what physical or computational resources they require.

The subject is broader than quantum computing. It includes:

• communication through quantum channels;
• cryptographic protocols whose security depends on quantum constraints;
• estimation of physical parameters with quantum probes;
• simulation of quantum dynamics;
• error correction and fault-tolerant control;
• tests of correlations, devices, and computational outputs;
• mathematical limits on distinguishability, compression, copying, and information flow.

The phrase quantum information names a field and an operational viewpoint. It does not name a new substance carried by a particle, nor a single universal quantity attached to every quantum state. Entropy, channel capacity, trace distance, Fisher information, entanglement, coherence, and circuit complexity answer different questions. Calling all of them “information” without naming the task conceals the physics.

A useful local description of an information-processing task is

$$\mathsf T = \bigl( \mathcal I,\, \mathcal A,\, \mathcal O,\, \ell \bigr),$$

where $\mathcal I$ specifies the allowed inputs and promises, $\mathcal A$ the allowed physical or logical actions, $\mathcal O$ the required output, and $\ell$ a loss, error, or success criterion. This notation is not a new postulate. It is a reminder that a resource claim is incomplete until the task and comparison class are declared.

For example, the same entangled state may be useful for teleportation under local operations and classical communication, unnecessary for a one-qubit rotation, and too noisy for a fault-tolerant gate. Operational value is contextual.

What Changes When Information Is Quantum?

Quantum information uses ordinary quantum mechanics, but several ordinary information-processing assumptions no longer hold.

A state is not a readable classical label

A classical register can encode a symbol in mutually distinguishable states. An ideal measurement can read the symbol and leave a copy in another register. A quantum preparation may instead be chosen from nonorthogonal states. No measurement can identify arbitrary nonorthogonal alternatives perfectly in one shot.

For pure states $|\psi\rangle$ and $|\phi\rangle$, the overlap

$$\bigl|\langle\psi|\phi\rangle\bigr|$$

therefore has operational meaning. Orthogonal states can be perfectly distinguished; identical rays carry no distinguishable alternative; intermediate overlap implies an unavoidable error or inconclusive outcome. Trace Distance gives the canonical distinguishability metric, while the landing page’s worked state-discrimination anchor shows the optimal equal-prior success probability.

This limitation is not merely detector imperfection. It follows from the geometry of quantum states. The related No-Cloning and No-Signaling theorem page rules out a universal operation that makes perfect copies of arbitrary unknown states. Neither result forbids copying a known state or a set of mutually orthogonal codewords.

Relative phase becomes an operational variable

Consider the qubit family

$$|\psi_\varphi\rangle = \frac{|0\rangle+e^{i\varphi}|1\rangle}{\sqrt2}.$$

A measurement in the computational basis gives

$$p(0|\varphi)=p(1|\varphi)=\frac12,$$

so that measurement contains no information about $\varphi$. In the $X$ basis,

$$|\pm\rangle = \frac{|0\rangle\pm|1\rangle}{\sqrt2},$$

the probabilities are

$$\begin{aligned} p(+|\varphi) &= \bigl|\langle+|\psi_\varphi\rangle\bigr|^2 = \frac{1+\cos\varphi}{2}, \\ p(-|\varphi) &= \frac{1-\cos\varphi}{2}. \end{aligned}$$

The phase is neither a classical label hidden inside the qubit nor directly visible in every measurement. It becomes accessible through an interference experiment with a suitable reference and measurement basis. This small example already contains the logic of coherent control and quantum sensing:

$$\text{encode a parameter} \longrightarrow \text{preserve relative phase} \longrightarrow \text{choose an informative measurement} \longrightarrow \text{infer from repeated data}.$$

One shot produces one random outcome, not the numerical value of $\varphi$. Estimation requires a statistical model, repeated preparations or an equivalent ensemble, and an uncertainty statement.

Composition permits nonclassical correlations

Two systems combine through a tensor product,

$$\mathcal H_{AB} = \mathcal H_A\otimes\mathcal H_B.$$

Some joint states cannot be written as product states or classical mixtures of product states. Their correlations are entangled. Entanglement can support teleportation, superdense coding, distributed protocols, metrology, and error correction, but it does not by itself transmit a controllable message faster than light.

The structural definition, classification, and quantification of entanglement belong in Composite Systems and Entanglement. Entanglement in Quantum Information explains how that structure becomes task-specific resource accounting.

Physical evolution becomes an information channel

Closed-system evolution is unitary, but an information-processing component may include an environment, loss, discarded subsystems, random control errors, or measurement. Its input-output action is represented by a quantum channel

$$\mathcal E: \mathcal L(\mathcal H_A) \longrightarrow \mathcal L(\mathcal H_B),$$

a completely positive, trace-preserving linear map. A Kraus representation has the form

$$\mathcal E(\rho) = \sum_a K_a\rho K_a^\dagger, \qquad \sum_a K_a^\dagger K_a=I.$$

These equations state the interface contract, not the microscopic cause of noise. Different Hamiltonians, environments, or calibration failures can induce similar effective channels over a restricted experiment. Quantum Channels and Noise owns the mathematical theory and its physical qualifications.

Measurement is part of the task

A measurement with outcomes $y$ is represented at the probability level by positive operators $\{M_y\}$ satisfying

$$M_y\geq0, \qquad \sum_y M_y=I, \qquad p(y|\rho)=\operatorname{Tr}(M_y\rho).$$

The chosen measurement determines which distinctions become observable. If the post-measurement state matters, probabilities alone are insufficient; one needs a quantum instrument. The canonical treatment is in Generalized Measurements and Instruments.

Measurement in Circuits specializes this outcome-versus-poststate distinction to circuit diagrams, declared records, terminal or reusable outputs, and finite-shot postprocessing.

The lesson is not that observation mysteriously creates all information. It is that an operational claim must specify the preparation, process, measurement, and inference rule that connect a physical system to recorded data.

States, Channels, Measurements, and Resources

Four kinds of object recur throughout the subject.

States describe preparations

A finite-dimensional quantum state is a density operator

$$\rho\geq0, \qquad \operatorname{Tr}\rho=1.$$

It summarizes the probabilities of all measurements within the model. A pure state is a rank-one projector $\rho=|\psi\rangle\langle\psi|$. A mixed state need not mean that the system secretly occupies one definite pure state; different preparation ensembles can yield the same density operator and are then operationally indistinguishable on that system alone.

Quantum States and Density Operators are the canonical formalism pages. Quantum information adds questions such as:

• Which message ensemble does the state encode?
• How well can two candidate states be distinguished?
• Can the state be compressed, transmitted, or purified?
• Which correlations does it share with a reference system?
• Is it valuable under a declared set of allowed operations?

Channels describe admissible transformations

A channel can represent a gate, memory, communication line, noise process, state preparation, measurement with a classical output, or deliberate discarding of information. Its meaning depends on the input and output systems and on what is included in the system boundary.

Channels compose:

$$\rho \xmapsto{\mathcal E} \mathcal E(\rho) \xmapsto{\mathcal F} (\mathcal F\circ\mathcal E)(\rho).$$

This makes them natural building blocks for circuits and networks. It also makes interface errors visible: two modules cannot be composed merely because both are called “qubit operations.” Their Hilbert spaces, encodings, timing, classical controls, and error conventions must match.

Measurements turn quantum systems into records

A measurement produces classical data. The record may be a bit string, a detector time tag, an analog voltage later thresholded into a symbol, or an adaptively chosen sequence of outcomes. A complete analysis distinguishes:

1. the physical detector;
2. the effective POVM or instrument;
3. the classical readout model;
4. the estimator or decoder;
5. the final task metric.

Tomography illustrates the distinction. One unknown specimen does not reveal its state vector. State tomography uses many comparably prepared systems, an informationally complete collection of measurement settings, and a statistical reconstruction procedure. The result is an estimate with model and sampling uncertainty.

Resources are defined relative to restrictions

A resource theory begins by declaring which states or operations are free. If $\mathfrak F$ is the free set and $\Lambda$ is an allowed free operation, a resource monotone $R$ should satisfy

$$R\bigl(\Lambda(\rho)\bigr) \leq R(\rho).$$

The inequality says that allowed processing cannot create the resource being quantified. Its content depends entirely on the choice of free operations. Entanglement under local operations and classical communication, coherence relative to a basis, asymmetry relative to a symmetry group, and magic relative to stabilizer operations are different resource theories.

There is therefore no basis-independent, task-independent scalar measuring how “quantum” a device is. Resource Theories develops the general operational framework without replacing the canonical specialist theories.

Information quantities answer different questions

Quantity	Operational question	Important qualification
von Neumann entropy $S(\rho)$	How mixed is a state, or what asymptotic compression rate arises in a source model?	Not a universal score of usefulness
Trace distance $D(\rho,\sigma)$	How distinguishable are two states under the best measurement?	Requires specified priors for a decision probability
Fidelity $F(\rho,\sigma)$	How close are two states under a chosen convention?	High average fidelity can hide rare failures
Mutual information $I(A:B)$	How much total correlation is present?	Includes classical and quantum correlation
Entanglement monotone	How much of a declared entanglement resource is present?	Depends on state class and allowed operations
Fisher information	How sensitive is a data model to a parameter?	A bound is meaningful only with an estimator and resource count
Channel capacity	At what asymptotic rate can information be transmitted?	Classical, quantum, private, and assisted capacities differ

Use the Quantum Information Formula Reference for compact identities and Math Needed for Quantum Information for prerequisites.

Computation, Communication, Sensing, and Simulation

The four major task families share quantum states, channels, and measurements, but they optimize different outputs.

Task family	Typical input	Desired output	Representative metric	Costs that must be counted
Computation	classical instance, oracle, or quantum data	answer distribution or quantum state	success probability, approximation error, runtime	qubits, gates, depth, queries, repetitions, decoding, classical computation
Communication	message, source state, or shared correlation	recovered message or state	rate, fidelity, error probability, secrecy	channel uses, energy, bandwidth, entanglement, classical communication
Sensing	unknown parameter encoded by dynamics	estimate or decision	variance, risk, confidence region	probe number, time, energy, bandwidth, calibration
Simulation	target Hamiltonian, channel, or observable	dynamics, spectrum, correlation, or sample	approximation and validation error	logical resources, control precision, shots, state preparation, verification

Computation

A quantum computation is a controlled physical process designed to implement a logical transformation or sample from a target distribution. In the circuit model, an ideal unitary circuit $U_C$ acting on an initialized register gives

$$p(z|C) = \bigl| \langle z|U_C|0^n\rangle \bigr|^2.$$

A coherently controlled operation is one joint unitary, not a measurement followed by a classically selected branch. Controlled Operations owns the projector/block semantics, branch-phase audit, and controlled-access assumptions; algorithm pages own uses of that access, and hardware pages own its physical realization.

Mid-Circuit Measurement and Feedforward owns the measured classical-control alternative: causal record availability, conditional channels, reset and reuse, branch histories, and deferred-measurement limits.

An algorithmic statement must specify the problem, input access, output criterion, and complexity measure. A hardware experiment must additionally specify compilation, noise, sampling, classical preprocessing and postprocessing, and the baseline used for comparison. Use the Quantum Algorithms and Complexity chapter guide to audit that problem, promise, access, output, success, resource, comparator, and evidence boundary before following a specialist algorithm derivation.

“The state space has dimension $2^n$” is not by itself a speedup argument. A useful algorithm needs a preparation method, a transformation that places relevant information in accessible observables, and a measurement strategy that extracts the answer with controlled error.

Quantum Fourier Transform is a canonical example of that interface: it converts a coherent phase pattern into a new amplitude distribution, but one execution still yields a sample rather than a classical list of every Fourier coefficient.

Phase Kickback supplies the complementary coherent phase-transduction audit: an eigenvalue or clean function value becomes a branch-relative phase only under a declared controlled-access, target-state, sign, cleanup, and interference contract. The identity alone is not a measurement or a speedup claim.

Quantum Oracles owns the corresponding information-access contract: the instance and promise domains, full-space coherent action, separately supplied inverse, controlled, powered, or family capabilities, licensed conversions, and the distinction between a query count and total implementation cost.

Measurement-Based Quantum Computation owns the corresponding resource-state model: finite-qubit open graphs, adaptive equatorial measurements, branch maps, byproduct frames, flow or gflow determinism, and model-specific resource accounting.

Adiabatic Quantum Computation owns the corresponding closed-system Hamiltonian-path model: instance encodings, initial and accepted problem ground subspaces, schedules and licensed error certificates, endpoint decoders, polynomial circuit equivalence, and model-specific resource accounting.

Quantum Annealing owns the corresponding finite-time sampling model: driver and problem Hamiltonians, controls and runtime, declared closed or reduced-open dynamics, thermal and freeze-out hypotheses, decoded output distributions, embeddings, gauges, repetitions, and annealing-specific resource boundaries.

Continuous-Variable Quantum Computation owns the corresponding mode-based computation model: declared quadrature and energy conventions, Gaussian circuits and continuous measurements, non-Gaussian universality resources, finite-squeezed cluster patterns, approximation metrics, output decoding, and model-specific resource accounting.

Topological Quantum Computation owns the corresponding finite-anyon computation model: declared fusion data and total-charge sector, fusion-space encoding, braid and fusion-measurement programs, adaptive frames, induced projective logical operations, non-braid completion, leakage, verification, decoding, and model-specific resource accounting.

Bosonic and Encoded Computation Models owns the corresponding induced logical-computation model for oscillator encodings: declared isometry and projector, complete physical controls and instruments, recovery and adaptive frame, decoded logical channel, leakage, rejection, truncation, verification, and model-specific resource accounting.

Reversible Computation explains how many-to-one classical functions are embedded in invertible circuits and why temporary records must be cleaned before interference is reused.

Communication and cryptography

Communication theory asks how reliably or privately information can pass through a channel. Quantum systems create several distinct resources:

$$\text{classical bits}, \qquad \text{qubits}, \qquad \text{shared entanglement}, \qquad \text{channel uses}.$$

These resources are not interchangeable without a protocol. Teleportation, for example, consumes shared entanglement and classical communication to transmit an unknown qubit state; it does not eliminate the classical message or enable superluminal signaling. Quantum cryptography likewise requires a security model, authenticated classical communication, device assumptions, finite-key analysis, and implementation checks. Invoking measurement disturbance alone is not a complete security proof.

Sensing and metrology

In quantum sensing, an unknown parameter $\theta$ is encoded into a state or channel. A measurement produces data used to construct an estimator $\hat\theta$. Quantum Measurement as Estimation develops this full statistical contract, including identifiability, nuisance parameters, loss, and uncertainty. For $\nu$ independent repetitions, a locally unbiased estimator obeys a Cramér–Rao-type bound

$$\operatorname{Var}(\hat\theta) \geq \frac{1}{\nu F(\theta)},$$

where $F(\theta)$ is the classical Fisher information of the measured outcome distribution. Classical and Quantum Fisher Information develops the optimization over measurements, the SLD metric, and the caveats required to interpret it. The bound does not by itself prove an experimental advantage: probe number, interrogation time, loss, dead time, prior information, estimator bias, and calibration overhead must be counted consistently.

Fisher Information owns the generic classical statistical foundation, Classical and Quantum Fisher Information owns the quantum refinement, Cramér–Rao Bounds owns estimator assumptions and attainable risk floors, Standard Quantum Limit owns independent-probe scaling and matched-resource comparisons, Heisenberg Scaling owns the ideal inverse-resource law and its global, nonlinear, and noisy caveats, Squeezing owns response-aware noise reduction and readout gain across physical platforms, Spin Squeezing owns its collective-spin realization and entanglement criteria, Ramsey Interferometry owns the estimation and resource view of Ramsey sensing, and Precision Measurement and Metrology owns the AMO instrument physics.

Simulation

What Is Quantum Simulation? develops the full task, mapping, error, and validation contract. In brief, quantum simulation uses one controllable quantum system to learn about another quantum model. For Hamiltonian dynamics, the target may be

$$U(t)=e^{-iHt/\hbar}.$$

A digital simulator approximates this evolution with gates; an analog simulator engineers a physical Hamiltonian intended to realize the target model over a stated regime. Both require validation. Agreement with an uncontrolled device is not evidence merely because the target is hard to compute classically.

A defensible simulation claim identifies the model mapping, calibrated parameters, initial state, observables, error budget, convergence checks, and comparison against classically tractable limits. Ultracold-Atom Quantum Simulation gives a platform-specific case study.

Relation to Ordinary Quantum Mechanics

Quantum information is not a competing physical theory. It uses the same Hilbert spaces, density operators, observables, tensor products, unitary dynamics, channels, and Born probabilities as quantum mechanics. The difference is organizational.

Conventional organizing question	Quantum-information refinement
What state was prepared?	Which ensemble, promise, or message does the preparation represent?
How does the system evolve?	Which channel is implemented, and how well does it preserve the task-relevant distinctions?
What observable is measured?	Which decision, estimate, decoder, or feedback action uses the outcome?
What correlations exist?	Which operations can convert those correlations into a task advantage?
What approximation is valid?	How does its error propagate into success probability or resource cost?
What experiment agrees with theory?	Which baseline, uncertainty, and verification procedure support the claim?

The viewpoint is especially useful because it separates representation from operational meaning. A wavefunction is a representation of a state, not a classical data file that can be read in full from one system. A unitary matrix is a possible reversible transformation, not automatically an efficient gate sequence. An entangled state is a structural property, not automatically a useful network resource.

Quantum information also does not settle the interpretation of quantum mechanics. Operational predictions can be formulated while foundational questions about ontology, probability, and measurement remain open. Those questions should not be smuggled into engineering claims, and engineering success should not be presented as proof of one interpretation.

Relation to Technology

Quantum technologies are engineered systems whose relevant operation depends on controlled quantum states, dynamics, measurements, or correlations. This category includes technologies with very different maturity and evidence:

• atomic clocks and interferometric sensors;
• lasers, single-photon sources, and detectors;
• quantum key-distribution systems;
• quantum memories and network links;
• analog and digital quantum simulators;
• quantum processors and error-corrected logical systems.

The label alone says little. Nearly all modern electronics depends on quantum mechanics at the material level, but that does not make every transistor a quantum-information processor. A useful classification asks what must remain quantum at the task level.

Layer	Question
Physical carrier	Which levels, modes, particles, or collective degrees of freedom encode the system?
Coherent control	Which superpositions or correlations must survive, and for how long?
Logical abstraction	What state, gate, channel, code, or sensor model is implemented?
Protocol	What input-output task is performed?
Validation	Which measurements establish performance against a declared baseline?
Scaling	How do error, cost, control, verification, and classical support change with size?

A technology claim becomes stronger as it moves from observing a quantum effect to controlling it, integrating it into a protocol, and validating an end-to-end task. Each step adds assumptions. For computation in particular, physical qubit count is not logical qubit count; gate fidelity is not algorithm success; a sampling demonstration is not automatically a useful application; and error mitigation is not fault tolerance. Claims, Hype, and Evidence Standards gives the detailed audit.

Hardware metrics and frontier claims are time-sensitive. Stable explanations should emphasize definitions, measurement protocols, uncertainty, and comparison rules. The National Academies’ Quantum Computing: Progress and Prospects is a useful example of separating physical possibility from the substantial engineering work required for scalable systems.

What This Volume Covers

This volume is the canonical home for the operational and engineering organization of quantum information:

1. field definitions, task language, resources, and evidence standards;
2. bits, qubits, qudits, modes, encodings, and information measures;
3. gates, circuits, measurement-based models, adiabatic models, and universality;
4. algorithms, complexity, Hamiltonian simulation, and resource estimation;
5. noise models, mitigation, and the boundary with open-system dynamics;
6. quantum error correction, decoders, logical operations, and fault tolerance;
7. communication, cryptography, repeaters, memories, and networks;
8. sensing, metrology, clocks, imaging, and distributed estimation;
9. digital, analog, and hybrid quantum simulation;
10. hardware architectures, control stacks, software, compilation, and calibration;
11. benchmarking, tomography, verification, validation, and reproducibility;
12. applications, case studies, frontiers, and reference aids.

It does not duplicate the foundations on which those topics rest. The one-canonical-home boundaries are:

• Core Formalism owns states, Born probabilities, observables, density operators, and basic dynamics.
• Composite Systems and Entanglement owns tensor-product structure, reduced states, and entanglement theory.
• Measurement and Open Quantum Systems owns POVMs, instruments, channels, dilations, master equations, and decoherence.
• Atomic, Molecular, and Optical Physics owns atomic, molecular, optical, trapped-ion, neutral-atom, cavity, and precision-measurement platform physics.
• Quantum Matter owns superconducting, semiconductor, mesoscopic, topological, and materials foundations.

The volume landing page gives the detailed chapter map and reading paths.

Common Mistakes

• Equating a qubit with an unknown classical bit. A qubit can occupy coherent superpositions, and different nonorthogonal preparations cannot be treated as perfectly readable labels.
• Treating the wavefunction as directly downloadable data. Learning an unknown state generally requires many comparable preparations and a specified tomography model.
• Calling every entropy “the amount of quantum information.” Entropies and information measures have different operational meanings and assumptions.
• Assuming entanglement is always useful. Usefulness depends on the task, noise, partition, and allowed operations.
• Assuming a quantum channel is necessarily a spatial communication line. A channel may describe evolution in time, noise, a gate, preparation, measurement, or discarding.
• Confusing a mathematical possibility with an efficient protocol. Existence, computational complexity, control cost, and experimental feasibility are separate claims.
• Using “quantum advantage” without a baseline. The task, metric, classical comparator, resource accounting, verification method, and date must be stated.
• Treating hardware metrics as interchangeable. Coherence time, gate error, readout fidelity, connectivity, logical error, and application success measure different layers.
• Presenting technology forecasts as settled physics. Physical principles can be established while engineering timelines remain uncertain.

Exercises

1. Measurement basis and phase information

For

$$|\psi_\varphi\rangle = \frac{|0\rangle+e^{i\varphi}|1\rangle}{\sqrt2},$$

show that measuring in the $Y$ basis,

$$|{+i}\rangle = \frac{|0\rangle+i|1\rangle}{\sqrt2}, \qquad |{-i}\rangle = \frac{|0\rangle-i|1\rangle}{\sqrt2},$$

gives probabilities that depend on $\sin\varphi$. Which pair of bases would let repeated experiments estimate both $\cos\varphi$ and $\sin\varphi$?

Solution

The overlaps are

$$\begin{aligned} \langle {+i}|\psi_\varphi\rangle &= \frac{1-i e^{i\varphi}}{2}, \\ \langle {-i}|\psi_\varphi\rangle &= \frac{1+i e^{i\varphi}}{2}. \end{aligned}$$

Therefore

$$\begin{aligned} p(+i|\varphi) &= \frac{1+\sin\varphi}{2}, \\ p(-i|\varphi) &= \frac{1-\sin\varphi}{2}. \end{aligned}$$

Repeated $X$-basis measurements estimate $\cos\varphi$, while repeated $Y$-basis measurements estimate $\sin\varphi$. Together they determine $\varphi$ modulo $2\pi$, subject to sampling uncertainty. A $Z$-basis measurement gives neither component for this equatorial family.

2. Perfect discrimination implies orthogonality

Suppose a two-outcome POVM $\{M_\psi,M_\phi\}$ perfectly identifies whether a system was prepared in $|\psi\rangle$ or $|\phi\rangle$. Show that the two states must be orthogonal.

Solution

Perfect discrimination requires

$$\begin{aligned} \langle\psi|M_\psi|\psi\rangle&=1, & \langle\psi|M_\phi|\psi\rangle&=0, \\ \langle\phi|M_\phi|\phi\rangle&=1, & \langle\phi|M_\psi|\phi\rangle&=0. \end{aligned}$$

Because $M_\phi\geq0$, the zero expectation value implies

$$M_\phi|\psi\rangle=0.$$

Similarly, $M_\psi|\phi\rangle=0$. Using $M_\psi+M_\phi=I$,

$$\langle\psi|\phi\rangle = \langle\psi| (M_\psi+M_\phi) |\phi\rangle =0.$$

Thus distinct pure states can be identified with certainty in one shot only if they are orthogonal.

3. Dephasing removes the accessible phase

Apply complete dephasing in the computational basis to $|\psi_\varphi\rangle\langle\psi_\varphi|$:

$$\Delta(\rho) = |0\rangle\langle0|\rho|0\rangle\langle0| + |1\rangle\langle1|\rho|1\rangle\langle1|.$$

What is the output state, and what happens to the $X$-basis outcome probabilities?

Solution

Before dephasing,

$$\rho_\varphi = \frac12 \begin{pmatrix} 1 & e^{-i\varphi}\\ e^{i\varphi} & 1 \end{pmatrix}.$$

Complete dephasing removes the off-diagonal terms:

$$\Delta(\rho_\varphi) = \frac12 \begin{pmatrix} 1&0\\ 0&1 \end{pmatrix} = \frac I2.$$

The $X$-basis probabilities become

$$p(+)=p(-)=\frac12,$$

independent of $\varphi$. The channel has erased the coherence that carried phase information for this measurement task.

4. Specify an operational task

A device receives one of two equally likely optical pulses and emits a detector label. List the minimum information needed before “95% accurate” becomes a scientifically interpretable claim.

Solution

At minimum, specify:

1. the two input preparations, including nuisance variation;
2. the prior probabilities or sampling procedure;
3. the allowed receiver, measurement, and calibration;
4. what counts as a correct, incorrect, or inconclusive outcome;
5. whether 95% is training, validation, or held-out performance;
6. sample size and uncertainty;
7. loss and postselection rules;
8. the comparator, such as the optimal classical or quantum receiver under the same assumptions.

Without these items, the percentage cannot be tied to a state-discrimination problem or compared reproducibly.

5. Resource monotonicity

Suppose $R$ is an entanglement monotone under local operations and classical communication. A proposed deterministic protocol claims

$$R(\Lambda(\rho))>R(\rho)$$

for an allowed local protocol $\Lambda$. Give three logically distinct explanations for the apparent violation.

Solution

Possible explanations include:

1. $\Lambda$ was not actually free; it consumed entanglement, nonlocal communication, or another undeclared resource.
2. The protocol was probabilistic and reported only a successful postselected branch. Average monotonicity can hold even when the selected branch has larger $R$.
3. $R$ is not a valid monotone for the state class or free-operation set being used.

A fourth possibility is a calculation or calibration error. The exercise illustrates why a resource statement must include the free operations, consumed auxiliaries, and conditioning rule.

6. Audit a technology claim

An experiment samples from a circuit family faster than one published classical program. Which conclusions are supported, and which require additional evidence?

Solution

The experiment may support a benchmark comparison for the specified circuit family, processor, error criterion, hardware, classical implementation, and date. It may also demonstrate coherent control of a state space that is difficult to model directly.

It does not by itself establish:

• superiority over every classical algorithm;
• an asymptotic computational speedup;
• a useful end-to-end application;
• correct sampling outside the verified regime;
• fault-tolerant logical computation;
• favorable energy, cost, or wall-clock scaling after all classical and control overheads.

A stronger claim needs a precisely specified task, reproducible data, uncertainty, verification, competitive classical baselines, and transparent resource accounting.

Where to Go Next

For an observed device discrepancy or mitigation claim, use Noise, Channels, and Error Mitigation to separate the physical mechanism from its channel or process representation, declare context and memory assumptions, and audit the estimand, evidence, intervention, and cost before entering a specialist page.

For a protection or logical-performance claim, use Quantum Error Correction and Fault Tolerance to distinguish a correctability certificate, finite logical evidence, a fault-tolerant operation, a threshold theorem, and a resource projection before entering a specialist page.

• Quantum Information and Computation maps the volume by task, physical-to-logical layer, and evidence standard.
• Information-Theoretic Foundations turns an operational question into its carrier, state or ensemble, process, measurement, output, figure of merit, and canonical next owner.
• Bits, Qubits, Qudits, and Modes defines the carrier, encoding, code-space, and physical-device layers.
• Claims, Hype, and Evidence Standards classifies theorems, demonstrations, benchmarks, estimates, projections, and speculative applications.
• Quantum Information Roadmap gives a staged learning sequence.
• Math Needed for Quantum Information routes the linear algebra, probability, entropy, optimization, and numerical prerequisites.
• Quantum States and Density Operators supply the state formalism.
• Entanglement in Quantum Information connects correlation structure to protocols and resources.
• Quantum Channels and Noise develops completely positive maps, representations, and standard noise channels.
• Communication with Quantum Systems organizes classical, quantum, private, and entanglement-assisted communication by task, resource, error criterion, and rate.
• Hardware Overview compares physical encodings, native controls, readout, error structure, connectivity, infrastructure, and logical performance without declaring a platform winner.
• Quantum Information Applications connects qubit algebra to spin, Pauli operators, rotations, Bell sectors, and stabilizers.
• No-Cloning and No-Signaling gives the canonical operational theorem statements and proofs.

References

• M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, 10th anniversary ed., Cambridge University Press, 2010, doi:10.1017/CBO9780511976667.
• J. Watrous, The Theory of Quantum Information, Cambridge University Press, 2018, doi:10.1017/9781316848142.
• M. M. Wilde, Quantum Information Theory, 2nd ed., Cambridge University Press, 2017, doi:10.1017/9781316809976.
• J. Preskill, Lecture Notes for Physics 219/Computer Science 219: Quantum Computation, California Institute of Technology, course materials.
• A. S. Holevo, “Bounds for the quantity of information transmitted by a quantum communication channel,” Problems of Information Transmission 9, 177–183, 1973.
• B. Schumacher, “Quantum coding,” Physical Review A 51, 2738–2747, 1995, doi:10.1103/PhysRevA.51.2738.
• W. K. Wootters and W. H. Zurek, “A single quantum cannot be cloned,” Nature 299, 802–803, 1982, doi:10.1038/299802a0.
• C. H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, and W. K. Wootters, “Teleporting an unknown quantum state via dual classical and Einstein–Podolsky–Rosen channels,” Physical Review Letters 70, 1895–1899, 1993, doi:10.1103/PhysRevLett.70.1895.
• R. P. Feynman, “Simulating physics with computers,” International Journal of Theoretical Physics 21, 467–488, 1982, doi:10.1007/BF02650179.
• S. Lloyd, “Universal quantum simulators,” Science 273, 1073–1078, 1996, doi:10.1126/science.273.5278.1073.
• V. Giovannetti, S. Lloyd, and L. Maccone, “Advances in quantum metrology,” Nature Photonics 5, 222–229, 2011, doi:10.1038/nphoton.2011.35.
• E. Chitambar and G. Gour, “Quantum resource theories,” Reviews of Modern Physics 91, 025001, 2019, doi:10.1103/RevModPhys.91.025001.
• National Academies of Sciences, Engineering, and Medicine, Quantum Computing: Progress and Prospects, National Academies Press, 2019, doi:10.17226/25196.

Summary

Quantum information is quantum mechanics organized around tasks, restrictions, resources, and verifiable outputs. Its basic carriers are quantum states; its transformations are channels; its readout interfaces are measurements and instruments; and its useful resources are defined relative to what operations are free. Nonorthogonality, relative phase, tensor-product composition, entanglement, no-cloning, and measurement-dependent accessibility change what information processing can accomplish.

The field spans computation, communication, sensing, and simulation, but no quantum label establishes advantage by itself. A trustworthy claim names the task, physical model, allowed operations, success metric, resource accounting, uncertainty, and comparison baseline.