Searcharxiv⌕ Search

arXiv subjects

Yu-An Chen

Publications and source records attributed to Yu-An Chen.

At least 19 recordsLinked to original sources

Higher-Group Statistics on Lattices

Crossing a domain wall can permute anyons, and intersecting strings can create a particle. These couplings between defects of various dimensions are specified by higher groups. We develop a lattice framework defining higher-group statistics as Berry phases of closed sequences of hopping operators, invariant under local modifications of the operators. Our central example is a closed Majorana chain, a 1-dimensional topological superconductor, embedded in 3 dimensions. We construct a loop-flip process with phase $+i$, refining the usual $\pm 1$ loop-flip invariant through intermediate transfer of fermion parity between the chain and physical fermions. In two dimensions, charge-wall statistics distinguish two $\mathbb Z_4$ toric codes enriched by $\mathbb Z_2$ charge-conjugation symmetry, with identical anyon statistics but distinct gauged theories: the quantum doubles of the dihedral group $D_4$ and the quaternion group $Q_8$. We provide two complementary constructions of statistical processes. The first extends the Smith normal form algorithm in [Phys. Rev. X $\textbf{16}$, 011010 (2026), arXiv:2412.01886] to higher groups, generating processes from lattice geometry and prescribed local moves. For a finite higher group $\mathbb G$, we prove that statistical processes on a $d$-sphere are classified by $H_{d+2}(B\mathbb G,\mathbb Z)$. The second constructs processes directly from homology classes without examining exponentially many defect configurations, enabling us to study statistics for complex higher-group structures where the previous method is computationally prohibitive. These processes detect boundary anomalies of higher-group symmetry-protected topological phases. For example, we distinguish 2-group anomalies in 1, 2, and 3 dimensions. Higher-group statistics provide new invariants for characterizing coupled defects in quantum many-body systems.

quant-ph↗

Generalized $\mathbb{Z}_p$ toric codes as qudit low-density parity-check codes

We study two-dimensional translation-invariant CSS stabilizer codes over prime-dimensional qudits on the square lattice under twisted boundary conditions, generalizing the Kitaev $\mathbb{Z}_p$ toric code by augmenting each stabilizer with two additional qudits. Using the Laurent-polynomial formalism, we adapt the Gröbner basis to compute the logical dimension $k$ efficiently, without explicitly constructing large parity-check matrices. We then perform a systematic search over various stabilizer realizations and lattice geometries for $p\in\{3,5,7,11\}$, identifying qudit low-density parity-check codes with the optimal finite-size performance. Representative examples include $[[242,10, \leq 22]]_3$ and $[[120,6, \leq 20]]_{11}$, both achieving $k d^{2}/n \leq 20$. Across the searched regime, the best observed $k d^{2}$ at fixed $n$ increases with $p$, with an empirical relation $k d^{2} = 0.0541 \, n^{2}\ln p + 3.84 \, n$, compatible with a Bravyi--Poulin--Terhal-type tradeoff when the interaction range grows with system size.

quant-ph↗

Defining 2-group symmetries on lattices and extracting their anomalies

Ordinary $0$-form symmetries $G$ can mix with $1$-form symmetries $Π_2$ to form a $2$-group $\mathcal{G}$. We give a concrete lattice definition for a class of finite $2$-group symmetries in terms of local relations among symmetry operators. These relations identify the Postnikov class $[ρ]\in H^3(BG,Π_2)$ that characterizes the mixing. We develop a method to extract anomalies of these symmetries in one spatial dimension by restricting symmetry operations to an interval and comparing their composition near its endpoints. We also construct explicit qubit symmetry actions in $d=1,2,3$ spatial dimensions for a $2$-group with $G=Π_2=\mathbb{Z}_2$. These actions share the same nontrivial Postnikov class but include both anomaly-free and anomalous realizations. Their cohomological anomalies are classified by $H^{d+2}(B\mathcal G,U(1))$, which is $\mathbb{Z}_2$ for $d=1,2$ and $\mathbb{Z}_2\times\mathbb{Z}_2$ for $d=3$, and our constructions realize every class in these dimensions. Our results connect higher-group symmetry and its anomalies to concrete lattice operations, providing a microscopic framework for studying anomalous symmetries.

quant-ph↗

Non-Clifford quantum cellular automata from invertible topological quantum field theories

