Quantum and CircuitsReading edition

Overview

Reading tools
Reading libraryFind statementsInspect Lean
Switch work

Saved reading

Read side by side

Start reading

Resources & source

Original TeX with line links · Download TeX

The wording and mathematics follow the retained manuscript. This reading format does not add a proof review or extend Lean coverage.

Skip contents and start reading

Overview

A finite arithmetic selector can be transported into a rational signal projector and a complex projective measurement by one explicitly normalized Fourier transformation. This chapter gives the full proof chain and follows a single exact twelve-dimensional example through every representation. The arithmetic input is the coprime residue set modulo twelve. Its Fourier synthesis is the integer-valued Ramanujan signal. The associated circulant matrix is an orthogonal projector of rank four. A normalized version of the signal is a quantum state, and an inverse Fourier transformation recovers the arithmetic support. An unsigned state has the same probabilities in the original basis yet zero probability on the selected support after transformation. The two states are orthogonal. A continuous relative-phase family makes that difference visible without changing the initial probability histogram.

The general finite Fourier, Möbius, divisor-projector, and polyphase identities are proved in the text. The formal companion covers the concrete modulus-twelve realization, including the sound interpretation of exact rational coordinates in the ordinary complex numbers, both unitarity identities, projector transport, state preparation and recovery, and the phase-sensitive probability conclusions. The formal companion contains ninety-six named theorems across five modules, including the twenty-two original bridge statements. The formal appendix identifies its exact coverage and verification evidence.

Ramanujan sums, Fourier orthogonality, rational cyclic projectors, and Ramanujan signal subspaces are classical. The contribution of this presentation is an exact, inspectable realization chain, its theorem-to-code concordance, and its explicit account of the information retained or discarded at each map. It makes no circuit-efficiency or quantum-advantage claim.

Source and conversion record

Source SHA-256: 27e2a58abc6b464edd826fc32131936fb714ba184eff04b2000abed701f087e3

Unsupported prose commands stop the build. The mathematical expression sequence is checked against the source, with manuscript macros expanded for display.

Conversion records

Notation in Quantum and Circuits

Look up a symbol without leaving this chapter. Select text before opening help to search for it.

Search this work’s notation.

    Symbols can have different meanings in different passages. Read each result in its own context.

    Open the full notation index