Angle/Amplitude Encoding in QML

• Angle/amplitude encoding is a quantum data embedding method where angle encoding uses localized, parallel rotations (e.g., R_Y) and amplitude encoding stores normalized vectors in quantum state amplitudes.
• The approach presents a trade-off: angle encoding offers shallow depth and high parallelizability while amplitude encoding compresses data into fewer qubits at the expense of increased circuit depth and two-qubit gate costs.
• Empirical studies show that angle encoding is robust against noise and easier to implement, whereas amplitude encoding excels in high-dimensional data compression with enhanced expressivity when state preparation is optimized.

Angle encoding and amplitude encoding are two principal strategies for mapping classical information into computational substrates, most prominently quantum circuits. In contemporary quantum machine learning, angle encoding, also called rotation encoding, maps features into gate parameters such as single-qubit $R_Y$, $R_X$, or $R_Z$ rotations, whereas amplitude encoding stores a normalized classical vector in the amplitudes of a quantum state. The pair defines a recurring trade-off among qubit count, circuit depth, state-preparation cost, expressivity, trainability, and noise robustness: angle-based maps are shallow and parallelizable, while amplitude-based maps offer exponential qubit compression but typically incur substantially higher preparation cost and greater sensitivity to two-qubit errors (Sammartino, 3 Jun 2026).

1. Formal definitions and canonical constructions

In the canonical angle-encoding construction, a real-valued feature vector $x\in\mathbb{R}^D$ is embedded by applying one rotation per feature,

$$U_{\text{angle}(x)} = \bigotimes_{k=1}^{D} R_Y(x_k), \qquad |\psi(x)\rangle = U_E(x)|0\rangle^{\otimes D}.$$

A closely related QCNN formulation writes

$$|\psi(x)\rangle = \bigotimes_{j=1}^{n} R_Y(\pi x_j)|0\rangle,$$

while QRNN work uses the product state

$$\ket{x_t}=\bigotimes_{i=1}^N \left(\cos\!\left(\frac{\hat{x}_{i,t}}{2}\right)\ket{0}+\sin\!\left(\frac{\hat{x}_{i,t}}{2}\right)\ket{1}\right),$$

with $\hat{x}_{i,t}$ obtained by MinMax scaling. Across these formulations, the defining feature is locality: each feature controls a rotation on one qubit, and the encoding layer is shallow and naturally parallelizable (Sammartino, 3 Jun 2026, Feng, 14 Dec 2025, Morgan et al., 22 Aug 2025).

Amplitude encoding instead embeds a normalized vector into computational-basis amplitudes. In survey form,

$$U_{\text{amp}(x)}|0\rangle^n = \frac{1}{\|x\|_2}\sum_{j=0}^{2^n - 1} x_j |j\rangle \equiv |\psi_x\rangle, \qquad n=\lceil \log_2 D\rceil.$$

A related formulation used in hybrid QML is

$$\ket{\psi} = \sum_{x\in\{0,1\}^{n}} \alpha_x \ket{x}, \qquad \sum_{x\in\{0,1\}^{n}} |\alpha_x|^2 = 1.$$

When the feature dimension is not a power of two, unused basis states are assigned zero amplitude. The normalization requirement is intrinsic: amplitude encoding identifies the input with a valid quantum state, so only the direction of the vector is preserved unless additional preprocessing is introduced (Sammartino, 3 Jun 2026, Chen et al., 27 Jan 2025, Morgan et al., 22 Aug 2025).

Several works refine these canonical forms without changing the underlying distinction. Dense-angle encoding places two features on one qubit through

$R_X$0

while data re-uploading repeatedly inserts angle-encoded blocks between trainable unitaries,

$R_X$1

These variants retain the angle-encoding viewpoint but alter the qubit-efficiency–expressivity balance (Sammartino, 3 Jun 2026).

2. Resource trade-offs and hardware regimes

The most persistent distinction between angle and amplitude encoding is the contrast between qubit count and preparation cost. In the survey taxonomy, angle encoding uses $R_X$2 qubits, $R_X$3 single-qubit gates, and encoding depth $R_X$4, with zero two-qubit gates in the encoding layer. Dense-angle encoding reduces the qubit count to $R_X$5 at depth $R_X$6. Amplitude encoding compresses to $R_X$7 qubits, but exact preparation typically has $R_X$8 and $R_X$9, with many two-qubit gates (Sammartino, 3 Jun 2026).