Quantum cellular automata (QCAs) describe locality-preserving quantum dynamics and link quantum information, many-body physics, and topological quantum field theory (TQFT). Constructing a QCA from a TQFT, however, remains challenging: although a topological action yields a Hamiltonian with commuting terms that realizes the desired ground state, it does not by itself specify an automorphism of the full operator algebra. We develop a unified algebraic construction that extends such Hamiltonians to complete separator-flipper algebras on the full tensor-product Hilbert space, thereby defining the corresponding QCAs microscopically. In 3 spatial dimensions, our framework unifies all previously known QCA constructions associated with the $\mathbb{Z}_8\times\mathbb{Z}_2$ subgroup of the Witt group, including the $U(1)_2$ and $U(1)_4$ QCAs. The same algebraic structure yields new infinite families of generalized $U(1)_2$ and $U(1)_4$ non-Clifford QCAs in spatial dimensions $d=4k-1$. We also reformulate the 4-dimensional $w_2w_3$ QCA and use it to construct QCAs from TQFTs associated with arbitrary products of Stiefel--Whitney classes. For example, we explicitly construct two infinite families: $w_2^nw_3^m$ QCAs in dimension $d=2n+3m-1$ and $w_2w_{4k-1}$ QCAs in dimension $d=4k$. For the 5-dimensional $w_3^2$ and $w_2^3$ QCAs, our construction gives finite-depth quantum circuits, consistent with the cobordism classification. More generally, we show that our construction yields a finite-depth quantum circuit whenever the corresponding Stiefel-Whitney number vanishes on every closed oriented manifold. Overall, these results convert invertible TQFTs into microscopic QCAs, provide higher-dimensional constructions beyond the Clifford setting, and open a systematic route to characterizing their stable structures and boundary anomalies.

quant-ph↗

Anyonic membranes and Pontryagin statistics

Anyons, unique to two spatial dimensions, underlie extraordinary phenomena such as the fractional quantum Hall effect, but their generalization to higher dimensions has remained elusive. The topology of Eilenberg-MacLane spaces constrains the loop statistics to be only bosonic or fermionic in any dimension. In this work, we introduce the novel anyonic statistics for membrane excitations in four dimensions. Analogous to the $\mathbb{Z}_N$-particle exhibiting $\mathbb{Z}_{N\times \gcd(2,N)}$ anyonic statistics in two dimensions, we show that the $\mathbb{Z}_N$-membrane possesses $\mathbb{Z}_{N\times \gcd(3,N)}$ anyonic statistics in four dimensions. Given unitary volume operators that create membrane excitations on the boundary, we propose an explicit 56-step unitary sequence that detects the membrane statistics. We further analyze the boundary theory of $(5{+}1)$D 1-form $\mathbb{Z}_N$ symmetry-protected topological phases and demonstrate that their domain walls realize all possible anyonic membrane statistics. We then show that the $\mathbb{Z}_3$ subgroup persists in all higher dimensions. In addition to the standard fermionic $\mathbb{Z}_2$ membrane statistics arising from Stiefel-Whitney classes, membranes also exhibit $\mathbb{Z}_3$ statistics associated with Pontryagin classes. We explicitly verify that the 56-step process detects the nontrivial $\mathbb{Z}_3$ statistics in 5, 6, and 7 spatial dimensions. Moreover, in 7 and higher dimensions, the statistics of membrane excitations stabilize to $\mathbb{Z}_{2} \times \mathbb{Z}_{3}$, with the $\mathbb{Z}_3$ sector consistently captured by this process.

quant-ph↗

Invertible subalgebras for chiral semion topological order

Chiral topological order is incompatible with strictly two-dimensional local commuting-projector Hamiltonians on finite-dimensional tensor-product Hilbert spaces. Invertible subalgebras (ISAs) provide an alternative framework. We construct an ISA supporting chiral semions, together with its anti-semion commutant, on a square lattice with one qubit per edge. We give explicit non-Pauli generators for both algebras and prove that together they generate all local operators on the Hilbert space. Starting from the $\mathbb{Z}_4$ toric code, we condense the boson $e^2m^2$ and identify the semion and anti-semion algebras. We then decompose each $\mathbb{Z}_4$ qudit into two qubits and use a finite-depth circuit to disentangle one qubit per edge fixed by the condensation constraints. Pumping the semion ISA along the $z$ direction defines an explicit three-dimensional non-Clifford quantum cellular automaton (QCA). We show that pumping eight times is equivalent to a translation followed by a finite-depth quantum circuit with ancillary qubits. We also give an explicit finite-depth circuit relating this construction to the semion QCA previously obtained from topological quantum field theory. A similar condensation construction yields a $U(1)_4$ ISA on a square lattice. Together with the semion and earlier odd-prime ISAs, finite stacking realizes every pointed Witt class of bosonic Abelian anyon theories. Finally, we extend both constructions to all spatial dimensions $d=4k{-}2$, with one qubit or $\mathbb{Z}_4$ qudit on each $(2k{-}1)$-cell for the semion or $U(1)_4$ ISA, respectively.

