5. Quantum Data Encoding, Feature Maps and Kernels

Introduction and Context

Quantum machine learning begins with a practical difficulty that is easy to underestimate: classical data must be represented in a quantum system before a quantum algorithm can process it. A quantum processor does not receive a table, image, graph, or transaction record directly. It receives a quantum state prepared according to an encoding procedure. That procedure determines what information is preserved, how many resources are required, what transformations are accessible, and whether a useful learning signal can be extracted.

Data encoding is therefore not merely an implementation detail. It is part of the model. Two algorithms using the same optimizer and the same quantum circuit may behave very differently if their feature maps encode the input in different ways. Encoding affects state-preparation cost, circuit depth, noise sensitivity, representational capacity, kernel geometry, trainability, and interpretability.

This chapter examines four important approaches: basis encoding, angle encoding, amplitude encoding, and Hamiltonian encoding. It then develops the ideas of quantum feature maps and quantum kernels, with particular attention to expressivity, dimensionality, state preparation, trainability, and classical-shadow methods. The central design question is not whether one encoding is universally superior, but which encoding establishes a useful relationship between the data and the quantum hypothesis space under realistic hardware and resource constraints.

Learning Objectives

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

1. Explain why classical-to-quantum data encoding is central to quantum machine learning.

2. Compare basis, angle, amplitude, and Hamiltonian encoding in terms of dimensionality, cost, noise, and application fit.

3. Construct and interpret quantum feature maps.

4. Explain the connection between feature maps, quantum states, and kernel functions.

5. Distinguish explicit variational models from quantum-kernel methods.

6. Assess expressivity, trainability, concentration, and barren-plateau risks.

7. Evaluate state-preparation strategies and the role of classical shadows.

8. Select an encoding and kernel strategy for a practical learning problem.

1. From Classical Vectors to Quantum States

Let a classical observation be represented by a vector

\[

x=(x_1,x_2,\ldots,x_d)\in\mathbb{R}^d.

\]

A quantum learning pipeline requires a map

\[

E:x\mapsto |\psi(x)\rangle,

\]

where \(|\psi(x)\rangle\) is a normalized state of one or more qubits. The learning model may then apply a parameterized unitary \(U(\theta)\), measure observables, or compare encoded states through overlaps.

The map \(E\) should be judged by more than the number of qubits it uses. Important criteria include:

• Information preservation: whether relevant distinctions in the data survive encoding.
• Resource efficiency: qubit count, gate count, circuit depth, and repetitions.
• Hardware compatibility: whether the required gates are available and reliable.
• Geometric usefulness: whether similar classical examples remain meaningfully related in Hilbert space.
• Expressivity: the range and complexity of functions that subsequent circuits can represent.
• Trainability: whether parameters can be optimized using measurable gradients or kernel estimates.

Normalization is a recurring issue. Angles may need scaling into a valid interval, while amplitude encoding requires a vector whose squared norm is one. Poor preprocessing can cause saturation, obscure distances, or make some features dominate merely because of their numerical scale. Consequently, preprocessing and encoding must be designed together.

A useful distinction is between data re-uploading and one-time encoding. In data re-uploading, the same or different classical features are inserted repeatedly at several circuit layers, often increasing expressivity without adding many qubits. The cost, however, is greater depth and potentially greater noise sensitivity.

2. Four Encoding Paradigms

2.1 Basis Encoding

Basis encoding represents a binary string directly as a computational-basis state. For an n-bit vector \(b=(b_1,\ldots,b_n)\),

\[

b\mapsto |b_1b_2\cdots b_n\rangle.

\]

For example, the binary record 101 becomes \(|101\rangle\). Classical categorical variables can sometimes be converted into binary codes, although the chosen coding may introduce artificial relationships between categories.

The method is conceptually simple and measurement in the computational basis is straightforward. It is well suited to inherently discrete data, Boolean constraints, search spaces, and quantum algorithms whose logic acts on bit strings. It uses one qubit per binary feature, so a length-n binary input generally requires n qubits. A real-valued feature must first be discretized or otherwise encoded into bits, which can lead to increased dimensionality and quantization error.