Encoding	Qubits	Encoding-layer cost
Angle	$R_Z$0	$R_Z$1, no two-qubit encoding gates
Dense-angle	$R_Z$2	depth $R_Z$3
Amplitude	$R_Z$4	$R_Z$5, many two-qubit gates

This qubit-compression versus gate-cost trade-off reappears in application-specific analyses. In an angle-encoding Hadamard test for cosine similarity, amplitude encoding uses $R_Z$6 qubits and angle encoding $R_Z$7 qubits; both have $R_Z$8 state-preparation gates in the comparison table, but the circuit depth is $R_Z$9 for amplitude encoding and $x\in\mathbb{R}^D$0 for the angle-encoding construction, which relies on parallel elementwise two-qubit subcircuits and classical post-processing. The specific implementation described uses two qubits per component, hence $x\in\mathbb{R}^D$1 qubits for a $x\in\mathbb{R}^D$2-dimensional vector (Ohno, 17 Apr 2026).

Noise considerations sharpen the practical distinction. A survey-level fidelity bound under noisy preparation is

$x\in\mathbb{R}^D$3

with critical error threshold

$x\in\mathbb{R}^D$4

Using $x\in\mathbb{R}^D$5, the reported representative thresholds at $x\in\mathbb{R}^D$6 are effectively unconstraining for angle encoding in this model, $x\in\mathbb{R}^D$7 for re-uploading with $x\in\mathbb{R}^D$8, $x\in\mathbb{R}^D$9 for IQP, and $$U_{\text{angle}(x)} = \bigotimes_{k=1}^{D} R_Y(x_k), \qquad |\psi(x)\rangle = U_E(x)|0\rangle^{\otimes D}.$$0 for amplitude encoding. The survey’s central hardware guideline is that for $$U_{\text{angle}(x)} = \bigotimes_{k=1}^{D} R_Y(x_k), \qquad |\psi(x)\rangle = U_E(x)|0\rangle^{\otimes D}.$$1, shallow angle-based encodings consistently outperform amplitude encoding in practice, despite the latter’s exponential qubit advantage (Sammartino, 3 Jun 2026).

3. Algorithmic constructions and approximation schemes

Angle encoding is often preferred when local structure and shallow depth are paramount. In the angle-encoding Hadamard test for cosine similarity, normalized real vectors $$U_{\text{angle}(x)} = \bigotimes_{k=1}^{D} R_Y(x_k), \qquad |\psi(x)\rangle = U_E(x)|0\rangle^{\otimes D}.$$2 satisfy

$$U_{\text{angle}(x)} = \bigotimes_{k=1}^{D} R_Y(x_k), \qquad |\psi(x)\rangle = U_E(x)|0\rangle^{\otimes D}.$$3

Each scalar $$U_{\text{angle}(x)} = \bigotimes_{k=1}^{D} R_Y(x_k), \qquad |\psi(x)\rangle = U_E(x)|0\rangle^{\otimes D}.$$4 is mapped through

$$U_{\text{angle}(x)} = \bigotimes_{k=1}^{D} R_Y(x_k), \qquad |\psi(x)\rangle = U_E(x)|0\rangle^{\otimes D}.$$5

and the Hadamard test yields $$U_{\text{angle}(x)} = \bigotimes_{k=1}^{D} R_Y(x_k), \qquad |\psi(x)\rangle = U_E(x)|0\rangle^{\otimes D}.$$6. After a first-order approximation of the square-root correction term, the estimator becomes

$$U_{\text{angle}(x)} = \bigotimes_{k=1}^{D} R_Y(x_k), \qquad |\psi(x)\rangle = U_E(x)|0\rangle^{\otimes D}.$$7

The induced bias is defined as

$$U_{\text{angle}(x)} = \bigotimes_{k=1}^{D} R_Y(x_k), \qquad |\psi(x)\rangle = U_E(x)|0\rangle^{\otimes D}.$$8