quant-ph↗

On the Statistical Mechanics of Attention

We revisit the statistical mechanics of Transformer attention via modern Hopfield models. We present a free-energy formalism to characterize parameter regimes and critical thresholds for robust attention inference. The resulting free-energy landscape incorporates randomness in query states and attention weights. Attention then emerges as the equation of motion of the corresponding statistical-mechanical system (i.e., modern Hopfield model) through the standard free-energy minimization principle. This allows us to identify first-order phase transitions in attention between glassy and robust-inference phases. We further extend to attentions with stochastic queries and keys. Together, our results provide a rigorous statistical-mechanics framework for characterizing phase structure and inference reliability across a family of Transformer attention mechanisms.

cs.LG↗

Majorana-Pauli stabilizer codes and duality webs of fermionic topological phases

Stabilizer codes provide exact lattice realizations of bosonic topological orders. In contrast, systematic stabilizer descriptions of intrinsically fermionic topological phases remain much less developed. In this work, we introduce Majorana-Pauli stabilizer codes, a class of exactly solvable fermionic lattice models whose stabilizers are built from both generalized Pauli operators and Majorana operators. As a main example, we construct an exactly solvable stabilizer realization of the fermionic toric code: an intrinsically fermionic $\mathbb Z_2$ topological order in $(2{+}1)$ dimensions, using $\mathbb Z_8$ Pauli operators coupled to Majorana modes. Within this stabilizer framework, the anyons, string operators, fusion rules, and braiding statistics all follow naturally from the stabilizer algebra. More broadly, we show that the fermionic toric code belongs to a duality web generated by anyon condensation and by gauging or ungauging bosonic or fermionic symmetries. This web connects bosonic topological orders, symmetry-enriched topological (SET) phases, and both bosonic and fermionic symmetry-protected topological (SPT) phases, all within a common stabilizer description. We extend this construction to all Abelian fermionic topological orders with gapped boundaries and to fermionic SPT phases whose fully gauged theories are Abelian. Going beyond Majorana operators, we introduce fermionic versions of the clock and shift operators and use them to construct an exact bosonization map for $\mathbb Z_D^F$ symmetries for $D$ even. Using this, we realize a stabilizer model for a nontrivial $\mathbb Z_8^F$ fermionic SPT phase with no free-fermion analog. Altogether, these results extend the stabilizer-code paradigm to a broad class of intrinsically fermionic phases bridging fermionic quantum many-body physics to quantum error correction.

quant-ph↗

Ultra-high-distance quantum memories from amplified qLDPC codes

A large code distance does not by itself guarantee a well-protected quantum memory, as faults during syndrome extraction can propagate into correlated data errors. Certifying circuit distance becomes demanding as circuits grow. In this work, we introduce distance amplifiers, a modular approach to increasing both code distance and certified circuit-level protection in quantum low-density parity-check codes. The construction tensors a base code with an amplifier, adapting their syndrome-extraction circuits to the amplified code. To certify the resulting memory, we develop a fault-response certificate that yields rigorous lower bounds on circuit distance. Suitable gate ordering and flag qubits control correlated errors, allowing us to establish explicit conditions under which the amplified circuit distance equals the product of the constituent circuit distances. We prove this multiplicative relation for three types of amplifiers: the flagged $[[4,2,2]]$, hypergraph-product, and rotated surface codes. The certificate extends recursively, so the circuit distance multiplies exactly at every amplification step. For example, four successive applications of the flagged $[[4,2,2]]$ amplifier to a $[[18,4,4]]$ seed yield a $[[13320,64,64]]$ code with the circuit distance $d_{\mathrm{circ}} \geq 48$ and check weights $w \leq 14$. We further show how individual logical qubits can be tracked explicitly through amplification. By enabling high-distance quantum memories to be built and certified from smaller building blocks, our framework offers a systematic route toward scalable fault-tolerant quantum computing.

