Write the normalized input as , where and . Use a data register, an -qubit eigenvalue register, and a flag quantum ancilla. Begin with .
Apply exact quantum phase estimation to . Its controlled evolutions and inverse quantum Fourier transform produce
Apply the HHL controlled reciprocal rotation, with :
The function of is computed by quantum arithmetic; the rotation is a quantum variable rotation. On a zero eigenvalue label with no input amplitude, define any unitary action, for example no rotation.
Run the inverse phase-estimation circuit. Because each amplitude multiplier depends only on , the eigenvalue register is reset to on both flag branches. Measuring the flag and conditioning on outcome one leaves
The successful unnormalized branch is , giving the probability in the preceding part. The operations independent of are the Hadamard gates preparing the phase register, the inverse quantum Fourier transform, the reversible reciprocal/angle arithmetic, the controlled fixed-angle rotations, and the final flag measurement. Uncomputation removes all arithmetic workspace; the -dependent controlled evolutions and the -dependent state-preparation circuit supply the input-specific operations.
The usual sufficient input promises for the HHL algorithm are efficient quantum state preparation of the nonzero vector , efficient access to a sparse matrix with at most nonzero entries per row, and a condition number after an efficiently known normalization. Both the positions and values of the nonzero matrix elements must be computable coherently in polynomial time. More generally, efficient Hamiltonian simulation can replace the sparsity promise. We assume is invertible; if zero eigenvalues occur, one must instead restrict to their orthogonal complement and specify the desired inverse on that support.
With and a known bound , choose . The HHL controlled reciprocal rotation then succeeds with probability
This is the required inverse-polynomial lower bound. In the usual approximate algorithm, inverse-polynomial requested error also gives polynomial runtime under these input promises. The original HHL paper states the dependence on sparsity, conditioning, and accuracy.
There is a qualification for a literally exact version. Representability of the eigenvalues in bits does not itself make exact quantum phase estimation efficient: using requires controlled powers corresponding to evolution times as large as . Under the paper's idealization we may describe their exact action, but polynomial runtime for that exact circuit additionally requires efficient implementations of those controlled powers, or equivalent efficient exact spectral access. Assuming an operation executes exactly does not bound its cost. This distinction is recorded in cost of exact phase estimation on a dyadic spectrum.
Since , the spectral decomposition gives
Replace the middle gate of the previous compute-phase-uncompute construction by
a one-qubit rotation about the z-axis. Then
The circuit uses the gates of , their inverses, and one fixed rotation; it returns the quantum ancilla to . The same construction implements with middle gate , an instance of simulation of a computable diagonal Hamiltonian.
Use a clean quantum ancilla and apply the quantum circuit , then the Pauli Z gate on the ancilla, then the inverse quantum circuit :
This compute-phase-uncompute construction implements on every input with the ancilla initially , and by linearity on any superposition of those inputs. The action on ancilla- inputs need not coincide with ; the question only requires the clean-ancilla subspace.
The printed sum contains although the stated labels end at . We use the natural periodic convention , with . If an open chain was intended, omitting the final term gives the same asymptotic bound.
Set , with indices modulo , and implement the product-formula Hamiltonian simulation
Each factor acts on two qubits, so it is a two-qubit unitary operator. More explicitly, if , , and is a controlled-NOT gate,
where is a Hadamard gate. This gives a constant number of one-qubit and two-qubit gates per factor; one-qubit gates can also be viewed as two-qubit gates tensored with the identity.
The spectral norm obeys the triangle inequality, submultiplicativity of the operator norm, and invariance under multiplication by unitary operators. In particular, the telescoping bound for products of operators gives for unitary . The first-order unitary product-formula error bound consequently yields
Only neighboring terms can have a nonzero commutator, because all other supports are disjoint. There are neighboring unordered pairs, and . Thus . Choosing gives
The coarser bound that counts all pairs also proves the often-used construction. Locality improves that cubic estimate to the quadratic bound above; neither assertion is a lower bound on the best possible circuit.
For finite-dimensional matrices , the Lie-Trotter product formula states
where convergence is in operator norm. In particular, for Hermitian matrices , set to obtain a product of unitary operators approximating .
The spectral norm is the operator norm induced by the Euclidean norm:
The Pauli operators and act on different qubits, and each is a unitary operator. Their product is therefore unitary and preserves the norm of every vector. Hence
An injective self-map of the finite set is a bijection. For sufficiently large , exactly
outputs satisfy the integer comparison, so there are exactly good inputs. Prepare the uniform superposition state , whose good probability is
Use the phase oracle from the previous part and the reflection . The amplitude amplification theorem requires iterations; each uses two queries, while the state preparation and its reflection are independent of . With the nearest-integer iteration count from that theorem, the failure probability is at most , tending to zero. Therefore the success probability eventually exceeds , with
This is a bound on quantum query complexity; implementation costs of the known gates are not counted as oracle queries.
Let the known phase gate on the answer register be
where the comparison uses ordinary integers, not modular arithmetic. A reversible circuit computes the predicate, applies a Pauli Z gate to its flag, then performs uncomputation.
The compute-phase-uncompute construction now gives
Use modular-oracle inversion by negation to realize the last operation with one further query. Exactly two oracle queries implement , returning the answer register and comparison workspace to their initial states.
Applying the two modular-addition quantum oracles consecutively adds to the answer register. Thus
Let . Applying , then , then gives
Therefore
using one query and two unitary operators independent of . This is modular-oracle inversion by negation.
The map is a bijection and an involution, so its permutation matrix satisfies
In particular , which proves that is a unitary operator. Equivalently, it permutes the computational basis and therefore preserves every inner product.
Measure the coset state in the common eigenbasis of the group shift operators. Its overlap is
The character-sum cancellation lemma makes this sum when is trivial on , and zero otherwise. Hence, with the annihilator of a subgroup of a finite abelian group,
Since , this is the uniform distribution on a finite set . The factor has modulus one, so the distribution is independent of . This is abelian hidden-subgroup Fourier sampling.
Write the finite abelian group additively. Its group shift operator is
These unitary operators form the regular representation and commute. The representation-theoretic facts we use are that every irreducible representation of a finite abelian group is one-dimensional, there are such characters of a representation, and their character orthogonality gives an orthonormal basis of functions on . Each linear character here is a group homomorphism , with .
For , the character group of a finite abelian group, put
Changing variables to gives
The vectors are therefore a common eigenbasis. Using instead of its complex conjugate in their definition reverses every eigenphase; this is merely the quantum Fourier transform sign convention.
The hidden subgroup problem is to recover a subgroup , usually by giving generators of a group, from an oracle machine providing with the promise
Thus is constant on each left coset and distinguishes different left cosets. The input includes an effective representation of elements of the group and access to the group operations; the desired efficiency is measured against the number of bits describing an element, rather than necessarily against .
A compression-decompression scheme consists of quantum channels and , where . For the emitted pure-state ensemble, reliability means that the mean squared quantum fidelity tends to one:
The average is taken over the actual source distribution, rather than the worst possible input vector.
A standard stronger formulation of reliable quantum source compression requires
where entanglement fidelity tests preservation of a purification and its reference-system correlations. It implies the mean-fidelity condition for every pure-state ensemble of . Schumacher compression achieves this at any rate : choose , encode the quantum typical subspace, and map atypical outcomes to a fallback state. The composed channel has a Kraus term , so its entanglement fidelity is at least .
Memorylessness means that the ensemble's average density operator is . Its spectral decomposition is
The product eigenvalues give
Zero eigenvalues contribute zero to the Von Neumann entropy and are excluded from logarithmic typicality tests.
The quantum typical subspace is the span of eigenvectors whose eigenvalues satisfy
Its orthogonal projection selects precisely the classical typical set for the eigenvalue distribution . The typical-set cardinality bounds and the weak law of large numbers therefore give
for any fixed and all sufficiently large .
Every member of the typical set has probability at least . Summing these probabilities gives
so
The upper bound itself holds at every block length. For sufficiently large , the high-probability property also gives the companion lower bound
hence . Together these are the typical-set cardinality bounds underlying Shannon source coding theorem.
Use base-two logarithms. The weakly typical sequence definition is
Equivalently, . By the weak law of large numbers applied to the independent and identically distributed random variables , the probability of this typical set tends to one.
This captures the usual probability scale of a long sample, but it need not make every symbol frequency representative. For a fair binary source, every word has probability and , so even the all-zero word is weakly typical. The strongly typical sequence definition additionally controls empirical symbol frequencies and excludes this word for small tolerance. Thus weak typicality agrees with the high-probability-set intuition, while allowing individually unrepresentative members.
Let be the Lane-Emden surface mass constant. The Lane-Emden mass formula gives
Thus while at fixed composition. Eliminating central mass density gives the polytropic mass-radius relation
More explicitly,
Increasing the mass of a nonrelativistic white dwarf decreases its radius. This scaling ceases to apply when relativistic electron degeneracy pressure becomes important.
For the nonrelativistic white dwarf, combine the hydrostatic pressure support equation and enclosed mass equation:
Eliminating yields
Introduce the Lane-Emden variables for a stellar polytrope,
The resulting Lane-Emden equation is
The white dwarf surface is at the first zero of , with .

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact