Quantum computation · Physics · Mathematics

Huan-Hsin Tseng

I study quantum algorithms using geometry, Lie theory, and mathematical physics. My recent work concerns trainable observables, circuit expressivity, and transfer learning. I also work on learning-assisted quantum characterization and control.

Research Scientist, Brookhaven National Laboratory

Gauge-field strength as the curvature of a connection.

01 About

About

I am a Research Scientist at Brookhaven National Laboratory. My research focuses on quantum algorithms, particularly the geometry of circuits and observables, transfer learning, and learning-assisted quantum characterization and control.

I received a B.S. in mathematics and a Ph.D. in physics from National Tsing Hua University. My dissertation, Gravitational Theories with Torsion (2015), studied Poincaré gauge gravity, scalar-torsion cosmology, and higher-dimensional teleparallel gravity.

My earlier work includes reinforcement learning for adaptive radiotherapy at the University of Michigan, and theoretical machine learning at Academia Sinica: Layer Variational Analysis, optimal transport for domain adaptation, and generalized stochastic neighbor embedding. These studies use variational, geometric, and algebraic methods to analyze computational problems.

Education and research positions

Selected stages of my academic training and research.

t → next 2005MathematicsB.S., NTHU 2015Ph.D., torsion gravityPoincaré gauge theory 2016University of Michigandeep RL for radiotherapy 2019Academia SinicaLVA · optimal transport 2023Brookhavenquantum algorithms 2005 — 2015 General Relativity, Spacetime theory, Cosmology, Dark Energy bundles, connections, curvature
  1. 2005B.S. in Mathematics, National Tsing Hua University
  2. 2005 — 2015General Relativity, Spacetime theory, Cosmology, Dark Energy
    bundles, connections, curvature
  3. 2015Ph.D. in Physics — torsion gravity, Poincaré gauge theory
  4. 2016University of Michigan — deep RL for radiotherapy
  5. 2019Academia Sinica — Layer Variational Analysis, optimal transport
  6. 2023Brookhaven National Laboratory — quantum algorithms

02 Research interests

Research interests

My main interests are mathematical methods for quantum algorithms, quantum inference and control, and the theory of learning.

  1. i.

    Algebra and topology for quantum error correction

    Stabilizer subspaces, cellular maps, relative homology, and logical operators.

    §1 →
  2. ii.

    AI-assisted quantum inference and control

    Identifiable Hamiltonian models, adaptive probes, and molecular state preparation.

    §2 →
  3. iii.

    Reliable quantum realization

    Device noise, phonon-induced quasiparticles, materials, and learning-assisted characterization.

    §3 →
  4. iv.

    Learned detector response

    Conditional forward models, Monte Carlo simulation, and reconstructed physics observables.

    §4 →
  5. v.

    Geometry and algebra for quantum algorithms

    Observable equivalence, Lie-group actions, spectral structure, and circuit and measurement resources.

    §5 →
  6. vi.

    Mathematical methods for learning

    Variational response, domain adaptation, distribution geometry, and information constraints.

    §6 →
  7. vii.

    Gauge geometry and gravitation

    Principal bundles, connections, curvature, torsion, and variational principles in gravitational theory.

    §7 →

I also have an exploratory interest in quantum methods for learning and inference, with explicit comparison of quantum and classical resource costs.

§1Research notes

Quantum error correction: topology and symmetry

Cellular maps · stabilizer subspaces · homological decoding

I study error-correcting subspaces through algebra and topology. For a surface code, boundary and coboundary maps generate commuting Pauli checks. Their common invariant subspace is the code; homology describes the logical transformations that the checks cannot distinguish.

A planar surface-code patch with rough and smooth boundaries: an error path ends at a measured syndrome, while a different recovery path can complete a logical crossing.
Local syndromes and a global logical path. Conceptual illustration; the worked example gives the exact cells, matrices, and Pauli supports.

Expository note · Quantum error correction

Can the right syndrome lead to the wrong logical correction?

Let \(K\) be a cellulated surface, \(A\) its rough boundary subcomplex, and \(C_n=C_n(K,A;\mathbb F_2)\). Qubits occupy the remaining edges. The cellular maps organize both local checks and global logical classes:

\[ C_2\xrightarrow{\partial_2}C_1\xrightarrow{\partial_1}C_0, \qquad \partial_1\partial_2=0. \] \[ H_1(K,A;\mathbb F_2)=\frac{\ker\partial_1}{\operatorname{im}\partial_2}. \]

An error \(z\in C_1\) has star syndrome \(\partial_1z\). Cycles differing by a face boundary act identically on the code.

A recovery \(\widehat z\) can match the syndrome yet leave a logical error:

\[ \partial_1z=\partial_1\widehat z \quad\not\Rightarrow\quad [z+\widehat z]=0. \]

The note builds the topology first, then works through the boundary matrices and error paths of a planar surface code.

Read more

How does symmetry organize error-correcting subspaces?

For the relative chain groups above, let \(C^i=\operatorname{Hom}_{\mathbb F_2}(C_i,\mathbb F_2)\) and \(\delta^i\phi=\phi\circ\partial_{i+1}\). Assign \(n=\dim C_1\) edge qubits with Hilbert space \(\mathcal H=(\mathbb C^2)^{\otimes n}\).