Basis encoding does not exploit arbitrary superposition amplitudes to store a dense vector. Its advantage is transparent representation and relatively simple state preparation; its disadvantage is that continuous information may require many qubits and preprocessing decisions.

2.2 Angle Encoding

Angle encoding maps feature values to rotation angles. A common form is

\[

|\psi(x)\rangle=\bigotimes_{j=1}^{d}R_y(\alpha_j x_j)|0\rangle,

\]

where \(\alpha_j\) is a scaling factor. Each feature is loaded into a single-qubit rotation, and several features may be placed on each qubit across successive layers.

Angle encoding is attractive on near-term devices because single-qubit rotations are native or readily decomposed on most platforms. It is also compatible with continuous data and differentiable variational circuits. In its simplest form, d features require d qubits, although feature re-uploading can reduce the qubit count at the cost of additional circuit depth.

Scaling is essential. If angles are too large or feature distributions are poorly controlled, periodic trigonometric behavior can cause different values to become indistinguishable. If angles are too small, the encoded states may be nearly identical and produce weak gradients. Standardization, min-max scaling, clipping, and problem-specific angle maps are therefore meaningful modeling choices rather than cosmetic preprocessing.

2.3 Amplitude Encoding

Amplitude encoding stores a normalized classical vector in the amplitudes of a quantum state:

\[

x\mapsto |x\rangle=\sum_{i=0}^{2^n-1}x_i|i\rangle,

\qquad \sum_i|x_i|^2=1.

\]

An n-qubit state can represent up to \(2^n\) amplitudes. In principle, this provides an exponential compression in qubit count: a vector of dimension d can be represented using approximately \(\lceil\log_2d\rceil\) qubits, after padding and normalization.

The phrase “in principle” is crucial. Preparing an arbitrary amplitude state generally requires a circuit whose cost can be large, often comparable to the amount of information being loaded. Efficient preparation is possible for structured vectors, sparse data, efficiently computable distributions, or settings with specialized memory assumptions, but it should not be presumed automatically. State-preparation cost can eliminate the apparent advantage in end-to-end applications.

Amplitude encoding is useful when a compact state representation is important and when the data have structure that supports efficient preparation. It is less attractive for frequently changing, high-dimensional raw data when preparation must be repeated many times.

2.4 Hamiltonian Encoding

Hamiltonian encoding maps data into a parameterized Hamiltonian and prepares a state through time evolution:

\[

|\psi(x)\rangle= e^{-itH(x)}|\psi_0\rangle,

\]

where \(H(x)\) may be written as a weighted sum of Pauli operators, for example

\[

H(x)=\sum_k c_k(x)P_k.

\]

The coefficients \(c_k(x)\) carry the classical features, while the resulting dynamics produce the quantum representation.

This approach is natural when the data already describe physical interactions, graphs, molecules, or dynamical systems. It can encode correlations through interaction terms rather than inserting every feature independently. Hamiltonian encoding also creates a direct bridge to quantum simulation, where the model is defined by physically meaningful operators.

Its challenges include implementing time evolution, approximating exponentials of noncommuting terms, selecting a useful initial state, and controlling simulation error. The method may require deeper circuits than simple angle maps, although hardware-native analog or digital evolution can make it compelling on suitable platforms.

3. Comparing the Encodings

No comparison is complete without distinguishing qubit efficiency from total computational efficiency. Basis and angle encoding are usually straightforward but scale approximately linearly in the number of directly loaded features. Amplitude encoding is qubit-efficient but may be state-preparation intensive. Hamiltonian encoding can be highly expressive and physically meaningful but depends on the cost of implementing the associated evolution.

For binary data, basis encoding is often the cleanest choice. For moderate-dimensional numerical data on noisy hardware, angle encoding is commonly the practical baseline. For structured vectors with efficient preparation, amplitude encoding may be appropriate. For scientific or relational data naturally expressed through interactions, Hamiltonian encoding can provide a more faithful inductive bias.

