Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Quantum detection infers a classical hypothesis from measurements of a quantum system. If hypothesis prepares a density matrix , a measurement with POVM elements gives conditional probabilities . Detector design chooses the measurement and decision rule for a stated error criterion.
For two equally probable states, the Holevo–Helstrom theorem gives minimum error . Orthogonal states permit zero error; identical states force error . The optimal binary measurement separates the positive and negative spectral parts of , explaining why state geometry limits detection even with ideal apparatus.
Wave function collapse describes the conditional change of a quantum state associated with a measurement outcome. For an ideal projective measurement with projector , the outcome probability is and the conditional state is when , according to the Lüders rule.
If the outcome is ignored, the state becomes , which is generally a mixture rather than any one conditional state. These are different information conditions. General measurement instruments can produce other state changes with the same outcome probabilities, so the ideal projection rule is a specified measurement model. Its physical interpretation is part of the quantum measurement problem.
A quantum spin liquid is a phase of interacting quantum spins whose ground-state behavior avoids conventional magnetic order through quantum fluctuations and can exhibit long-range quantum entanglement and fractionalized excitations. Absence of a measured average magnetization alone is insufficient: thermal disorder or averaging over ordered states can also give a zero average.
An exactly solvable example is the honeycomb model with bond-dependent , and interactions. Its solution expresses the spin problem using fermions coupled to a discrete gauge field and yields phases whose excitations are anyons. Such a model makes fractionalization precise, beyond the informal picture of spins merely continuing to fluctuate.[ref]
Dynamical decoupling applies a designed sequence of control operations to a quantum system to suppress unwanted evolution, especially coupling to an environment that causes quantum decoherence. The controls repeatedly change how the unwanted interaction acts, so its effects can average away over a cycle. This does not mean that all noise is removed or that arbitrary useful dynamics are automatically preserved.[ref]
Experimental realization of robust dynamical decoupling with bounded controls in a solid-state spin system by F. Wang and others. Introduction: slow environmental coupling and bounded controls
For a simple example, let a qubit have an unwanted constant Quantum Hamiltonian , where is the Pauli Z gate matrix. Free evolution for time gives . An ideal Pauli X gate obeys , henceThe two intervals cancel the same constant phase drift in this ideal model. This is the basic refocusing idea behind a spin echo. A changing drift, finite pulse duration or imperfect rotation can leave residual error.
A2016 solid-state experiment used nitrogen-vacancy centers in diamond to compare decoupling protocols with bounded, finite-duration controls. Long shaped control paths were tested against imposed dephasing and more general noise. The experiment matters because instantaneous perfect pulses are an idealization: a useful sequence must account for the control apparatus as well as the unwanted interaction.[ref]
Experimental realization of robust dynamical decoupling with bounded controls in a solid-state spin system by F. Wang and others. Abstract, Introduction and experimental Results: finite-width Eulerian control in NV-center spins
Liouville quantum gravity gives a random geometry in two dimensions whose area is formally weighted by , where is a Gaussian free field. Since the field is a random distribution rather than a pointwise function, this exponential needs regularization. For , a standard circle-average construction on a planar domain iswith the normalization of the field fixed as in the source. Here is the average around a circle of radius ; the limit is a random measure, not a pointwise density.[ref]
Liouville Quantum Gravity and KPZ by Bertrand Duplantier and Scott Sheffield. Abstract and construction of the quantum area measure
For example, adding a constant to the field multiplies the area measure by without changing its coordinate domain. This separates random area from ordinary Euclidean area. The construction relates scaling exponents of random sets measured in these two geometries; it does not constitute a model of four-dimensional spacetime. Constructing an associated random distance requires more than defining the area measure alone.
A decoherence time is a characteristic timescale for loss of specified off-diagonal coherence in a density matrix. In a simple qubit dephasing model, , so is the time for that coherence magnitude to fall by a factor .
In Ramsey interferometry, two separated pulses convert accumulated phase into an interference signal; scanning the pulse separation measures the decay of its contrast. The inferred timescale depends on the basis, environment and pulse sequence. It differs from the energy-relaxation time, and nonexponential decay may require a stated threshold or fit convention rather than a unique decay constant.
Xanthine is a purine nucleobase with two oxo groups at positions2 and6 of the purine framework. The neutral compound has formula and can occur in different forms related by tautomerism. The general chemical name therefore need not select the same hydrogen placement as a particular structural drawing.[ref]
Xanthine in ChEBI. CHEBI:15318 general record and CHEBI:17712 specific9H form
A metabolic example is the oxidation of hypoxanthine through xanthine toward uric acid and urate. The accepted xanthine dehydrogenase reaction uses NAD+ as an electron acceptor; the related xanthine oxidase form uses oxygen. The identity of the electron acceptor matters even though both names involve xanthine oxidation.[ref]
For an atom-and-charge bookkeeping example, writing the product in its neutral uric acid form gives the formal oxidation half-reactionBoth sides contain five carbons, four nitrogens, three oxygens and six hydrogens, with total charge zero. This represents a two-electron oxidation and addition of oxygen to the framework. It is a balanced half-reaction, not a claim that the enzyme transfers two free electrons directly into solution. Subsequent uric acid/urate protonation is a distinct equilibrium.
Threshold timing noise from amplitude noise occurs when voltage fluctuations move the apparent time at which a pulse crosses a fixed threshold. Let a clean electrical trace cross at with nonzero slope . For small additive noise , linearizing givesThe result concerns a selected measurement feature. It is not automatically the source's physical arrival-time spread. The timing primer distinguishes reference-edge error from other jitter statistics.[ref]
Digital Design Debugging Guide by Tektronix. Picking out Jitter, Diagrams5–6
For an original readout example, use noise standard deviation and crossing slope . The linear estimate is . At half that slope it becomes , even with the same noise amplitude. Both units and the local slope matter.
A pulse generator, receiver and oscilloscope can compare crossing times while the threshold position or signal slope changes. Small-noise linearization presumes a unique nearby crossing; ringing, large noise or multiple crossings require a fuller model. The relevant noise bandwidth must match the recorded trace.
A changing pulse scale can also shift a fixed threshold time even without additive noise. That amplitude-dependent time walk is a different effect from the random perturbation derived above. Pulse timing jitter describes the resulting timing observable, while the original optical arrival and detector readout contributions must be distinguished.
Trauma exposure describes contact with a potentially traumatic event, rather than the person's entire subsequent psychological response. Research must specify the event definition, mode of exposure, timing and repetition. Direct experience, witnessing and learning about an event are not interchangeable exposure histories.
In the diagnostic framework summarized by the National Center for PTSD, qualifying exposure is only one part of the requirements for post-traumatic stress disorder. A history of an event does not by itself establish the disorder: the required symptom pattern and other diagnostic conditions must also be present.[ref]
PTSD and DSM-5 by National Center for PTSD. DSM-5 Criteria for PTSD, Criterion A and the statement that all diagnostic criteria are required
This separation also matters in an observational study. Recording exposure before measuring later symptoms helps establish temporal order, but it does not remove confounding or show that every exposed person has the same outcome. Event checklists, detailed interviews and retrospective reports provide different kinds of information and can differ in what they count as an exposure.
A pseudorandom generator is a deterministic, efficiently computable function with , whose output on a uniform seed is computationally indistinguishable from a uniform -bit string. Its security is relative to a specified class of tests.
For example, suppose a generator maps 128 seed bits to 256 output bits. Its range contains at most strings out of possibilities. Enumerating the range would distinguish it almost perfectly, but requires infeasible work at this size. A secure construction must resist efficient tests that avoid enumeration as well. Merely copying the seed twice fails immediately: a test compares the two halves. Useful generators enable randomized algorithms or cryptographic protocols to expand a limited supply of random seed material.[ref]
Introduction to Theoretical Computer Science by Boaz Barak. Modeling randomized computation, Pseudorandom generators
Two indexed families of probability distributions and are computationally indistinguishable when every allowed efficient test has only negligible distinguishing advantage:Here negligible means eventually smaller than for every fixed positive . The probabilities include the sampled input and the test's randomness; the model must specify whether tests are uniform algorithms or nonuniform Boolean circuits.
The claim limits an observer's power. Two distributions can be far apart for an unrestricted observer yet indistinguishable to polynomial-time observers. This is the security goal for a pseudorandom generator: its output should look uniform even though a short seed reaches only a small fraction of all possible outputs.[ref]
Introduction to Theoretical Computer Science by Boaz Barak. Modeling randomized computation, Pseudorandom generators and efficient distinguishing tests
A protein trimer is an assembly of three protein subunits. A homotrimer contains three copies of the same subunit type; a heterotrimer contains different subunit types. Subunit count describes the assembly, while the number of different sequences describes its composition.
For an original mass example, three identical chains of molar mass form an ideal complex of molar mass , ignoring modifications and bound ligands. Chains of would therefore give . A heterotrimer made from chains of 20, 25 and 30 kDa has the same total mass. Measuring total mass alone cannot distinguish those two stipulated compositions.
Polynucleotide phosphorylase illustrates why trimerization can matter mechanistically. Its three-subunit ring forms a polynucleotide phosphorylase central channel and positions catalytic regions around the assembly. The original structural study determined that arrangement by X-ray crystallography.[ref]
A duplicated fold is the structural basis for polynucleotide phosphorylase catalytic activity, processivity, and regulation by M. F. Symmons and others. Abstract, trimer assembly and accessory RNA-binding domains
Three subunits need not always form a ring or an exactly symmetric structure. Different interfaces, bound ligands and conformational changes can distinguish the subunits even when their sequences match. An observed trimer is therefore a starting point for explaining function, not a complete description of every molecular interaction.
An EF hand is a protein structural motif in which two alpha helices flank a loop. In a canonical calcium-binding EF hand, the loop contains 12 amino acid residues whose oxygen-containing groups organize a calcium ion site. PROSITE identifies coordinating positions 1, 3, 5, 7, 9 and 12; the final glutamate or aspartate can contribute two oxygen atoms. The motif is an arrangement of a chain, not a literal separate hand-shaped molecule.[ref]
EF-hand calcium-binding domain signature and profile in PROSITE. PDOC00018, Description: loop organization and coordinating positions
Structural evidence makes the arrangement concrete. The deposited calmodulin structure PDB 1CLL was determined by X-ray crystallography at resolution. Its model contains four calcium ions and two EF-hand binding loops in each lobe. A resolved ion and surrounding coordinates support a structural binding-site interpretation; they do not by themselves specify the rate or affinity of binding in every solution condition.[ref]
Calmodulin structure 1CLL in the Protein Data Bank. Experimental Data Snapshot and Primary Citation abstract
An original one-site model illustrates the distinction. If a site binds calcium independently with dissociation constant and free calcium concentration , the equilibrium occupied fraction isAt , half the sites are occupied; at , the fraction is . These values follow from the stipulated model and are not affinity measurements for PDB 1CLL.
EF hands commonly occur as interacting pairs, and atypical or altered relatives need not retain the same binding properties.[ref]
EF-hand calcium-binding domain signature and profile in PROSITE. Description: paired motifs, cooperativity and excluded nonbinding/atypical regions
Counting motifs alone therefore cannot justify treating every site as an identical independent binder. Structural arrangement, sequence chemistry and binding measurements provide complementary information.A protein sequence motif is a characteristic pattern of amino acid residues in a protein sequence. A pattern can specify fixed residues, alternatives and variable-length or wildcard positions. It is a statement about residue order; it need not specify a complete protein structural motif or independently establish biochemical function. PROSITE documents such signatures together with their interpretation and matching syntax.[ref]
For an original example, use the invented four-residue pattern
D-x(2)-[ST]: an initial D, any two residues, then S or T. With 20 possible standard amino acids, it admitsstrings out of possible four-residue strings. Under an explicitly stipulated uniform independent-residue model, a given window therefore matches with probability . This is not an empirical background model for real proteins, and the pattern is not asserted to be a real biological signature.A sequence of length 103 has 100 length-four windows. Under that model the expected value of the number of matches is . Overlapping windows need not be independent for this expectation: summing their indicator expectations is sufficient. Thus finding a short pattern can occur without a demonstrated functional relationship.
A useful annotation combines the pattern with the rest of the sequence, structural context and experimental evidence. In a calcium-binding family, for example, an EF hand depends on the spatial arrangement and chemistry of coordinating groups, not merely on a count of pattern matches.[ref]
EF-hand calcium-binding domain signature and profile in PROSITE. Description, coordinating positions and atypical/nonbinding relatives
A protein structural motif is a recurring spatial arrangement of elements within a protein structure, such as interacting alpha helices and a connecting segment of chain. It describes local organization rather than the entire protein tertiary structure. A motif can form part of a protein domain; recognizing the motif alone does not show that it folds independently or has a specified biological function.
The EF hand is a concrete example: two alpha helices flank a calcium-binding loop in canonical members. Its characteristic geometry can recur despite differences in the detailed protein sequences.[ref]
EF-hand calcium-binding domain signature and profile in PROSITE. Description, helix-loop-helix organization
In deposited calmodulin structure PDB 1CLL, X-ray crystallography resolved two EF-hand loops per lobe and four calcium ions in the model, linking this description to experimental structural coordinates.[ref]Calmodulin structure 1CLL in the Protein Data Bank. Experimental Data Snapshot and Primary Citation abstract
An original geometric example explains why absolute coordinates are not the motif. Mark three illustrative anchor points in arbitrary units:Rotate them 90 degrees about the third axis and translate by . Their new coordinates areThe corresponding distances remain and . This rigid transformation changes the coordinates while preserving the arrangement. The three points are a schematic geometry exercise, not actual atomic coordinates or a sufficient definition of an EF hand.
A structural comparison must also specify which chain segments or atoms correspond, and how their orientations and connectivity relate. A matching protein sequence motif and a recurring spatial arrangement are complementary clues; neither alone supplies every structural or functional conclusion.
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!
Intro to OurBigBook
. Source. We have two killer features:
- 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-calculusArticles 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/derivativeVideo 2. OurBigBook Web topics demo. Source. - 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.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.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. - Infinitely deep tables of contents:
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