The support maps \(Z:C_1\to\mathrm U(\mathcal H)\) and \(X:C^1\to\mathrm U(\mathcal H)\) label products of edge Pauli operators. They turn the cellular maps into checks:

\[ A_v=X(\delta^0v^\vee),\qquad B_f=Z(\partial_2f). \] \[ (\delta^0v^\vee)(\partial_2f)=v^\vee(\partial_1\partial_2f)=0 \quad\Longrightarrow\quad [A_v,B_f]=0. \]

\(v^\vee\in C^0\) is a vertex basis functional and \(f\in C_2\) a face. The Pauli commutation phase is the evaluation of an edge cochain on an edge chain.

The checks generate a finite abelian stabilizer group \(S\subset\mathrm U(\mathcal H)\), with \(-I\notin S\). Group averaging projects onto its invariant subspace, the trivial-character sector:

\[ P_{\mathcal C}=\frac1{|S|}\sum_{g\in S}g,\qquad \mathcal C=\mathcal H^S=\operatorname{im}P_{\mathcal C}. \] \[ P_{\mathcal C}E_a^\dagger E_bP_{\mathcal C}=c_{ab}P_{\mathcal C}. \]

\(\mathcal H^S=\{\psi\in\mathcal H:g\psi=\psi\text{ for every }g\in S\}\). The second equation is the Knill–Laflamme condition for a specified error set \(\{E_a\}\), with \(c_{ab}\in\mathbb C\). An invariant or isotypic subspace must satisfy this additional condition to correct those errors.

The full note connects these projectors to representation theory, then works through a planar code with explicit boundary matrices, syndromes, and logical operators.

03 Research

Research

Conceptual illustrations use AI-generated artwork. Figures from the papers are identified in their captions.

§2Ongoing

Quantum-logic spectroscopy and molecular control

Measurement and feedback for trapped molecular ions

How can we prepare a molecular state that we cannot observe directly?

Quantum-logic spectroscopy couples a molecular ion to a controllable atomic logic ion through shared motion. Raman pulses correlate molecular transitions with motional excitation; logic-ion readout then conditions the next control. I study such pulse-and-measurement sequences for molecular state preparation.