The selection should also consider the downstream task. A classifier requiring repeated kernel evaluations may make state-preparation cost especially important, because every overlap estimate may require many repetitions. A variational model may tolerate a moderately expensive encoding if it enables a shallow trainable ansatz. Conversely, an encoding that appears compact but produces concentrated, nearly indistinguishable states may be unhelpful for learning.

4. Quantum Feature Maps

A quantum feature map is a parameterized unitary \(U_\phi(x)\) that embeds classical data into a quantum state:

\[

|\phi(x)\rangle=U_\phi(x)|0\rangle.

\]

A simple map may consist of Hadamard gates followed by data-dependent rotations:

\[

U_\phi(x)=\prod_j R_z(\phi_j(x))H_j.

\]

More expressive maps include entangling gates whose angles depend on products such as \(x_i x_j\). These interactions allow the quantum state to reflect higher-order relationships between features.

Feature maps should be understood as quantum analogues of feature transformations in classical machine learning. A classical map may transform \(x\) into polynomial features; a quantum map transforms \(x\) into a state in a high-dimensional Hilbert space. The Hilbert space can be large, but a large space alone does not guarantee useful learning. The map must align with task structure and preserve a measurable distinction between relevant examples.

Expressivity and Inductive Bias

Expressivity describes the variety or complexity of functions represented by a model family. Increasing circuit depth, adding entanglement, re-uploading data, or using nonlinear angle functions can increase expressivity. Yet excessive expressivity may produce overfitting, difficult optimization, or kernels that become nearly identical for unrelated samples.

A feature map also imposes an inductive bias. A map with local rotations and limited entanglement favors relatively local relationships. A map with pairwise interaction phases favors quadratic correlations. A Hamiltonian map based on a graph favors functions respecting graph structure. Thus, the best map is often not the most elaborate one, but the one whose structure reflects the problem.

Trainability

Trainability concerns whether model parameters can be learned reliably. In variational circuits, gradients may become exponentially small as depth, system size, or randomization increases. This phenomenon is often called a barren plateau. It can arise from highly expressive random circuits, global cost functions, noise, or unsuitable initialization.

Data encoding affects trainability. If the encoded states are almost identical, gradients may be weak because the model receives little information about input differences. If the feature map creates highly complex states too early, optimization may suffer from concentration and unstable landscapes. Practical responses include shallow structured ansätze, local cost functions, layerwise training, informed initialization, data re-uploading in moderation, and careful feature scaling.

Trainability also matters for quantum kernels. Kernel estimation does not require optimizing circuit parameters in the same way as a variational classifier, but it can still be statistically expensive and can suffer when the kernel matrix is poorly conditioned or uninformative.

5. Quantum Kernels and Similarity Learning

A quantum kernel measures similarity after quantum feature mapping. The ideal fidelity-style kernel is

\[

K(x,z)=|\langle\phi(x)|\phi(z)\rangle|^2.

\]

The overlap itself may also be used when it defines a valid positive-semidefinite kernel under the selected convention. The kernel matrix for training points \(x_1,\ldots,x_m\) is

\[

\mathbf K_{ij}=K(x_i,x_j).

\]

A classical support vector machine, kernel ridge regression model, or another kernel method can then use \(\mathbf K\) without explicitly constructing coordinates in the Hilbert space.

This is the essential distinction between an explicit variational quantum model and a quantum-kernel method. A variational model learns circuit parameters and usually measures task-specific outputs. A quantum-kernel method uses a quantum circuit to compute similarities and delegates the final learning step to a classical algorithm. Kernel methods can be appealing when the feature map is fixed and meaningful, and when classical optimization of a large parameterized circuit would be difficult.

Estimating Kernels on Hardware