quant-ph↗

Nonperturbative Stabilization of D-Instantons in the Bosonic IIB Matrix Model

We study the bosonic type IIB (IKKT) matrix model and the fate of the D-instanton positions $p^{(i)}_μ$, the diagonal components of the $d$ Hermitian matrices, whose one-loop effective potential infamously drives them to a single point. We show that this collapse is an artifact of the leading (one-loop) truncation, while the actual non-collapse of the $p^{(i)}_μ$ is a nonperturbative effect: it is invisible at one loop but already present in the exact (all-loop) two-body interaction. Since the two-body sector of the $N\times N$ model factorizes into copies of $N=2$, this interaction is captured exactly by the $\mathrm{U}(2)$ model, and we find that the two D-instantons do not collapse onto each other. To set up the computation, we gauge-fix the $\text{U}(N)$ symmetry in a way that keeps the diagonal and off-diagonal sectors distinct, and we handle the residual $\mathrm{U}(1)^N$ symmetry with an auxiliary-ghost BRST construction. This construction generates a new ghost four-leg vertex; the resulting Faddeev-Popov determinant admits a systematic large-separation expansion that organizes the effective potential into a many-body decomposition, separating the interaction into two-body, three-body, and higher-body contributions. The exact $N=2$ partition function is finite at finite separation; its naive Lorenz-gauge form develops a negative region at separations of order one, which we trace to a Gribov ambiguity of the Lorenz gauge and resolve with the maximal diagonal gauge--the classical frame containing the perturbative vacuum--where the short-distance force is finite and repulsive, so that the two-body potential develops a stable minimum at finite separation. These results are consistent with a stable, non-collapsed distribution of the $p^{(i)}_μ$; establishing the detailed distribution and full $N$-body non-collapse requires the higher-body potentials and is left to future work.

hep-th↗

CellSecInspector: Safeguarding Cellular Networks via Automated Security Analysis on Specifications

The complexity, interdependence, and rapid evolution of 3GPP specifications present fundamental challenges for ensuring the security of modern cellular networks. Manual reviews and existing automated approaches, which often depend on rule-based parsing or small sets of manually crafted security requirements, fail to capture deep semantic dependencies, cross-sentence/clause relationships, and evolving specification behaviors. In this work, we present CellSecInspector, an automated framework for security analysis of 3GPP specifications. CellSecInspector extracts structured state-condition-action (SCA) representations, models mobile network procedures with comprehensive function chains, systematically validates them against 9 foundational security properties under 4 adversarial scenarios, and automatically generates test cases. This end-to-end approach enables the automated discovery of vulnerabilities without relying on manually predefined security requirements or rules. Applying CellSecInspector to the well-studied 5G and 4G NAS and RRC specifications and selected sections of TS 23.501 and TS 24.229, it discovers 43 vulnerabilities, 7 of which are previously unreported. Our findings show that CellSecInspector is a scalable, adaptive, and effective solution to assess 3GPP specifications for safeguarding operational and next-generation cellular networks.

cs.CR↗

Bockstein braiding statistics

Braiding phenomena, from the charge-flux Aharonov-Bohm effect to anyonic statistics in fractional quantum Hall systems, are paradigmatic manifestations of topology in quantum physics. Ordinary mutual braiding between $p$- and $q$-dimensional excitations occurs in $d=p+q+2$ spatial dimensions. In this work, we introduce a universal construction of mutual statistics in the adjacent dimension $d=p+q+1$, applicable to excitations obeying $\mathbb Z_N$ fusion for arbitrary $N$ and all excitation dimensions $p$ and $q$. The corresponding invariant is the Berry phase accumulated in a simple $4N$-step microscopic unitary process built from local excitation operators on lattices. This process measures the linking of one excitation with the $N$-fold fusion junction of the other, encompassing particle-particle statistics in one dimension, particle-loop statistics in two dimensions, and loop-loop or particle-membrane statistics in three dimensions. We establish the quantization and bilinearity of the invariant and show that its field-theory response is governed by the Bockstein homomorphism, motivating the name Bockstein braiding statistics. Interpreting the excitation operators as open symmetry operators turns the same invariant into a direct microscopic diagnostic of mixed anomalies between symmetries. We demonstrate this diagnostic in a (1+1)D spin chain, where the nontrivial Bockstein braiding phase proves the mixed anomaly between the spin-flip symmetry $\prod X$ and the nearest-neighbor controlled-$Z$ symmetry $\prod CZ$. We construct explicit (2+1)D and (3+1)D lattice analogs, yielding new anomalous symmetry pairs, and apply the framework to strongly coupled (3+1)D continuum gauge theories. Nontrivial Bockstein braiding rules out a fully symmetric gapped phase, obstructs simultaneous condensation of the two excitations, and implies fractionalization of higher-form symmetries.