and is shown to be non-negative. In experiments on random normalized vectors, RMSE decreases and correlation increases with dimension: for $$U_{\text{angle}(x)} = \bigotimes_{k=1}^{D} R_Y(x_k), \qquad |\psi(x)\rangle = U_E(x)|0\rangle^{\otimes D}.$$9, the reported RMSE values are $$|\psi(x)\rangle = \bigotimes_{j=1}^{n} R_Y(\pi x_j)|0\rangle,$$0, $$|\psi(x)\rangle = \bigotimes_{j=1}^{n} R_Y(\pi x_j)|0\rangle,$$1, $$|\psi(x)\rangle = \bigotimes_{j=1}^{n} R_Y(\pi x_j)|0\rangle,$$2, and $$|\psi(x)\rangle = \bigotimes_{j=1}^{n} R_Y(\pi x_j)|0\rangle,$$3, with corresponding correlations $$|\psi(x)\rangle = \bigotimes_{j=1}^{n} R_Y(\pi x_j)|0\rangle,$$4, $$|\psi(x)\rangle = \bigotimes_{j=1}^{n} R_Y(\pi x_j)|0\rangle,$$5, $$|\psi(x)\rangle = \bigotimes_{j=1}^{n} R_Y(\pi x_j)|0\rangle,$$6, and $$|\psi(x)\rangle = \bigotimes_{j=1}^{n} R_Y(\pi x_j)|0\rangle,$$7 (Ohno, 17 Apr 2026).

A different angle-based line of work studies quantum numerical integration through the structure of the angle map

$$|\psi(x)\rangle = \bigotimes_{j=1}^{n} R_Y(\pi x_j)|0\rangle,$$8

Here the ancilla amplitude oracle is implemented concretely by angle encoding, since

$$|\psi(x)\rangle = \bigotimes_{j=1}^{n} R_Y(\pi x_j)|0\rangle,$$9

is prepared by an $$\ket{x_t}=\bigotimes_{i=1}^N \left(\cos\!\left(\frac{\hat{x}_{i,t}}{2}\right)\ket{0}+\sin\!\left(\frac{\hat{x}_{i,t}}{2}\right)\ket{1}\right),$$0 rotation. The hierarchy

$$\ket{x_t}=\bigotimes_{i=1}^N \left(\cos\!\left(\frac{\hat{x}_{i,t}}{2}\right)\ket{0}+\sin\!\left(\frac{\hat{x}_{i,t}}{2}\right)\ket{1}\right),$$1

implies an exact factorization into

$$\ket{x_t}=\bigotimes_{i=1}^N \left(\cos\!\left(\frac{\hat{x}_{i,t}}{2}\right)\ket{0}+\sin\!\left(\frac{\hat{x}_{i,t}}{2}\right)\ket{1}\right),$$2

multi-controlled $$\ket{x_t}=\bigotimes_{i=1}^N \left(\cos\!\left(\frac{\hat{x}_{i,t}}{2}\right)\ket{0}+\sin\!\left(\frac{\hat{x}_{i,t}}{2}\right)\ket{1}\right),$$3 gates. Combined with QAE, this yields total gate count

$$\ket{x_t}=\bigotimes_{i=1}^N \left(\cos\!\left(\frac{\hat{x}_{i,t}}{2}\right)\ket{0}+\sin\!\left(\frac{\hat{x}_{i,t}}{2}\right)\ket{1}\right),$$4

with special case $$\ket{x_t}=\bigotimes_{i=1}^N \left(\cos\!\left(\frac{\hat{x}_{i,t}}{2}\right)\ket{0}+\sin\!\left(\frac{\hat{x}_{i,t}}{2}\right)\ket{1}\right),$$5 giving $$\ket{x_t}=\bigotimes_{i=1}^N \left(\cos\!\left(\frac{\hat{x}_{i,t}}{2}\right)\ket{0}+\sin\!\left(\frac{\hat{x}_{i,t}}{2}\right)\ket{1}\right),$$6. The same work proves an unconditional separation for a family with Sobolev regularity $$\ket{x_t}=\bigotimes_{i=1}^N \left(\cos\!\left(\frac{\hat{x}_{i,t}}{2}\right)\ket{0}+\sin\!\left(\frac{\hat{x}_{i,t}}{2}\right)\ket{1}\right),$$7, where the quantum oracle cost is $$\ket{x_t}=\bigotimes_{i=1}^N \left(\cos\!\left(\frac{\hat{x}_{i,t}}{2}\right)\ket{0}+\sin\!\left(\frac{\hat{x}_{i,t}}{2}\right)\ket{1}\right),$$8 while deterministic or randomized classical quadrature requires $$\ket{x_t}=\bigotimes_{i=1}^N \left(\cos\!\left(\frac{\hat{x}_{i,t}}{2}\right)\ket{0}+\sin\!\left(\frac{\hat{x}_{i,t}}{2}\right)\ket{1}\right),$$9 evaluations (Chinesta et al., 27 Apr 2026).