The overlap can be estimated with methods such as a SWAP test, a destructive overlap circuit, or related fidelity-estimation procedures. Each estimate is affected by shot noise, gate errors, state-preparation errors, and measurement bias. Since a training set of size m requires on the order of \(m^2\) pairwise entries, kernel construction can become expensive.

A practical kernel must also satisfy numerical requirements. The estimated matrix should be approximately symmetric and positive semidefinite. Finite-shot noise may violate positive semidefiniteness, requiring symmetrization, eigenvalue correction, or regularization. Validation must compare not only predictive accuracy but also estimation cost and robustness across repeated hardware runs.

Kernel Alignment and Kernel Choice

A useful kernel should separate classes or support the target function. Kernel alignment compares the quantum kernel matrix with a target similarity matrix, often based on labels. High alignment can indicate task relevance, although it must be assessed without leaking test information. One may tune feature scaling, map depth, entangling structure, or a mixture of quantum and classical kernels.

A kernel can be too simple, yielding underfitting, or too concentrated, with off-diagonal entries near a common value. In the latter case, the kernel matrix contains little usable variation. More expressivity is not a remedy if it destroys the geometry needed by the learner.

6. State Preparation, Dimensionality and Classical Shadows

State preparation is often the hidden cost in quantum machine learning. A circuit may use only a few logical qubits while requiring a long sequence of gates to load each input. For a fair comparison with classical methods, the full pipeline should include preprocessing, loading, quantum execution, repetition, readout, and classical post-processing.

Dimensionality has several meanings. Classical feature dimension refers to the number of input variables. Qubit dimension is \(2^n\) for n qubits. Effective feature dimension refers to the number of directions that the chosen map and measurement make distinguishable. These quantities need not coincide. An n-qubit circuit may formally access a \(2^n\)-dimensional state space while the task-relevant representation remains low-dimensional.

Classical shadows provide a measurement-efficient framework for predicting many properties of an unknown quantum state. Randomized measurements are collected, and a classical post-processing procedure constructs a compact classical description from which selected observables can be estimated. In a learning context, shadows may support approximate evaluation of many observables, state comparisons, or downstream classical prediction without separately estimating every quantity from scratch.

However, classical shadows do not remove all costs. Estimation sample complexity depends on the observables, their structure, and the desired accuracy. Highly nonlocal or poorly conditioned observables may require many measurements. Shadows are therefore best viewed as a flexible measurement and data-reuse technique, not as a universal solution to state-preparation or readout complexity.

7. A Design Framework for Quantum Feature Maps

A disciplined design process begins with the data rather than with a preferred circuit template.

First, characterize the data. Determine whether variables are binary, continuous, categorical, sparse, sequential, graph-based, or physically generated. Identify scale, noise, missingness, and correlations.

Second, establish a resource budget. Specify available qubits, circuit depth, connectivity, measurement shots, latency, and the number of training examples. A map that is theoretically attractive but incompatible with the device is not a viable design.

Third, choose an initial encoding. Use basis encoding for naturally binary information, angle encoding as a hardware-friendly continuous baseline, amplitude encoding when efficient preparation is available, and Hamiltonian encoding when interaction structure is central.

Fourth, add structure gradually. Begin with a shallow map, then test entanglement, interaction terms, re-uploading, or deeper evolution. Each addition should be justified by validation rather than assumed to improve performance.

Fifth, evaluate geometry and optimization. Inspect state overlaps, kernel spectra, class-wise similarities, gradient magnitudes, and sensitivity to noise. Compare against classical baselines and unencoded classical feature maps.

Finally, validate end to end. Report predictive performance together with qubit count, circuit depth, number of shots, state-preparation cost, runtime, and robustness. A quantum advantage claim cannot be established by accuracy alone.

8. Applied Case: An Illustrative Quantum Kernel for Molecular Classification

Background

Consider an illustrative research team developing a classifier for a small molecular dataset. Each molecule is summarized by twelve standardized numerical descriptors, including structural and physicochemical indicators. The team has access to a noisy processor with eight reliable qubits and limited measurement shots.

Situation and Problem

