Pith. sign in

REVIEW

Tripartite connection condition for quantum graph vertex

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 1009.5216 v1 pith:B3M4Z3BI submitted 2010-09-27 quant-ph math-phmath.MP

Tripartite connection condition for quantum graph vertex

classification quant-ph math-phmath.MP
keywords formquantumboundaryconditionsconnectiongraphmatricesvertex
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

We discuss formulations of boundary conditions in a quantum graph vertex and demonstrate that the so-called $ST$-form can be further reduced up to a form more effective in certain applications: In particular, in identifying the number of independent parameters for given ranks of two connection matrices, or in calculating the scattering matrix when both matrices are singular. The new form of boundary conditions, called the $PQRS$-form, also gives a natural scheme to design generalized low and high pass quantum filters.

discussion (0)

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