Amplitude encoding has generated a parallel literature on approximate loading. The Adaptive Interpolating Quantum Transform replaces fixed Fourier truncation with a learned transform-and-truncate workflow: $\hat{x}_{i,t}$0 followed by sparse amplitude encoding and inverse transform. The method preserves $\hat{x}_{i,t}$1 classical complexity and $\hat{x}_{i,t}$2 quantum gate count, while reporting a $\hat{x}_{i,t}$3 reduction in reconstruction error on financial time-series data and up to $\hat{x}_{i,t}$4 reduction on image datasets at matched sparsity (Budiutama et al., 4 Mar 2026).

Amplitude encoding also appears in quantum algorithms beyond supervised learning. For high-dimensional linear SDEs,

$\hat{x}_{i,t}$5

the solution vector is encoded as

$\hat{x}_{i,t}$6

up to normalization, and a quantum PRNG circuit is used to amplitude-encode the noise term. Both the Dyson-series-based and Euler–Maruyama-based methods make only $\hat{x}_{i,t}$7 queries to the PRNG circuit and the block-encodings of $\hat{x}_{i,t}$8 and $\hat{x}_{i,t}$9 (Miyamoto, 27 Apr 2026).

4. Empirical behavior in quantum learning architectures

In QRNNs, angle encoding was initially dominant because it is simple and shallow, but comparative results have increasingly highlighted the representational advantages of amplitude encoding when state preparation is made practical. One QRNN study reports that the base amplitude-encoded QRNN generalizes better than the angle-encoded QRNN on Yahoo Finance and Oxford-Man forecasting tasks, with benchmark test MSEs of about $$U_{\text{amp}(x)}|0\rangle^n = \frac{1}{\|x\|_2}\sum_{j=0}^{2^n - 1} x_j |j\rangle \equiv |\psi_x\rangle, \qquad n=\lceil \log_2 D\rceil.$$0 for Angle QRNN and $$U_{\text{amp}(x)}|0\rangle^n = \frac{1}{\|x\|_2}\sum_{j=0}^{2^n - 1} x_j |j\rangle \equiv |\psi_x\rangle, \qquad n=\lceil \log_2 D\rceil.$$1 for Amplitude QRNN, and parameter counts of about $$U_{\text{amp}(x)}|0\rangle^n = \frac{1}{\|x\|_2}\sum_{j=0}^{2^n - 1} x_j |j\rangle \equiv |\psi_x\rangle, \qquad n=\lceil \log_2 D\rceil.$$2 and $$U_{\text{amp}(x)}|0\rangle^n = \frac{1}{\|x\|_2}\sum_{j=0}^{2^n - 1} x_j |j\rangle \equiv |\psi_x\rangle, \qquad n=\lceil \log_2 D\rceil.$$3, respectively. The same work shows that adding a pre-normalized magnitude feature improves validation MSE from about $$U_{\text{amp}(x)}|0\rangle^n = \frac{1}{\|x\|_2}\sum_{j=0}^{2^n - 1} x_j |j\rangle \equiv |\psi_x\rangle, \qquad n=\lceil \log_2 D\rceil.$$4 to $$U_{\text{amp}(x)}|0\rangle^n = \frac{1}{\|x\|_2}\sum_{j=0}^{2^n - 1} x_j |j\rangle \equiv |\psi_x\rangle, \qquad n=\lceil \log_2 D\rceil.$$5 under MinMax scaling and to about $$U_{\text{amp}(x)}|0\rangle^n = \frac{1}{\|x\|_2}\sum_{j=0}^{2^n - 1} x_j |j\rangle \equiv |\psi_x\rangle, \qquad n=\lceil \log_2 D\rceil.$$6 under MaxMin scaling, while approximate amplitude preparation through EnQode attains average fidelity about $$U_{\text{amp}(x)}|0\rangle^n = \frac{1}{\|x\|_2}\sum_{j=0}^{2^n - 1} x_j |j\rangle \equiv |\psi_x\rangle, \qquad n=\lceil \log_2 D\rceil.$$7 on smaller state sizes and becomes competitive with exact QSP under IBM Torino noise, with noisy MSEs about $$U_{\text{amp}(x)}|0\rangle^n = \frac{1}{\|x\|_2}\sum_{j=0}^{2^n - 1} x_j |j\rangle \equiv |\psi_x\rangle, \qquad n=\lceil \log_2 D\rceil.$$8 for exact QSP and $$U_{\text{amp}(x)}|0\rangle^n = \frac{1}{\|x\|_2}\sum_{j=0}^{2^n - 1} x_j |j\rangle \equiv |\psi_x\rangle, \qquad n=\lceil \log_2 D\rceil.$$9 for EnQode (Morgan et al., 22 Aug 2025).

