liveBook · Manning

Little-endian

Little-endian is a byte-order convention in which the least significant byte of a multibyte value comes first, at the lowest address or earliest position.

How 2 Manning books explain it

Quantum Programming in Depth

Little-endian encoding orders a bit string or composite value with its least significant bit or component first.

How it is used
Maps quantum basis-state bit strings to integer indices for amplitudes, matrices, controls, and measurements.
How deep it goes
Derives even/odd amplitude decomposition for recursive state preparation and traces ordering into controlled gates and test code.
Examples
Uses |01⟩, even and odd amplitude groups, Q# control-array reversal, and Qiskit basis-state measurement tests.
What you can do after
Apply it via Qiskit and Q# by matching amplitude, control, and measurement conversions to each language’s convention.

Read how Quantum Programming in Depth explains little-endian →

Latency

A byte order that stores the least significant byte of a multi-byte value first and the most significant byte last.

How it is used
Explains in-memory representation and serialization costs when optimizing applications for low latency.
How deep it goes
Defines byte ordering and works through 32-bit layouts, but stops short of implementation code or broader protocol details.
Examples
Uses 0xE011CFD0, order ID 1001, a Rust order struct, and JSON serialization as concrete examples.
What you can do after
Evaluate/understand how multi-byte values occupy memory and transform between in-memory and serialized formats.

Read how Latency explains little-endian →

Related concepts

These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.