A direct angle encoding would require twelve qubits if every descriptor were loaded simultaneously. Amplitude encoding would fit the vector into four qubits after padding to sixteen components, but the team lacks an efficient arbitrary-state preparation routine. The team must select a representation and determine whether a quantum kernel adds useful information beyond a classical radial-basis kernel.

Analysis

The descriptors are continuous and moderately correlated. They are not naturally binary, and their scientific meaning is not adequately represented by a simple bit string. Arbitrary amplitude loading would add substantial circuit depth. Consequently, the team selects angle encoding with feature grouping and two data-reuploading layers. Principal-component analysis is used only as a controlled baseline and not as an automatic assumption that quantum compression is beneficial.

The feature map begins with scaled \(R_y\) rotations and adds nearest-neighbour entangling gates. A second layer reuses selected descriptors and introduces pairwise phase terms for the strongest correlations. The team evaluates several depths using training-only kernel alignment and monitors the eigenvalue spectrum of each kernel matrix.

Approach and Solution

For every pair of molecules, the circuit estimates a fidelity-style kernel. The resulting matrix is symmetrized and regularized before being supplied to a classical support vector machine. A classical radial-basis model, a linear model, and a variational quantum classifier are evaluated using identical data splits. Measurement uncertainty is incorporated by repeating kernel estimation on independent shot batches.

The shallow quantum kernel is stable but provides little separation. The deeper map improves training alignment but produces unstable estimates and a nearly concentrated kernel on the hardware device. The intermediate map gives the best validation performance and requires substantially fewer shots than the deepest alternative. The result is not treated as evidence of universal quantum superiority; it is a task-specific finding under a stated hardware budget.

Outcome

The team adopts the intermediate angle-based feature map for a pilot study. Its principal value is not the reduction of qubit count, but the ability to model selected pairwise interactions while remaining trainable and measurable. The classical baselines remain competitive, so the team recommends further testing on larger and more structurally diverse datasets before deployment.

Learning Points

1. Encoding choice must reflect both data type and state-preparation cost.

2. Kernel concentration can make a deeper circuit less useful despite higher formal expressivity.

3. Hardware-aware validation requires shot variation, noise assessment, and classical baselines.

4. A quantum feature map should be justified by its geometry and task relevance, not by circuit complexity alone.

9. Limitations, Risks and Professional Considerations

Common mistakes include treating qubit count as the sole measure of efficiency, ignoring normalization, using arbitrary deep feature maps, and reporting training accuracy without examining kernel conditioning. Another error is to compare a quantum model with a weak classical baseline or to omit the cost of loading data and estimating observables.

Noise can alter both encoded states and measured similarities. Readout errors may distort diagonal and off-diagonal kernel entries. Finite sampling can create an apparently useful pattern that disappears under repeated experiments. Data leakage is also possible when kernel hyperparameters or feature-map choices are tuned using test labels.

From a governance perspective, quantum models remain subject to ordinary requirements of responsible machine learning: privacy protection, secure data handling, reproducibility, fairness assessment, and explanation of decision criteria. Quantum encoding does not anonymize data automatically. If sensitive records are loaded into a device or cloud service, the organization must address access control, retention, vendor risk, and applicable data-protection obligations.

For professional reporting, claims should distinguish among theoretical representational capacity, simulation results, hardware results, and demonstrated application value. Reproducible circuit descriptions, preprocessing rules, random seeds where relevant, shot counts, error-mitigation procedures, and classical baselines are essential.

10. Emerging Directions

Current research is moving toward task-adaptive feature maps, automatically designed circuits, problem-informed Hamiltonians, quantum metric learning, and hybrid kernels that combine quantum and classical similarities. Error mitigation and better measurement protocols may make kernel estimation more reliable, while mid-circuit measurement and improved connectivity may support richer encodings.

Another important direction is resource-aware benchmarking. Rather than asking whether a quantum model is expressive, researchers increasingly ask whether it is expressive enough for the task at an acceptable cost. Classical shadows and related randomized measurement methods may support reusable state characterization, but their benefits depend strongly on observable structure and experimental budgets.