A hybrid quantum neural network for recovery-rate prediction provides a high-dimensional benchmark. With $$\ket{\psi} = \sum_{x\in\{0,1\}^{n}} \alpha_x \ket{x}, \qquad \sum_{x\in\{0,1\}^{n}} |\alpha_x|^2 = 1.$$0 features, amplitude encoding loads the full input into an 8-qubit state, whereas the angle baseline compresses 256 classical inputs to 8 auxiliary outputs and then applies $$\ket{\psi} = \sum_{x\in\{0,1\}^{n}} \alpha_x \ket{x}, \qquad \sum_{x\in\{0,1\}^{n}} |\alpha_x|^2 = 1.$$1 rotations. On a dataset of 1,725 observations and 256 features from 1996 to 2023, the reported best average test RMSEs are $$\ket{\psi} = \sum_{x\in\{0,1\}^{n}} \alpha_x \ket{x}, \qquad \sum_{x\in\{0,1\}^{n}} |\alpha_x|^2 = 1.$$2 for the amplitude-encoded model, $$\ket{\psi} = \sum_{x\in\{0,1\}^{n}} \alpha_x \ket{x}, \qquad \sum_{x\in\{0,1\}^{n}} |\alpha_x|^2 = 1.$$3 for the angle-encoded model, and $$\ket{\psi} = \sum_{x\in\{0,1\}^{n}} \alpha_x \ket{x}, \qquad \sum_{x\in\{0,1\}^{n}} |\alpha_x|^2 = 1.$$4 for a matched FNN baseline (Chen et al., 27 Jan 2025).

QCNN results are more regime-dependent. Under depolarizing noise on aggressively downsampled $$\ket{\psi} = \sum_{x\in\{0,1\}^{n}} \alpha_x \ket{x}, \qquad \sum_{x\in\{0,1\}^{n}} |\alpha_x|^2 = 1.$$5 MNIST, angle encoding reaches $$\ket{\psi} = \sum_{x\in\{0,1\}^{n}} \alpha_x \ket{x}, \qquad \sum_{x\in\{0,1\}^{n}} |\alpha_x|^2 = 1.$$6 at low noise and remains comparatively robust as noise increases, while the hybrid phase/angle encoder lags. At $$\ket{\psi} = \sum_{x\in\{0,1\}^{n}} \alpha_x \ket{x}, \qquad \sum_{x\in\{0,1\}^{n}} |\alpha_x|^2 = 1.$$7 MNIST, however, the hybrid scheme reaches $$\ket{\psi} = \sum_{x\in\{0,1\}^{n}} \alpha_x \ket{x}, \qquad \sum_{x\in\{0,1\}^{n}} |\alpha_x|^2 = 1.$$8 at mid noise, whereas angle encoding records $$\ket{\psi} = \sum_{x\in\{0,1\}^{n}} \alpha_x \ket{x}, \qquad \sum_{x\in\{0,1\}^{n}} |\alpha_x|^2 = 1.$$9, indicating a crossover once more feature bandwidth is available. Amplitude-encoded QCNNs are described as sparsely represented in the downsampled grids but strong in lightweight and full-resolution configurations, with training dynamics that closely resemble classical convergence (Feng, 14 Dec 2025).

Variational-classifier studies reinforce the same point from a different angle: the embedding is a hyperparameter. Under identical model topologies on Wine and Diabetes, one comparative study reports that the difference in accuracy between the best and worst models ranges from $R_X$00 to $R_X$01, with differences reaching up to $R_X$02. On Wine at 10 layers without re-uploading, the best reported model is angle encoding with RY at $R_X$03, while RX-RY-RZ gives $R_X$04, a gap of $R_X$05. A separate Qiskit VQC study reports that a hybrid amplitude/angle/phase feature map reaches $R_X$06 accuracy with COBYLA and $R_X$07 with L_BFGS_B on a synthetic six-feature classification task, compared with $R_X$08 and $R_X$09 for standard VQC encoding (Tudisco et al., 1 Aug 2025, Biswas, 18 Mar 2025).