quant-ph↗

Pauli stabilizer formalism for topological quantum field theories and generalized statistics

Topological quantum field theory (TQFT) provides a unifying framework for describing topological phases of matter and for constructing quantum error-correcting codes, playing a central role across high-energy physics, condensed matter, and quantum information. A central challenge is to formulate topological order on lattices and to extract the properties of topological excitations from microscopic Hamiltonians. In this work, we construct new classes of lattice gauge theories as Pauli stabilizer models, realizing a wide range of TQFTs in general dimensions. We develop a lattice description of extended excitations and systematically determine their generalized statistics. Our main example is the (4+1)D fermionic-loop toric code, obtained by condensing the $e^2m^2$-loop in the (4+1)D $\mathbb Z_4$ toric code. We show that the loop excitation exhibits fermionic loop statistics: the 24-step loop-flipping process yields a phase of $-1$. Our Pauli stabilizer models realize all twisted 2-form gauge theories in (4+1)D, the higher-form Dijkgraaf-Witten TQFT classified by $H^5(B^2G,U(1))$. Beyond (4+1)D, the fermionic-loop toric codes form a family of $\mathbb Z_2$ topological orders in arbitrary dimensions, realized as explicit Pauli stabilizer codes using $\mathbb Z_4$ qudits. Finally, we develop a Pauli-based framework that defines generalized statistics for extended excitations in any dimension, yielding computable lattice unitary processes to detect nontrivial statistics. For example, we propose anyonic membrane statistics in (6+1)D, as well as fermionic membrane and volume statistics in arbitrary dimensions. We construct new families of $\mathbb Z_2$ topological orders: the fermionic-membrane toric code and the fermionic-volume toric code. In addition, we demonstrate that $p$-dimensional excitations in $2p+2$ spatial dimensions can support anyonic $p$-brane statistics for only even $p$.

quant-ph↗

Operator algebra and algorithmic construction of boundaries and defects in (2+1)D topological Pauli stabilizer codes

Quantum low-density parity-check codes, such as the Kitaev toric code and bivariate bicycle codes, are often defined with periodic boundary conditions, which are difficult to realize in physical systems. In this paper, we present an algorithm for constructing all gapped boundaries and defects of two-dimensional Pauli stabilizer codes. Using the operator algebra formalism, we establish a one-to-one correspondence between the topological data, such as anyon fusion rules and topological spins, of two-dimensional bulk stabilizer codes and one-dimensional boundary anomalous subsystem codes. To make the operator algebra computationally accessible, we adapt Laurent polynomials and convert the tasks into matrix operations, e.g., the Hermite normal form for obtaining boundary anyons and the Smith normal form for determining fusion rules. This approach enables computers to automatically generate all possible gapped boundaries and defects for topological Pauli stabilizer codes through boundary anyon condensation and topological order completion. This streamlines the analysis of surface codes and associated logical operations for fault-tolerant quantum computation. Our algorithm applies to $\mathbb{Z}_d$ qudits for both prime and nonprime $d$, enabling exploration of topological phases beyond the Kitaev toric code. We have applied the algorithm and explicitly demonstrated the lattice constructions of 2 boundaries and 6 defects in the $\mathbb{Z}_2$ toric code, 3 boundaries and 22 defects in the $\mathbb{Z}_4$ toric code, 1 boundary and 2 defects in the double semion code, 1 boundary and 22 defects in the six-semion code, 6 boundaries and 270 defects in the color code, and 6 defects in the anomalous three-fermion code. Finally, we study the boundaries of bivariate bicycle codes, showing that they exhibit large logical dimensions and anyons with long translation periods.

quant-ph↗

Topological subsystem bivariate bicycle codes with four-qubit check operators