The likely progression of quantum machine learning will therefore emphasize co-design: data preprocessing, encoding, ansatz, measurement, optimization, and hardware must be developed as one system.

Best Practices for Implementation

• Match the encoding to the statistical and physical structure of the data.
• Scale features deliberately and document the transformation.
• Include state preparation and measurement repetitions in resource estimates.
• Start with shallow, interpretable maps and increase complexity only when validated.
• Examine kernel spectra, alignment, gradient behavior, and robustness—not only accuracy.
• Use independent test data and strong classical baselines.
• Report hardware conditions, shots, noise, and error mitigation.
• Prefer problem-informed entanglement and Hamiltonians over arbitrary depth.
• Treat classical shadows as a measurement strategy with observable-dependent costs.
• Separate claims about representation, computational efficiency, and practical advantage.

Chapter Summary

Quantum data encoding transforms classical observations into quantum states and is a central component of quantum machine learning. Basis encoding is transparent for binary data; angle encoding is hardware-friendly for continuous variables; amplitude encoding is qubit-efficient but may require expensive state preparation; and Hamiltonian encoding is suitable for interaction-rich or physical data. Quantum feature maps define the geometry in which learning occurs, while quantum kernels estimate similarities between encoded states for use by classical kernel algorithms. Expressivity must be balanced against trainability, concentration, noise, and resource cost. Dimensionality in Hilbert space does not guarantee useful effective dimension, and classical shadows can improve measurement flexibility without eliminating estimation complexity. Sound design is task-specific, hardware-aware, experimentally reproducible, and benchmarked against strong classical alternatives.

Key Terms

Basis encoding: Representation of a binary string as a computational-basis quantum state.

Angle encoding: Encoding classical values as parameters of single- or multi-qubit rotations.

Amplitude encoding: Storing a normalized classical vector in the amplitudes of a quantum state.

Hamiltonian encoding: Representing data through coefficients of a data-dependent Hamiltonian and its time evolution.

Feature map: A quantum circuit that embeds classical data into a quantum state.

Data re-uploading: Inserting classical data into multiple successive circuit layers.

Quantum kernel: A similarity function computed from overlaps or fidelities between quantum feature states.

Kernel matrix: Matrix containing pairwise kernel values for a dataset.

Expressivity: The range and complexity of functions representable by a model family.

Trainability: The practical ease with which model parameters can be optimized.

Barren plateau: A region of parameter space where gradients become extremely small.

State preparation: The process of constructing a desired quantum state from an initial state.

Effective dimension: The number of task-relevant distinguishable directions in a representation.

Kernel alignment: A measure of correspondence between a kernel matrix and a target similarity structure.

Kernel concentration: A condition in which kernel values become nearly indistinguishable across many data pairs.

SWAP test: A circuit-based method for estimating the overlap or fidelity of quantum states.

Classical shadow: A compact classical record obtained from randomized measurements for estimating multiple state properties.

Shot noise: Statistical uncertainty caused by a finite number of quantum measurement repetitions.

Inductive bias: Structural preference introduced by a model or feature map.

Error mitigation: Techniques that reduce the effect of hardware errors without fully correcting them.

Review Questions

Short Answer Questions

1. Why is data encoding considered part of the quantum learning model rather than merely a loading procedure?

2. State one principal advantage and one limitation of amplitude encoding.

3. What is a quantum feature map?

4. Define a quantum kernel using an overlap or fidelity expression.

5. Why can a formally high-dimensional quantum state have a low effective dimension?

Long Answer Questions

1. Compare basis, angle, amplitude, and Hamiltonian encoding with respect to data type, qubit requirements, state-preparation cost, and hardware suitability.

2. Explain how expressivity and trainability can conflict in quantum feature-map design.

3. Describe the construction and hardware estimation of a quantum kernel matrix.

