Pith. sign in

REVIEW

Quantum graph vertices with permutation-symmetric scattering probabilities

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1108.0856 v2 pith:N7G4IHFB submitted 2011-08-03 math-ph cond-mat.mes-hallmath.MPquant-ph

Quantum graph vertices with permutation-symmetric scattering probabilities

classification math-ph cond-mat.mes-hallmath.MPquant-ph
keywords matrixcouplingsscatteringdeltaedgegraphprobabilitiesquantum
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X LinkedIn Reddit HN
read the original abstract

Boundary conditions in quantum graph vertices are generally given in terms of a unitary matrix $U$. Observing that if $U$ has at most two eigenvalues, then the scattering matrix $\mathcal{S}(k)$ of the vertex is a linear combination of the identity matrix and a fixed Hermitian unitary matrix, we construct vertex couplings with this property: For all momenta $k$, the transmission probability from the $j$-th edge to $\ell$-th edge is independent of $(j,\ell)$, and all the reflection probabilities are equal. We classify these couplings according to their scattering properties, which leads to the concept of generalized $\delta$ and $\delta'$ couplings.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.