Raman beams drive a molecular sideband coupled to shared axial motion; fluorescence from a separate logic ion gives a conditional state update.
Physical setting\(\Omega(t)\) is the effective Raman Rabi envelope; \(\omega_m\) is the shared angular motional frequency. The inset shows \(|i,n\rangle\to|j,n+1\rangle\). Logic-ion outcome \(y\) conditions the molecular state \(\rho_y\); the dashed mode guide is schematic.
\[ H_a(t)=H_{\mathrm{mol}}\otimes I_{\mathrm{mot}}+I_{\mathrm{mol}}\otimes\hbar\omega_m b^\dagger b+H_{\mathrm{Raman}}(a,t). \] \[ U_a=\mathcal T\exp\!\left[-\frac{i}{\hbar}\int_0^{\tau_a}H_a(t)\,dt\right]. \] \[ p(y\mid a,\rho)=\operatorname{Tr}\mathcal I_{a,y}(\rho),\qquad \rho'_{a,y}=\frac{\mathcal I_{a,y}(\rho)}{p(y\mid a,\rho)}. \] \[ F_\star(\rho)=\langle\psi_\star|\rho|\psi_\star\rangle. \]

\(H_a\) acts on molecular internal states and shared motion. \(H_{\mathrm{mol}}\) is the internal Hamiltonian; \(I\) denotes the identity on each indicated space. The motional mode has angular frequency \(\omega_m\) and annihilation operator \(b\). Pulse \(a\) has duration \(\tau_a\); \(\mathcal T\) orders time evolution. The effective instrument \(\mathcal I_{a,y}\) includes evolution, readout \(y\), and reset. The conditional update requires \(p(y\mid a,\rho)>0\). \(\rho\) is the molecular state and \(|\psi_\star\rangle\) its target.

The control objective is to increase target-state fidelity under uncertain outcomes and an experimental time budget. This builds on established molecular QLS and learning-assisted control; the equations describe the general physical setting.

§3Quantum devices

Physical noise and quantum error protection

Phonon-induced quasiparticles · material sensitivity · error-correcting subspaces

How does one radiation event produce errors across a quantum chip?

Material sensitivity of superconducting quantum processors · ongoing

Energy deposited in a substrate produces phonons that can reach multiple superconducting electrodes. Above the pair-breaking threshold, they generate quasiparticles; tunneling across a junction increases relaxation and reduces coherence. I use Geant4/G4CMP-based modeling to study how materials and device geometry affect this process.

Exploded chip stack with phonon paths in a substrate, superconducting electrodes above, and a lower film.
Device schematicRadiation-generated phonons propagate through the substrate and can break Cooper pairs in superconducting electrodes. The supplied artwork uses illustrative geometry and colors.
\[ E_{\mathrm{ph}}\ge2\Delta,\qquad \frac{dn_{\mathrm{qp}}}{dt}=g_{\mathrm{qp}}(t)-r n_{\mathrm{qp}}^2-s n_{\mathrm{qp}}. \] \[ \Delta\Gamma_1\simeq\frac{x_{\mathrm{qp}}}{\pi}\sqrt{\frac{2\omega_{01}\Delta}{\hbar}}. \] \[ \frac1{T_1}=\Gamma_{1,b}+\Delta\Gamma_1,\qquad \frac1{T_2}=\frac1{2T_1}+\Gamma_\phi. \]

\(E_{\mathrm{ph}}\) is phonon energy and \(\Delta\) the superconducting gap. \(n_{\mathrm{qp}}\) is quasiparticle density; \(g_{\mathrm{qp}},r,s\) describe generation, recombination, and removal. \(x_{\mathrm{qp}}=n_{\mathrm{qp}}/n_{\mathrm{cp}}\) is normalized to the Cooper-pair density; \(\omega_{01}\) is angular transition frequency. \(\Delta\Gamma_1\) is the quasiparticle-induced excess relaxation rate; \(\Gamma_{1,b},\Gamma_\phi\) are baseline relaxation and total pure-dephasing rates. \(T_1,T_2\) are relaxation and coherence times. The rate expression is a standard-transmon, quasi-equilibrium model.

Geant4 models particle interactions and energy deposition; G4CMP supplies low-temperature charge and phonon transport. Quasiparticle kinetics and qubit-response models connect these simulations to decoherence. The concern is quasiparticle poisoning and loss of quantum information, rather than necessarily permanent electrode damage.

Which device simulations are most informative?

Bayesian Active Learning for Sample-Efficient and Symmetry-Aware Qubit Layout Optimization · QCE 2026

In collaborative work, we study active learning for radiation-sensitive qubit layouts. The aim is to choose informative simulations while accounting for layout symmetries.

Four panels of mean-squared prediction error against sample size for several acquisition strategies and layout representations; errors fall faster with rotation-invariant latent representations.
Fig. 1Surrogate error versus number of simulated layouts. Bayesian Active Learning for Qubit Layout Optimization, QCE 2026 (N. Jeon et al.), Fig. 3.

What can learning infer from partial quantum information?

Two related interests are learned decoding from error syndromes and estimation of a reduced density matrix \(\rho_A=\operatorname{Tr}_{\bar A}\rho\) from partial measurements. A state estimate must be positive and have unit trace; incomplete measurements need not identify a unique state.

Syndrome information guides error inference and recovery; partial subsystem information constrains a positive unit-trace reduced-state estimate.
ConceptResearch interests: syndrome-based learned decoding and physical reduced-state estimation from partial information. Incomplete measurements may leave more than one compatible state.
§4Ongoing

Learned detector response and Monte Carlo simulation

Forward foundation model · ongoing collaboration with UConn

Can we learn what a detector will reconstruct?

QuantumMC Forward Foundation Model · UConn collaboration · ongoing

A particle-physics generator predicts truth-level final states; a detector records signals from which particle trajectories and identities must be inferred. Given a generated event, which outcomes would the detector and reconstruction produce? A forward model describes this conditional distribution, including its fluctuations.

GEMC/Geant4 follows particle transport and energy deposition. Digitization turns simulated hits into readout, and COATJAVA reconstructs particle candidates. With UConn collaborators, I am developing learned approximations to selected parts of this combined response, retaining the upstream physics generator.

Three schematic paths: a real CLAS12 experiment; physics generation followed by GEMC/Geant4 simulation and COATJAVA reconstruction; and a learned response replacing selected detector and reconstruction response stages while retaining the generator.
Fig. 2Experiment, full simulation, and a proposed learned forward response. The program targets the response after truth-event generation; the current study conditions on selected matched forward-detector reconstructions.

Which part of the physics prediction does the model replace?

Let \(X\in\mathcal X\) be a truth event, \(Y\in\mathcal Y\) a reconstructed outcome, and \(c\in\mathcal C_{\mathrm{det}}\) the detector conditions. Outcomes include missing or failed reconstructions. The end-to-end response is a probability kernel \(K\); \(\mathcal P(\mathcal Y)\) denotes probability measures on the outcome space:

\[ K:\mathcal X\times\mathcal C_{\mathrm{det}}\longrightarrow\mathcal P(\mathcal Y), \qquad (X,c)\longmapsto K(\,\cdot\mid X,c). \] \[ K(dY\mid X,c)=\int K_{\mathrm{reco}}(dY\mid d,c)\,K_{\mathrm{digi}}(dd\mid h,c)\,K_{\mathrm{transport}}(dh\mid X,c). \] \[ P_{\mathrm{reco}}(dY\mid\alpha,c)=\int_{\mathcal X}K(dY\mid X,c)\,P_{\mathrm{gen}}(dX\mid\alpha). \]

\(h\) denotes simulated hits and \(d\) digitized readout. \(P_{\mathrm{gen}}\) is the truth-event probability law, with physics-model parameters \(\alpha\). Integrating the transport and digitization kernels propagates the truth event to reconstructed outcomes. A learned response approximates this detector factor while retaining \(P_{\mathrm{gen}}\).

The current study models kinematic residuals and reconstructed particle identity for selected, successfully matched forward-detector reconstructions. A conditional distribution is needed because detector smearing, response tails, and particle misidentification cannot be represented by a single corrected momentum.

The broader aim is a reusable forward response across particle species and detector conditions, with acceptance, reconstruction efficiency, and event correlations treated explicitly as the scope expands. These determine which generated particles appear in a reconstructed sample and how their measured distributions change.

Which distributions must a learned response preserve?

Validation compares reconstructed spectra, response tails, particle-identification patterns, and analysis observables against full simulation. Detector control data provide a further check on the simulation used as the learning target. Agreement at both stages is needed for a fast surrogate to support physics inference.

§5Quantum algorithms

Quantum circuits, observables, and geometry

Observable Geometry · ANO and DANO · quasi-polar analysis · transfer learning

Do quantum circuits have a gauge structure?

Observable Geometry for Effective Quantum Circuits · QCE 2026

Different circuits can produce the same transformed observable. For an \(n\)-qubit system, let \(N=2^n\), \(O\in\mathrm{Herm}(N)\), and \(U\in U(N)\). The measurement-operator map has an exact redundancy:

\[ F_O(U)=U^\dagger O U. \] \[ S_O=\{S\in U(N):[S,O]=0\}. \] \[ F_O(SU)=F_O(U),\qquad \mathcal O_O\simeq S_O\backslash U(N). \] \[ \dim_{\mathbb R}\mathcal O_O=N^2-\sum_jm_j^2. \]

\(\mathrm{Herm}(N)\) is the space of Hermitian operators; \(m_j\) are the multiplicities of the distinct eigenvalues of \(O\). The stabilizer acts on the left.

Principal-bundle projection

\[ \pi(p\cdot g)=\pi(p),\qquad g\in G. \]

Observable redundancy

\[ F_O(SU)=F_O(U),\qquad S\in S_O. \]

Both maps are constant along their fibers. Here the gauge-like redundancy is relative to a chosen observable, rather than a local spacetime gauge symmetry. We use its stabilizer to identify effective circuit directions.

Two circuit points U and SU on one stabilizer fiber project along dashed lines to the same effective observable.
Fig. 3 · ConceptFor unitary \(S\) commuting with \(O\), \(U\) and \(SU\) lie on one fiber and project to the same observable \(U^\dagger OU\).
Left: histogram of the redundancy score s(A) for four families of circuit generators. Right: VQE energy over six trials, low-score circuits reaching lower energies than high-score circuits, near the exact ground energy of about −13.92.
Fig. 4(a) Score \(s(A)\) by generator family; (b) VQE energy, \(U_{\text{low}}\) vs. \(U_{\text{high}}\), with exact \(E_0 \approx -13.92\). Observable Geometry, Fig. 2.

Why train only the circuit, rather than the observable?

Adaptive Non-local Observable on Quantum Neural Networks · QCE 2025

Unitary conjugation changes an observable's basis but preserves its spectrum. ANO also learns the observable, allowing the model to move between spectral classes.

\[ \operatorname{spec}(U^\dagger H_0U)=\operatorname{spec}(H_0). \] \[ f_{\theta,\eta}(x)=\operatorname{Tr}\!\left[\rho_x U_\theta^\dagger(H_\eta\otimes I)U_\theta\right],\quad H_\eta=H_\eta^\dagger. \]

\(\rho_x\) is the encoded input state. The trainable Hermitian block \(H_\eta\) acts on \(k\) measured qubits; \(I\) acts on the remaining qubits. A general block has \(4^k\) real coefficients.

An isospectral trajectory stays on one curved sheet; an adaptive-observable trajectory crosses sheets labeled by different spectra.
Concept\(\Lambda_0,\Lambda_1,\Lambda_2\) label distinct spectral classes. Unitary conjugation stays within one class; a learned Hermitian observable can change its spectrum.
Original geometric diagrams: ANO, Figs. 2 and 3
Original ANO Figure 2: a sequence of conjugated observables follows a trajectory on a curved schematic surface.
ANO, Fig. 2: circuit variation as a trajectory of conjugated observables.
Original ANO Figure 3: trajectories in Hermitian and unitary spaces are drawn side by side to pose the question of their correspondence.
ANO, Fig. 3 poses the correspondence question. An observable change admits a unitary counterpart only when its spectrum is preserved. Source paper.

Can we learn the spectrum and let the circuit supply the basis?

Diagonal Adaptive Non-local Observables on Quantum Neural Networks · ICCCN 2026

DANO separates spectral weights from basis rotations. For a \(k\)-qubit block, the spectral theorem gives

\[ H=W^\dagger\Lambda_\lambda W,\qquad W\in U(K),\quad K=2^k. \] \[ \Lambda_\lambda=\operatorname{diag}(\lambda_1,\ldots,\lambda_K). \] \[ f_{\theta,\lambda}(x)=\operatorname{Tr}\!\left[\rho_x U_\theta^\dagger(\Lambda_\lambda\otimes I)U_\theta\right]. \]

The real spectral weights \(\lambda_j\) replace \(4^k\) observable coefficients with \(2^k\) diagonal coefficients. Basis rotations still require circuit resources; a fixed shallow ansatz need not represent every basis.

A unitary basis rotation gives four outcome probabilities, which real diagonal weights combine into an expectation.
ConceptDANO combines a circuit-defined basis with learned diagonal weights. The four channels illustrate \(K=4\) basis outcomes, rather than four qubits. The weights are real and can have either sign.
MNIST test accuracy over 30 epochs for a pure VQC and 2-, 4-, 6-, and 8-local DANO; accuracy rises with locality.
Extended Yale B test accuracy over 50 epochs for a pure VQC and 4- to 10-local DANO; accuracy rises with locality.
Fig. 5MNIST and Extended Yale B classification with different measured block sizes. DANO, Figs. 5 and 8. These comparisons use the finite circuit ansätze reported in the paper.

During training, does the model change its spectrum, its basis, or both?

Quasi-polar Decomposition of Quantum Neural Networks via Adaptive Non-local Observables · 2026 preprint

Quasi-polar analysis follows the spectral and unitary coordinates of a learned observable. Along a smooth choice of basis, their contributions to its change separate:

\[ H_t=U_t^\dagger\Lambda_t U_t,\qquad U_t=e^{i\Theta_t},\quad \Theta_t=\Theta_t^\dagger. \] \[ \dot H_t=U_t^\dagger\dot\Lambda_t U_t+[H_t,U_t^\dagger\dot U_t]. \]

\(t\) indexes training, not physical time. The first term changes the spectrum; the commutator changes the basis. Eigenbases and unitary logarithms are nonunique. This is a spectral-coordinate description, rather than the matrix polar decomposition.

Original paper Figure 1: a polar grid and orange spiral training trajectory, with spectrum lambda as a radial coordinate and Hermitian generator Theta as an angular coordinate.
Paper · Fig. 1The spectrum \(\lambda\) and Hermitian generator \(\Theta\) play radial and angular roles in \(\widetilde H(\lambda,\Theta)\). The spiral illustrates training, \(t\mapsto(\lambda_t,\Theta_t)\). Source paper.

Can a pretrained quantum circuit adapt to a new task?

Transfer Learning Analysis of Variational Quantum Circuits · ICASSP Workshops 2025

For nearby, aligned domains, Lie-algebraic response describes how input changes affect a pretrained circuit and how parameter changes can compensate. For Hermitian \(A\), with \(iA\in\mathfrak u(N)\), the local adjoint response is

\[ e^{i\epsilon A}Oe^{-i\epsilon A}=O+i\epsilon[A,O]+O(\epsilon^2). \] \[ f(x+\delta x;\theta+\delta\theta)\simeq f(x;\theta)+J_x\delta x+J_\theta\delta\theta. \] \[ \delta\theta^*=J_\theta^+\!\left(\delta y-J_x\delta x-r\right),\qquad r=f(x;\theta)-y. \]

\(J_x\) and \(J_\theta\) are the input and parameter Jacobians, stacked over aligned samples; \(J_\theta^+\) is the Moore–Penrose pseudoinverse. The update solves the linearized least-squares problem, under the local-response approximation.

Nearby input manifolds pass through a unitary frame; input and parameter Jacobian responses are compared in output space.
ConceptFor nearby, aligned domains, input and parameter changes affect the output through their Jacobians. The local correction follows the linearized analysis above.
§6Machine learning

Variational analysis, transport, and representation learning

Layer Variational Analysis · optimal transport · generalized SNE

How does a domain shift affect a trained network?

Interpretations of Domain Adaptations via Layer Variational Analysis · ICLR 2023

Layer Variational Analysis studies the response of network layers to changes in data and model parameters. The analysis gives conditional error estimates and an analytical adaptation procedure. A local-response picture is

\[ \delta f\simeq J_x f\,\delta x+J_\theta f\,\delta\theta. \]

For \(f:\mathbb R^d\times\mathbb R^p\to\mathbb R^m\), the Jacobians map input and parameter perturbations to output changes. This first-order expression illustrates the response; the paper states the assumptions of its layer-wise analysis.

Nearby inputs pass through network layers and produce an output perturbation described by input and parameter Jacobians.
ConceptA domain shift propagates through the network. Layer response relates changes in inputs and parameters to changes in outputs.
Six spectrograms: clean speech, noisy speech, pretrained model output, gradient-descent adaptation, LVA adaptation, and LVA with optimal transport; highlighted regions compare the reconstructed speech structure.
Fig. 6Speech enhancement, baby-cry noise at −1 dB: (a) clean, (b) noisy, (c) pretrained, (d) gradient descent, (e) LVA, (f) LVA-OT. LVA, Fig. 4.

Can unlabeled target data guide adaptation?

Discriminator-constrained optimal transport · NeurIPS 2021

We combine distribution coupling with an adversarial constraint for unsupervised speech adaptation. The underlying discrete transport problem is

\[ \min_{\gamma\in\Pi(\mu,\nu)}\langle C,\gamma\rangle. \] \[ \Pi(\mu,\nu)=\{\gamma\ge0:\gamma\mathbf1=\mu,\;\gamma^\top\mathbf1=\nu\}. \]

\(\mu\) and \(\nu\) are probability-weight vectors, \(C\) is a pairwise cost matrix, and \(\gamma\) is a coupling. The paper adds a discriminator constraint to the adaptation objective.

Two probability surfaces are linked by a transport coupling gamma, with marginal constraints written below.
ConceptA coupling \(\gamma\) preserves the source and target marginals. The paper adds a discriminator constraint to the adaptation objective; the illustrated surfaces and paths are schematic.

What forces determine a learned embedding?

Generalized stochastic neighbor embedding with alpha-divergence · IEEE Access 2024

The similarity metric, distribution kernel, and divergence determine the attraction and repulsion between embedded points. We derive these forces for generalized SNE:

\[ q_{ij}=\frac{1}{Z\,(\eta+r_{ij}^{\beta})}. \] \[ r_{ij}=\lVert y_i-y_j\rVert,\qquad \mathcal L=D_\alpha(P\Vert Q). \] \[ F_i=-\nabla_{y_i}\mathcal L=\sum_{j\ne i}\left(F_{ij}^{\mathrm{attr}}+F_{ij}^{\mathrm{rep}}\right). \]

\(y_i\) are latent points, \(\eta,\beta>0\), and \(Z\) normalizes the pairwise similarities. \(P\) and \(Q\) are source and embedding similarities. The expression shown uses Euclidean latent distance; the framework also studies more general metrics.

Attractive force as a function of distance for SNE, t-SNE and p-SNE.
Repulsive force as a function of distance for SNE, t-SNE and p-SNE.
Two-dimensional g-SNE embedding of MNIST digits with ten well-separated colored clusters.
Fig. 7Attractive and repulsive forces for SNE, t-SNE, and p-SNE; an MNIST embedding with \(\beta = 1.8\). g-SNE, IEEE Access 2024.

Related work on INSURE studies information-based feature disentanglement and purification for domain generalization.

§7Foundation

Gauge geometry and spacetime

FoundationPh.D. dissertation (2015) and papers in JCAP, Phys. Rev. D, Class. Quantum Grav., and Phys. Lett. B — with C.-Q. Geng, C.-C. Lee, L.-W. Luo, and C. Lai.

My doctoral work studied gravity through gauge geometry. Connections, curvature, torsion, and variational principles gave me a way to move between geometric structure and physical dynamics — and they remain the language in which I think about the problems above. The dissertation builds Poincaré gauge theory from its fibre-bundle formulation to the resulting Riemann–Cartan spacetime, then studies theories descended from it.

From bundles to spacetime

In Poincaré gauge theory the coframe \(e^a\) and the Lorentz connection \(\omega^a{}_b\) are independent fields. Their field strengths are the curvature and torsion two-forms, given by Cartan’s structure equations; the action \(S[e, \omega, \psi] = \int_M L\) is varied with respect to each separately.

\[ R^a{}_b \;=\; d\omega^a{}_b + \omega^a{}_c \wedge \omega^c{}_b, \qquad T^a \;=\; de^a + \omega^a{}_b \wedge e^b \] \[ g=\eta_{ab}\, e^a\otimes e^b,\qquad S[e,\omega,\psi]=\int_M L. \] \[ \frac{\delta S}{\delta e^a}=\frac{\delta S}{\delta\omega^{ab}}=\frac{\delta S}{\delta\psi}=0. \]

Frame indices \(a = 0,\dots,3\), \(\eta_{ab} = \mathrm{diag}(-1,1,1,1)\), and \(\omega_{ab} = -\omega_{ba}\) for a metric-compatible connection. The gauge group is the Poincaré group \(ISO(1,3) = \mathbb R^{1,3} \rtimes SO(1,3)\). Standard background, which the dissertation develops in full.

Scalar-torsion cosmology

I studied the cosmological dynamics of the scalar-torsion \(0^+\) mode in a quadratic Poincaré gauge model. In the positive-kinetic-energy case, the high-redshift analysis gives radiation-like asymptotic behavior for the effective torsion component:

\[ \rho_T=O\!\left(a^{-4}\right),\qquad w_T=\frac{p_T}{\rho_T}\longrightarrow\frac13. \]

High-redshift limit: \(a\ll1\), \(z\gg0\).

\(a\) is the scale factor, \(\rho_T\) and \(p_T\) the effective torsion density and pressure. A property of the studied theoretical model, not an observational claim about dark energy.

Torsion energy density ratio Omega_T against redshift z for three parameter sets; each dips at low z and rises toward about 0.9 at z = 10.
Torsion equation of state w_T against redshift z for three parameter sets; each oscillates at low z and settles toward one third at high z.
Fig. 9Torsion in an expanding universe. (a) Energy-density ratio \(\Omega_T\) and (b) equation of state \(w_T\) versus redshift, with \(\Omega^{(0)}_m = 25\%\) and \(\chi = 3.07\times10^{-4}\); three parameter sets \((\tilde a_0, \tilde a_1, \tilde H_0, \tilde R_0)\). Dissertation, Fig. 3.2.

Teleparallel gravity in five dimensions

Using differential forms, I studied five-dimensional teleparallel gravity and its dimensional reduction. The work compares braneworld and Kaluza–Klein constructions and identifies scalar–torsion couplings generated in the reduced theory.

A manifold with local frames branches into four upright compact circle fibers above a base manifold, and a hypersurface inside a higher-dimensional space.
ConceptKaluza–Klein and braneworld reductions of a five-dimensional theory. Here \(R[\omega]=0\) refers to the teleparallel connection; the spacetime metric can still have nonzero Levi-Civita curvature.

The equations in the opening

The opening displays standard identities and field equations from David Bleecker’s Gauge Theory and Variational Principles: curvature, the Bianchi identity, matter-field variation, Yang–Mills and Einstein equations, and the bundle metric.

Thm 2.2.4I.Structural equation \[ \Omega^\omega = d\omega + \tfrac12[\omega,\omega] \]

Curvature of a connection \(\omega\) on a principal bundle — the field strength.

Thm 2.2.8II.Bianchi identity \[ D^\omega \Omega^\omega = 0, \qquad d\Omega^\omega = [\Omega^\omega, \omega] \]

The homogeneous field equation, true for every connection.

Thm 4.3.6III.Lagrange’s equation \[ \delta^\omega\!\left[\frac{\partial L}{\partial(D^\omega\psi)}\right] + \frac{\partial L}{\partial\psi} = 0 \]

Stationary particle fields \(\psi\) for a fixed connection; \(\delta^\omega\) is the formal adjoint of \(D^\omega\).

Thm 9.3.3 (B)IV.Yang–Mills equation \[ \delta^\omega \Omega^\omega = 0 \]

Stationarity of the self-action \(\mathcal S(g,\omega) = -\tfrac12 (gk)(\Omega^\omega, \Omega^\omega)\) in \(\omega\).

Thm 9.3.3 (A)V.Einstein field equation with gauge source \[ \begin{gathered} \underline R_{ij}-\tfrac12\underline R\,g_{ij}-\tfrac c2\,g_{ij}\\ =\tfrac12\,g^{hm}k(\Omega_{hi},\Omega_{mj})+\tfrac12\,\mathcal S(g,\omega)\,g_{ij}. \end{gathered} \]

Stationarity of \(\int_U [\underline R(g) + \mathcal S(g,\omega) + c]\,\mu_g\) in the metric \(g\); \(k\) is an \(\mathrm{Ad}\)-invariant inner product on the Lie algebra.

Def. 9.3.4 · Thm 9.3.7VI.The bundle metric \[ h=\pi^*g+k\,\omega. \] \[ R_h=\underline R(g)+\mathcal S(g,\omega)+R_G. \]

The scalar curvature of the total-space metric decomposes into base curvature, gauge self-action, and fiber curvature. Here \(R_G\) is constant for the group metric used in this construction.

D. Bleecker, Gauge Theory and Variational Principles (Addison-Wesley, 1981; Dover reprint 2005). Equations newly typeset in the book’s notation; \(\underline R\) denotes the curvature functions of \(g\).

Other collaborations

Selected collaborative work in quantum algorithms and applications.

Energy systems

Quantum RL for power grids

Hybrid quantum soft actor-critic agents for transmission switching and Volt-VAR control, with SMU.

IEEE TPWRS · IEEE OAJPE · QCE 2025

Stochastic analysis

Quantum BSDE solvers

Variational-circuit approximations for high-dimensional parabolic PDEs, formulated through backward stochastic differential equations and tested in simulation.

QCE 2025 · arXiv 2026 · arXiv 2026

Quantum networks

Certifying entanglement

Fidelity bounds from CHSH violations, sample-complexity analysis, and verification protocols for hop-by-hop quantum networks.

QCE 2026

Photonics

Quantum-enhanced distillation

Photonic quantum circuits as teachers that distill knowledge into classical models.

arXiv 2026

04 Connections

Gauge symmetry and observable redundancy

Both settings distinguish a mathematical representation from the information it represents.

Gauge theory

A principal G-bundle over spacetime

P fibre ≅ G horizontal lift γ̃ π M curve γ
A connection ω says how to lift paths; curvature \(\Omega^\omega\) is the failure of lifts around loops to close.

Observable geometry

The unitary group over the orbit of an observable

U(N) fibre SOU — unseen circuit path U(θ) FO 𝒪O ≅ SO\U(N) U(θ)†O U(θ)
The measurement map is constant on fibres; only motion across them changes what is measured.

The shared structure is a projection that is constant along symmetry fibers. In observable geometry, the stabilizer of the chosen operator determines the quotient and its dimension. This is an operator-level redundancy: equality of a single state’s expectation value can introduce further, state-dependent degeneracies.

MethodGravity foundationLearning theoryQuantum program
GeometryBundles, coframes, curvature, torsionDistribution geometry and embeddingsObservable orbits and effective circuit directions
Symmetry & algebraGauge groups and local frame changesStructural constraints on representationsStabilizers, commutators, spectral freedom, code projectors
VariationIndependent coframe and connection variationLayer response and adaptationGate response, observable optimization, control
InformationFields and observables of a specified modelDivergences, useful features, domain shiftIdentifiability and measurement design
RealizationModel assumptions and cosmological predictionsData assumptions and numerical validationHardware constraints, physical noise, error protection
Shared questions and methods across the three areas.
variational principles local response, adaptation what measurements distinguish inference → protection bundles and group actions §7Gauge geometry& spacetime §6Geometry, information& learning §5Quantum algorithms& measurements §2AI for quantuminference & control §3Reliable quantumrealization GEOMETRY · SYMMETRY · VARIATION · INFORMATION Mathematical formation in gauge gravity and spacetime geometry the root: 2005 – 2015
Fig. 10Connections between the research areas. Dashed arcs indicate particular methodological links; chapter labels link to the corresponding sections. The error-correction note (§1) develops the topology–symmetry connection; the forward-model project (§4) applies learning to detector response.

05 Publications

Selected publications and preprints

A selection across quantum computing, learning, and gravitation. The full bibliography is on Google Scholar.

2026

  1. H.-H. Tseng, H.-Y. Lin, S. Y.-C. Chen, Y. M. Chan, T.-C. Wei, S. Yoo
    IEEE International Conference on Quantum Computing and Engineering (QCE 2026)
  2. H.-H. Tseng, Y. Li, H.-Y. Lin, S. Y.-C. Chen
    IEEE International Conference on Computer Communications and Networks (ICCCN 2026)
  3. X. D. Trinh, Z. Wu, J. Bai, H.-H. Tseng, N. Yu, A. Balasubramanian
    IEEE QCE 2026

2025

  1. H.-Y. Lin, H.-H. Tseng, S. Y.-C. Chen, S. Yoo
    IEEE International Conference on Quantum Computing and Engineering (QCE 2025)
  2. H.-H. Tseng, H.-Y. Lin, S. Y.-C. Chen, S. Yoo
    IEEE ICASSP 2025 Workshops
  3. H. Su, H.-H. Tseng
    IEEE QCE 2025

2024

  1. H.-Y. Lin, H.-H. Tseng, J.-T. Chien
    IEEE Access 12, 90380–90394
  2. X. Yu, H.-H. Tseng, S. Yoo, H. Ling, Y. Lin
    IEEE Transactions on Image Processing

2023

  1. H.-H. Tseng, H.-Y. Lin, K.-H. Hung, Y. Tsao
    International Conference on Learning Representations (ICLR 2023)
  2. T. Wang, H.-H. Tseng, S. Yoo
    Preprint
  3. R. Rofougaran, S. Yoo, H.-H. Tseng, S. Y.-C. Chen
    Preprint

2021

  1. H.-Y. Lin, H.-H. Tseng, X. Lu, Y. Tsao
    Advances in Neural Information Processing Systems (NeurIPS 2021)

2017

  1. H.-H. Tseng, Y. Luo, S. Cui, J.-T. Chien, R. K. Ten Haken, I. El Naqa
    Medical Physics 44, 6690–6705 Farrington Daniels Award 2018

2015

  1. H.-H. Tseng
    Ph.D. dissertation, National Tsing Hua University (June 2015); arXiv deposit 2018

2012

  1. H.-H. Tseng, C.-C. Lee, C.-Q. Geng
    Journal of Cosmology and Astroparticle Physics 11 (2012) 013

Medical-physics work from the University of Michigan (2016–2019) and further speech and signal-processing papers are listed on Google Scholar.

06 Experience

Experience, service, and teaching

  1. 2023 — present
    Research Scientist
    Brookhaven National Laboratory, Upton, NY
    Variational quantum algorithms and quantum computing; PI of the LDRD project on quantum-centric supercomputing.
  2. 2019 — 2022
    Senior Postdoctoral Fellow
    Academia Sinica, Taipei
    Physical interpretations of transfer learning via variational analysis; quantum machine learning; neural beamforming.
  3. 2016 — 2019
    Postdoctoral Fellow
    University of Michigan, Ann Arbor, MI
    Reinforcement learning for automated, response-adapted radiotherapy.
  4. 2015
    Ph.D. in Physics
    National Tsing Hua University, Hsinchu
    Dissertation: Gravitational Theories with Torsion. Lecturer in General Physics, 2010–2013; teaching assistant for General Relativity and Theoretical Mechanics.
  5. 2005
    B.S. in Mathematics
    National Tsing Hua University, Hsinchu

Organizing

  • 2026Quantum Machine Learning in Signal Processing and AI — ICASSP workshop
  • 2025Quantum Computing and Reinforcement Learning — IEEE QCE workshop
  • 2025Quantum ML in Signal Processing and AI — ICASSP workshop
  • 2025Quantum Computing for Communications and Learning — IEEE WCNC workshop
  • 2025Quantum ML for Communication Networks — IEEE ICC workshop
  • 2024Quantum Computing and Reinforcement Learning — IEEE QCE workshop
  • 2024Quantum Techniques for Signal Processing and ML — IEEE SiPS special session
  • 2024QML Algorithms and Applications — IEEE ICMLA special session

Mentoring at Brookhaven

  • 2025Cartan decompositions for circuit partitioning on quantum multichips; fault-tolerant VQCs with the Steane code
  • 2024Quantum neural architecture search; quantum autoencoders for high-energy physics; RL for charged-particle beam control; hybrid quantum networks for signals and medical imaging
  • 2023Quantum federated learning — differential privacy and quantum networks; quantum GANs

Teaching & tutorials

  • Hands-On Introduction to Quantum Machine Learning — tutorial
  • AIMS online AI/ML tutorial series; Rising STEM Scholars program on AI/ML

Reviewing

  • NeurIPS · ICML · ICLR · ICASSP · IEEE Trans. Quantum Engineering · IEEE Signal Processing Letters · IEEE/ACM Trans. Audio, Speech & Language Processing · Medical Physics · and others