High-rate bivariate bicycle (BB) codes are promising low-overhead quantum memories, but their stabilizer checks typically have weight $6$ or higher, making syndrome extraction challenging. We introduce subsystem bivariate bicycle (SBB) codes, a translation-invariant CSS subsystem construction that realizes BB-code logical structure using local weight-$4$ gauge measurements. Their stabilizer syndromes are inferred by multiplying the corresponding gauge outcomes. We further show that nonlocal stabilizers in translation-invariant CSS subsystem codes can be detected using a determinantal-ideal criterion based on the gauge-operator commutation matrix. When this criterion excludes nonlocal stabilizers, a finite-depth Clifford circuit decouples gauge qubits and identifies the protected subsystem with a corresponding BB stabilizer code. An SBB code is topological, meaning that it has no nontrivial local logical operators, if and only if the corresponding BB code is topological. A finite search yields low-overhead examples including $[[27,6,3]]$, $[[75,10,5]]$, and $[[108,12,6]]$; the latter encodes six times more logical qubits than a subsystem surface code at the same block length and distance. These results show how gauge degrees of freedom can make high-rate BB logical structure compatible with local weight-$4$ syndrome extraction.

quant-ph↗

Resolving spurious topological entanglement entropy in stabilizer codes

Topological entanglement entropy (TEE) is a key diagnostic of long-range entanglement in two-dimensional gapped phases of matter, but it can suffer from spurious contributions that overestimate the total quantum dimension of the underlying topological order. In this work, we identify the microscopic origin of spurious TEE and introduce a concave partition for computing the Levin-Wen TEE of translation-invariant stabilizer codes of prime-dimensional qudits. We rigorously prove that this prescription is free of spurious contributions. As a complementary probe, we study bivariate bicycle codes on a bipartite cylinder and show that the entanglement entropy depends sensitively on the cylinder circumference, revealing topological frustration of the underlying anyons.

quant-ph↗

Clifford quantum cellular automata from topological quantum field theories and invertible subalgebras

We present a general framework for constructing quantum cellular automata (QCA) from topological quantum field theories (TQFT) and invertible subalgebras (ISA) using the cup-product formalism. This approach explicitly realizes all $\mathbb{Z}_2$ and $\mathbb{Z}_p$ Clifford QCAs (for prime $p$) in all admissible dimensions, in precise agreement with the classification predicted by algebraic $L$-theory. We determine the orders of these QCAs by explicitly showing that finite powers reduce to the identity up to finite-depth quantum circuits (FDQC) and lattice translations. In particular, we demonstrate that the $\mathbb{Z}_2$ Clifford QCAs in $(4l{+}1)$ spatial dimensions can be disentangled by non-Clifford FDQCs. Our construction applies beyond cubic lattices, allowing $\mathbb{Z}_2$ QCAs to be defined on arbitrary cellulations. Furthermore, we explicitly construct invertible subalgebras in higher dimensions, obtaining $\mathbb{Z}_2$ ISAs in $2l$ spatial dimensions and $\mathbb{Z}_p$ ISAs in $(4l{-}2)$ spatial dimensions. These ISAs give rise to $\mathbb{Z}_2$ QCAs in $(2l{+}1)$ dimensions and $\mathbb{Z}_p$ QCAs in $(4l{-}1)$ dimensions. We further prove that the QCAs in $3$ spatial dimensions constructed via TQFTs and ISAs are equivalent by identifying their boundary algebras, and show that this approach extends to higher dimensions. Together, these results establish a unified and dimension-periodic framework for Clifford QCAs, connecting their explicit lattice realizations to field theories.

math.QA↗

InterPilot: Exploring the Design Space of AI-assisted Job Interview Support for HR Professionals

Recruitment interviews are cognitively demanding interactions in which interviewers must simultaneously listen, evaluate candidates, take notes, and formulate follow-up questions. To better understand these challenges, we conducted a formative study with eight HR professionals, from which we derived key design goals for real-time AI support. Guided by these insights, we developed InterPilot, a prototype system that augments interviews through intelligent note-taking and post-interview summary, adaptive question generation, and real-time skill-evidence mapping. We evaluated the system with another seven HR professionals in mock interviews using a within-subjects design. Results show that InterPilot reduced documentation burden without increasing overall workload, but introduced usability trade-offs related to visual attention and interaction complexity. Qualitative findings further reveal tensions around trust and verification when AI suggests highly specific technical questions. We discuss implications for designing future real-time human-AI collaboration in professional settings, highlighting the need to balance assistance granularity, attentional demands, and human agency.

cs.HC↗