4. Discuss why preprocessing and feature scaling are essential for angle and amplitude encoding.

5. Explain the role of classical shadows in quantum machine-learning workflows and their limitations.

Analytical / Application Questions

1. A dataset contains 20 standardized continuous features, but the available device has six qubits and shallow connectivity. Which encoding would you initially investigate, and what additional evidence would you require before selecting it?

2. A quantum kernel has high training accuracy, poor validation accuracy, and off-diagonal entries close to one. Diagnose the likely problem and propose two interventions.

3. Design an evaluation plan comparing a quantum-kernel classifier with a classical radial-basis classifier. Specify the resource, statistical, and reproducibility measures that should be reported.

22. Multiple Choice Questions with Answers

Question 1

A dataset contains naturally binary records and must be loaded with minimal transformation. Which encoding is the most direct choice?

A. Basis encoding

B. Amplitude encoding

C. Hamiltonian encoding

D. Random data re-uploading

Correct Answer: A. Basis encoding

Question 2

What is the main practical trade-off associated with amplitude encoding?

A. It cannot represent continuous values

B. It uses many more qubits than the input dimension

C. Its low qubit count may be offset by costly state preparation

D. It requires all data to be binary

Correct Answer: C. Its low qubit count may be offset by costly state preparation

Question 3

In angle encoding, poor feature scaling can cause distinct inputs to become difficult to distinguish primarily because rotation angles are periodic or poorly distributed.

A. The statement is correct

B. The statement is incorrect because rotations are not data dependent

C. The statement is incorrect because scaling affects only measurement noise

D. The statement is incorrect because angle encoding requires amplitude normalization

Correct Answer: A. The statement is correct

Question 4

Which expression represents a fidelity-style quantum kernel?

A. K(x,z)=x+z

B. K(x,z)=|⟨φ(x)|φ(z)⟩|²

C. K(x,z)=||x-z||₁

D. K(x,z)=H(x)H(z)

Correct Answer: B. K(x,z)=|⟨φ(x)|φ(z)⟩|²

Question 5

Why might increasing the depth of a quantum feature map reduce practical performance?

A. Greater depth always removes entanglement

B. It can increase noise, concentration, and optimization difficulty

C. It makes all features binary

D. It prevents construction of a kernel matrix

Correct Answer: B. It can increase noise, concentration, and optimization difficulty

Question 6

A quantum-kernel method differs from a variational quantum classifier mainly because it:

A. Never uses quantum states

B. Uses quantum circuits to estimate similarities and commonly performs final learning classically

C. Requires amplitude encoding in every case

D. Cannot be used for classification

Correct Answer: B. Uses quantum circuits to estimate similarities and commonly performs final learning classically

Question 7

What does kernel concentration indicate?

A. Kernel values vary richly for all pairs

B. The kernel matrix has no diagonal entries

C. Many pairwise similarities become nearly identical, reducing useful discrimination

D. The circuit has achieved perfect generalization

Correct Answer: C. Many pairwise similarities become nearly identical, reducing useful discrimination

Question 8

Which factor must be included in a fair assessment of amplitude encoding?

A. Only the number of qubits

B. Only the number of classical features

C. The cost of preparing the amplitude state repeatedly

D. The number of labels in the dataset

Correct Answer: C. The cost of preparing the amplitude state repeatedly

Question 9

What is a principal use of classical shadows?

A. Eliminating all quantum measurement noise

B. Creating a compact classical record from randomized measurements to estimate multiple observables

C. Encoding every real-valued vector into one qubit exactly

D. Guaranteeing a positive-semidefinite hardware kernel

Correct Answer: B. Creating a compact classical record from randomized measurements to estimate multiple observables

Question 10

In the illustrative molecular-classification case, why was an intermediate-depth feature map selected?

A. It used no measurements

B. It balanced validation performance, stability, and measurement cost

C. It guaranteed quantum advantage

D. It required arbitrary amplitude preparation

Correct Answer: B. It balanced validation performance, stability, and measurement cost