5. Temporal, learned, and online extensions

Several recent proposals start from the premise that both standard angle and standard amplitude maps are static encodings. SPATE, or Spiking-Phase Adaptive Temporal Encoding, converts real-valued tabular data into leaky integrate-and-fire spike trains and maps spike statistics into

$R_X$10

operations on feature and temporal qubits. Its motivation is explicit: static angle and amplitude encodings do not directly model intensity/rate, timing/phase, or coarse temporal patterns. Under the encoding-centric evaluation protocol, SPATE reports CKTA $R_X$11 and Fisher $R_X$12 on Blobs, compared with CKTA $R_X$13 and Fisher $R_X$14 for angle encoding and CKTA $R_X$15 and Fisher $R_X$16 for amplitude encoding; on Moons, SPATE reaches CKTA $R_X$17, while angle and amplitude both give $R_X$18. The principal counterexample is Circles, where angle encoding is clearly stronger, with CKTA $R_X$19 versus $R_X$20 for SPATE (Innan et al., 13 Apr 2026).

Online quantum reservoir computing provides a different extension of amplitude encoding. A measurement-enabled protocol implements the partial-trace update of amplitude-encoded QRC through mid-circuit measurement and reset, with the averaged effect

$R_X$21

The method is explicitly online, avoids input buffering, and keeps runtime linear in the number of time steps. A proof-of-principle implementation on IBM’s ibm_basquecountry Heron r2 device uses $R_X$22 input qubit and $R_X$23 memory qubits, and evaluates Santa Fe prediction and short-term memory tasks (Franceschetto et al., 17 Jun 2026).

Learned amplitude encoding has also become a design object in its own right. Quantum Visual Fields construct an energy spectrum from coordinates and latent code,

$R_X$24

then set real amplitudes by $R_X$25 with $R_X$26. The prepared state is processed by a fully entangled real-Hilbert-space PQC and decoded through local projective measurements

$R_X$27

In 2D image representation, the reported gain over QIREN is about $R_X$28 MSE and $R_X$29 dB PSNR, with improved learning of high-frequency details (Wang et al., 14 Aug 2025).

6. Broader meanings of angle and amplitude encoding

Outside QML, the terms “angle” and “amplitude” often denote encoded physical variables rather than feature maps. Angle-multiplexed metasurfaces provide a clear example. Reflective high-contrast dielectric U-shaped meta-atoms are designed so that the same local unit cell has independent reflection coefficients

$R_X$30

at $R_X$31 and $R_X$32 incidence. This enables one surface to encode two independent phase masks, such as $R_X$33 Caltech logo and $R_X$34 LMI logo. The work explicitly distinguishes this angle-selective phase encoding from amplitude encoding: amplitude is present through $R_X$35 and $R_X$36, but is not the primary encoded degree of freedom (1711.02265).

In atomic interferometry, the encoded quantities can be the angle and amplitude of a collective spin oscillator. The transverse spin components are written as

$R_X$37

so that $R_X$38 is the spin angle and $R_X$39 the transverse amplitude. Using dynamically-decoupled QND Faraday probing, simultaneous tracking achieved steady-state sensitivities $R_X$40 dB below the standard quantum limit for angle fluctuations and $R_X$41 dB below Poisson statistics for amplitude fluctuations (Colangelo et al., 2017).

A third contrast arises when amplitude is deliberately excluded from the inference stage. In snapshot radio SLAM, an amplitude-independent method estimates 6-D UE pose and clock bias from angle-delay measurements

$R_X$42

using the unified residual

$R_X$43

thereby avoiding amplitude-based LoS preclassification or path-wise latent variables in the coarse stage (Shen et al., 6 Jul 2026).

Taken together, these literatures portray angle and amplitude encoding not as interchangeable defaults but as a recurring design axis. In quantum information processing, the axis is governed by qubit compression versus preparation depth, with strong downstream consequences for fidelity, trainability, and noise tolerance. In adjacent physical and engineering settings, the same terms denote different but structurally related choices about which variables are represented directly, which are inferred indirectly, and which are intentionally omitted.