CoChat

On wave packet reduction in the Coleman–Hepp model

· 2004 · Speakable and Unspeakable in Quantum Mechanics
Cited by 122

The DOI matches its Crossref record.

Abstract

Introduction In a very elegant and rigorous paper, K. Hepp has discussed quantum measurement theory. He uses the C * algebra description of infinite quantum systems. Here an attempt is made to give a more popular account of some of his reasoning. Such an attempt seems worthwhile because many people not familiar with the C * algebra approach, and even somewhat intimidated by it, have been intrigued by the following statement in Hepp's abstract: In several explicitly soluble models, the measurement leads to macroscopically different ‘pointer positions’ and to a rigorous ‘reduction of the wave packet’ with respect to all local observables. This could look like a clean solution at last to the infamous measurement problem. But it is not so, nor thought by Hepp to be so. Here we will take one of his models and analyse it in elementary text-book terms. It will be insisted that the ‘rigorous reduction’ does not occur in physical time but only in an unattainable mathematical limit. It will be argued that the distinction is an important one. We will work at first in the Schrödinger picture, but later, with the extension to relativistic systems in mind, it will be argued that such considerations become particularly clear in the Heisenberg picture.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1017/cbo9780511815676.008

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 122

Metadata

Venue
Speakable and Unspeakable in Quantum Mechanics
Published
2004-06-03
Pages
45-51
OpenAlex
W2142645606
Cited by
122
References
0
FWCI
15.01
Type
book chapter
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: On wave packet reduction in the Coleman–Hepp model. https://app.cochat.ai/papers/10.1017/cbo9780511815676.008
The paper
On wave packet reduction in the Coleman–Hepp model. (2004). Speakable and Unspeakable in Quantum Mechanics. https://doi.org/10.1017/cbo9780511815676.008

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.