Papers

We present a detailed computational and algebraic study of Mutually Unbiased Bases (MUBs) in finite-dimensional Hilbert spaces, with a particular focus on dimensions 2, 3, 4, and the challenging case of 6. Starting from the Hadamard-phase parametrization, we derive explicit analytical conditions for mutual unbiasedness in dimension 4, providing a tractable system of trigonometric constraints on the phase parameters. We then explore a tensor-product construction via Pauli operators, highlighting the algebraic and group-theoretical origin of MUBs in two-qubit systems, and demonstrating how these constructions yield a complete set of 5 MUBs in dimension 4. Extending our approach, we investigate the Fourier-family method in dimension 6, where the absence of a prime-power structure imposes strong rigidity constraints and limits the known constructions to sets of 3 MUBs. We provide a systematic computational framework for testing candidate phase vectors, bridging the gap between analytical insight and numerical exploration. Finally, we generalize the discussion to arbitrary prime-power dimensions, emphasizing the role of finite-field structures, Heisenberg-Weyl operators, and discrete symmetries in generating complete sets of MUBs. Our work offers a transparent, line-by-line verification methodology, highlighting both the geometric and algebraic richness of MUBs, and clarifying why certain dimensions resist full analytical constructions. This study serves as a comprehensive resource for researchers seeking both theoretical understanding and practical construction of MUBs in quantum information science.

We investigate the quantum algorithms for dynamic programming by Ambainis et al. (SODA'19). While giving provable complexity speedups and applicable to a variety of NP-hard problems, these algorithms have a notable drawback: they require a large amount of Quantum Random Access Memory (QRAM), which potentially could be very challenging to implement in a physical quantum computer. In this work, we study how we can improve the space complexity by trading it for time, while still retaining a speedup over the classical algorithms. We show novel quantum time-space tradeoffs by combining different classical approaches with quantum techniques. For instance, we show that the Travelling Salesman Problem can be solved quantumly in $\widetilde O(1.859^n)$ time and $\widetilde O(1.315^n)$ QRAM space.

Ultra-narrow-linewidth lasers with suppressed high-frequency phase noise are critical for quantum control and precision metrology. While optical phase locking (OPL) is the standard technique for cloning the coherence of such sources, its effectiveness is often limited at high frequencies by feedback latency. We present a robust feedforward architecture that overcomes this limitation by recycling and demodulating the existing master-slave beat signal to drive a single electro-optic modulator for near-instantaneous noise cancellation. This approach eliminates the extraneous sidebands and transmission losses typical of more complex modulators. Through active stabilization of the beat amplitude and demodulation phase, we demonstrate robust suppression exceeding 30 dB from 10 kHz to 10 MHz. This hardware-efficient framework is readily compatible with standard OPL setups, offering a scalable solution for high-fidelity coherent control.

Applications of quantum mechanics have led to many successful predictions and explanations of puzzling phenomena, and we now apply quantum mechanics to gain, process, and communicate information in novel ways. We can understand quantum mechanics by understanding how we have applied it. We should not seek agreement on the nature of the world it represents, because this theory does not itself represent the physical world (though its applications do help us to represent it better). When applied to a quantum state, quantum mechanics yields probabiities for physical events: both state and probability are objective–not because they represent elements of phyiscal reality, but because each exerts norrmative authority over the beliefs of anyone who accepts quantum mechanics and applies it relative to a physical situation they may (but need not) occupy. These events may be described by statements that are meaningful in an appropriate environmental context, and quantum mechanics can help one to say when that is. Measurement creates an appropriate context, so here the Born rule indirectly yields probabilities of measurement outcomes. The quantum state of a system does not "collapse" on measurement: a new state must be assigned relative to a physical situation in which information about the outcome is accessible. Understood this way, there is no measurement problem, and violations of Bell inequalities does not demonstrate "spooky" non-local action. Quantum field theories have no physical ontology of their own: a quantum field is a mathematical object in a model whose application helps us to improve and extend our descriptions of the world in other terms. We cannot realise the scenario of Wigner's friend and its recent extensions: but the data that provide overwhelming evidence for quantum mechanics are objective in the same sense as the relative measurement outcomes described in those scenarios.

Powerful approaches to squeeze the motional state of a harmonic oscillator rely on the stepwise modulation of its resonance frequency. Such protocols can be limited by forces that vary slowly between experimental runs but are constant during a single experimental shot. Such shot-to-shot noise gives rise to a spread in experimental outcomes that masks the uncertainty intrinsic to quantum theory. Taking inspiration from spin-echo protocols, we propose a decoupling technique that, under ideal conditions, perfectly cancels shot-to-shot force noise in squeezing experiments based on parametric modulation. We implement the protocol using an optically levitated nanoparticle, where shot-to-shot force noise arises from slowly varying stray fields acting on the charge carried by the particle. Using our oscillator-echo protocol, we demonstrate shot-to-shot noise suppression to the measurement-backaction limit.

I present a protocol that converts |E| elementary two-qubit resource states, one per edge of a target graph G=(V,E), into the distributed graph state |G> using only operations local to each party and classical communication, reaching arbitrary graph topologies rather than the GHZ class of prior walk-based schemes. The elementary step is obtained from the coined discrete-time quantum walk by replacing the position-permuting shift with a diagonal CZ gate, the phase quantum walk (PQW); on each edge it realises the entanglement-assisted non-local CZ gate. Because every gate and correction is diagonal, all edges run in a single round with the local correction C_v = Z_v^{g_v}, verified exhaustively on 22 connected graphs (32,212 outcomes) at F = 1.0. The central result is an exact fidelity theory under independent Pauli noise on the resource qubits, with a separate channel on each. When the noise acts after the local gate, the fidelity factorises over vertices; for depolarising noise F* = prod_v [1 + (1 - 4p/3)^{deg v}]/2, with the degree sequence entering only at second order. When it acts on the stored pair, as link-generation, transmission and storage noise does, it becomes an edge-cover partition function, F* = 2^{-|V|} sum_{S subset V} (1 - 4p/3)^{2|E(S)|}, bounded above by the vertex product and with a leading-order loss coefficient 3/2 times larger. Dephasing gives the same fidelity at both placements. On ibm_kingston, direct fidelity estimation certifies F = 0.815(3) for |L_4>, 0.776(3) for |GHZ_4> and 0.733(3) for |C_4>. Native SWAP-free execution at coupling girth gamma requires target girth at least gamma/3 and maximum degree at most 3; on heavy-hex this forbids triangles, though |K_4>, being LC-equivalent to a star, remains reachable.

Q2NS is an open-source quantum network simulator built on ns-3, the de facto standard for classical network simulation. By inheriting ns-3's mature classical stack and event-driven execution model, Q2NS enables faithful co-simulation of quantum-network dynamics and classical signaling, a core requirement for the functioning of any quantum network. Its modular architecture is designed for extensibility, with pluggable quantum-state backends (state-vector, density matrix, stabilizer) and a clean separation between network control and node-level operations. Q2NS comes with a quantum network visualizer Q2NSViz, supporting interactive inspection of both physical- and entanglement-induced connectivity graphs, helping users interpret protocol behavior and entanglement manipulation processes. We present a demonstration of Q2NS, highlighting its ability to capture and simulate the coexistence of quantum and classical communication. The proposed demonstration presents quantum communication scenarios of increasing complexity: from entanglement distribution basics to multipartite graph-state manipulation, complemented by pre-loaded examples in Q2NSViz that require no prior quantum communication or coding experience.

The Quantum Approximate Optimization Algorithm (QAOA) is a leading hybrid heuristic for combinatorial optimization, but efficiently handling hard constraints remains a significant challenge. XY-mixers successfully confine quantum state evolution to a feasible subspace, such as the Hamming-weight-1 sector for one-hot constraints. On the contrary, warm-starting biases the search toward promising regions based on preliminary solutions. Combining these two techniques requires maintaining the essential alignment between the initial state and the mixer Hamiltonian to preserve convergence guarantees. Previous work demonstrated warm-starting with XY-mixers via a biased initial state, but relying only on standard mixer Hamiltonians. Consequently, the initial state is no longer a ground state of the mixer. In this work, we overcome these limitations by formulating a warm-started XY-mixer Hamiltonian for one-hot constraints and proving its ground-state properties. Furthermore, we provide a shallow circuit implementation suitable for NISQ implementations. We embed the warm-starting into a classical heuristic that iteratively updates the bias based on previous samples, called Iterative Warm-Starting (IWS). Extensive numerical simulations on Max-$k$-Cut and Traveling Salesperson Problem instances demonstrate that IWS-QAOA significantly accelerates the solution-finding process, increasing the probability of sampling optimal solutions by orders of magnitude compared to standard XY-QAOA. Finally, we validate our approach on the ibm_boston QPU using hardware-tailored 144-qubit problem instances. By coupling IWS-QAOA with a greedy steepest-descent post-processing strategy to repair infeasible measurements caused by hardware noise, we successfully identify optimal solutions on actual quantum devices.

Quantum information processing, communication, and sensing networks are being developed with various qubit platforms that use different encoding schemes. Connecting quantum network nodes to distribute entanglement requires matching photon qubit basis encoding. In this work, we implement an interconversion protocol which converts photon qubit encoding from the polarization basis to the time-bin basis, transmits the photons through a transport fiber with large fluctuations in polarization, and converts back to polarization encoding for ease of measurement. This interconversion scheme faithfully transmits a polarization Bell state across the transport fiber by converting sources of infidelity to changes in transmission rate. These results illustrate a practical approach for interfacing distinct qubit platforms to enable modular and flexible operation in heterogeneous quantum networks.

The quantum information content of Hawking radiation holds the key to understanding black-hole evaporation and the fate of unitarity. Motivated by recent advances in cold-atom experiments, we develop a lattice-regularization approach aimed at simulating the coarse-grained entanglement scaling of a quantum field in a 1+1D analogue black-hole background. We provide the first concrete demonstration that logarithmic negativity – an entanglement monotone that typically exhibits a UV-divergent log-scaling for the conformal vacuum – acquires a UV-finite volume term from the nonlocal correlations seeded by Hawking radiation. We show that this volume term encodes the number density as well as the spatial distribution of entangled Hawking pairs along the black-hole interior and exterior. We highlight its prospective detection in currently realizable experiments and its implications beyond the analogue paradigm, in particular for black-hole thermodynamics.

We provide here a universal approximation theorem with precise quantitative error bounds for noisy quantum neural networks. We focus on applications to Quantitative Finance, where target functions are often given as expectations. We further provide a detailed numerical analysis, testing our results on actual noisy quantum hardware.

We demonstrate that strong-field ionization of atoms in circularly polarized laser fields generates a photoelectron spin texture with toroidal topology in momentum space. Using time-dependent Schrödinger equation simulations, spin-resolved classical-trajectory Monte Carlo calculations, and an extended spin-resolved strong-field approximation including intermediate excitation pathways, we show that the rotation angle of this spin torus provides access to attosecond relative time delays associated with photoelectron wave packets released by tunneling from the counter-rotating and co-rotating \(p\)-orbital channels. When intermediate-state dynamics become significant, the torus develops a clear splitting. These results establish photoelectron spin textures as a complementary source of dynamical information beyond conventional momentum spectroscopy, and identify spin polarization as a robust internal degree of freedom for self-referenced attosecond metrology.

Auxiliary Field Quantum Monte Carlo (AFQMC) has emerged as a powerful framework for treating strongly correlated electronic systems, offering a favorable balance between computational cost and accuracy. In this paper, we present a novel AFQMC method that uses the isometric tensor hypercontraction (ITHC) technique to diagonalize the two-body Coulomb interaction of molecular electronic Hamiltonians by introducing additional fictitious fermionic modes. Our method shows reduced theoretical complexity and better practical performance for both propagation and local energy evaluation compared to the standard AFQMC method. We demonstrate the efficacy of this approach by computing the ground-state energies of a linear $\ce{H10}$-chain and the benzene molecule. Our results show that the extended-basis AFQMC recovers many-body correlations with a precision comparable to that of high-level wavefunction methods such as Coupled Clusters (CC) or Density Matrix Renormalization Group (DMRG), while offering significantly improved scaling.

Topological codes have many desirable properties that allow fault-tolerant quantum computation with relatively low overhead. A core challenge for these codes, however, is to achieve a low-overhead universal gate set with limited connectivity. In this work, we explore a non-Pauli stabilizer code that can be used to complete a universal gate set on topological toric and surface codes in strictly two dimensions. Fault-tolerant syndrome extraction for the non-Pauli code requires mid-circuit $X$ corrections, a key difference to conventional Pauli codes. We construct and benchmark a just-in-time (JIT) matching decoder to reliably decide these corrections. Under a phenomenological error model with equally likely physical and measurement errors, we find a high threshold of $\approx 2.5\,\%$, close to the $\approx 2.9\,\%$ of a decoder with access to the full syndrome history. We also perform a finite-size scaling analysis to estimate how the logical error rate scales below threshold and verify an exponential suppression in both physical error rate and in the system size. A second global decoding step for $Z$ errors is required and the non-Clifford gates in the circuit reduce the threshold from $\approx 2.9\,\%$ to $\approx 1.8\,\%$ with a naive decoder. We show how $Z$ decoding can be improved using knowledge of the $X$ corrections, pushing the threshold to $\approx 2.2\,\%$. Our results suggest non-Clifford logic in 2D codes could perform comparably to 2D quantum memory. Our formalism for efficient benchmarking and decoding directly generalizes to a broader family of CSS codes whose $X$ stabilizers are twisted by diagonal Clifford operators, and spacetime versions thereof, defined by CSS-like circuits enriched by $CCZ$, $CS$, and $T$ gates.

We introduce a novel quantum algorithm for similar subgraph identification in form of an NP-hard cardinality-constrained binary quadratic optimization problem. Given a weighted reference graph with Laplacian $\boldsymbol{B}$, our algorithm determines the subgraph featuring Laplacian $\boldsymbol{B'}$ on the same vertex set, but $x$ out of $N$ inactive edges, minimizing the Frobenius distance $||\boldsymbol{B} - \boldsymbol{B'}||_\mathrm{F}^2$. We represent the $\binom{N}{x}$ graph topologies by an equal-weight superposition in form of a Dicke state, enabling controlled transformations applied to the quantum state associated with the vectorized Laplacian of the reference graph. Combined with amplitude estimation and a minimum finding approach, our algorithm provides a polynomial speed up $\mathcal{O}(\sqrt{N^{x}/x!}N\log\log N)$ compared to $\mathcal{O}(N^{x+1}/x!)$ of classical brute-force search algorithms. We demonstrate the application of our method on standard test cases, which represent electric power grids, by reconstructing $||\boldsymbol{B} -\boldsymbol{B'}||_\mathrm{F}^2$ from measurements and show how our approach can be additionally used to calculate energy functional like quadratic forms of the Laplacians with respect to a given vector.

I take a pragmatist perspective on quantum theory. This is not a view of the world described by quantum theory. In this view quantum theory itself does not describe the physical world, nor our observatons, experiences or opinions of it. Instead, the theory offers reliable advice on when to expect an event of one kind or another, and on how strongly to expect each possible outcome of that event. The actual outcome is a perspectival fact: a fact relative to a physical context of assessment. Measurement outcomes and quantum states are both perspectival. By noticing that each must be relativized to an appropriate physical context one can resolve the measurement problem and the problem of nonlocal action. But if the outcome of a quantum measurement is not an absolute fact, then why shoud the statistics of such outcomes give us any objective reason to accept quantum theory? One can describe extensions of the scenario of Wigner's friend in which a statement expressing the outcome of a quantum measurement would be true relative to one such context but not relative to another. However, physical conditions in our world prevent us from realizing such scenarios. Since the outcome of every actual quantum measurement is certified at what is essentially a single context of assessment, the outcome relative to that context is an objective fact in the only sense that matters for science. We should accept quantum theory because the statistics these outcomes display are just those it leads us to expect.

Entangled photon pair sources are a key enabling technology for quantum communication and networking, yet their deployment beyond laboratory environments is hindered by system-level complexity, limited operational stability, and insufficient industry compatibility. Here, we demonstrate a rack-based, mobile quantum light source architecture based on a semiconductor quantum dot emitter that directly addresses these challenges through modular system integration and automated operation. The source generates polarization-entangled photon pairs with an entanglement negativity 2n of up to $0.98(1)$, confirming near-maximal entanglement quality. In continuous, hands-off operation over a six-hour time window, the system achieves an average single-photon emission rate of $697(8)$ kHz and a maximum rate of $740(7)$ kHz, while maintaining 2n-value of more than $95$ $\%$. These results are enabled by the integration of optical excitation, collection, cryogenic operation, and control electronics within a standardized rack footprint, together with automated monitoring. By demonstrating simultaneously high entanglement quality, sustained brightness, and long-term operational stability in an industry-aligned system architecture, this work advances semiconductor quantum dot sources toward deployable entangled photon sources for applied quantum photonics.

We present a large-scale experimental study of quantum-computing-based molecular simulation carried out on IQM's Sirius 24-qubit superconducting processor, utilizing up to 16 operational qubits. The work employs Sample-based Quantum Diagonalization (SQD) together with the Local Unitary Cluster Jastrow (LUCJ) ansatz to estimate ground-state energies for a set of benchmark molecules, including H$_2$, LiH, BeH$_2$, H$_2$O, and NH$_3$. In addition, we introduce a Linear-CNOT variant of the Unitary Coupled-Cluster Singles and Doubles (LCNot-UCCSD) ansatz within the SQD workflow, trading higher circuit depth for reduced classical preprocessing. A comparison between these ansätze is provided, clarifying their respective strengths, limitations, and suitability for near-term quantum hardware. We further explore potential energy landscapes through 1D scans for H$_2$ and HeH$^+$ using both STO-3G and 6-31G basis sets, and for LiH and BeH$_2$ in STO-3G. Extending beyond this, we demonstrate the experimental construction of a full 2D potential energy surface for the water molecule on quantum hardware, mapped over a 32 $\times$ 32 grid in bond length and bond angle. To move beyond small benchmark systems, we combine SQD(LUCJ) with Density Matrix Embedding Theory (DMET) to compute active-space energies for a set of ligand-like molecules, as well as the pharmacologically relevant amantadine system. Across all studies, the majority of quantum-computed energies agree with reference FCI results, as well as with DMET-CASCI energies for embedded systems, to within chemical accuracy for the chosen basis sets. These results demonstrate the reliability of sample-based diagonalization approaches and underscore the potential of hybrid embedding strategies for extending quantum simulations to increasingly complex molecular systems, while also highlighting their practicality on current IQM quantum hardware.

We introduce a practical construction of group-equivariant and permutation-invariant functions of $N$ variables given a finite-dimensional space stable with respect to the group action. The construction applies to any connected linear Lie group and relies on leveraging the Lie algebra to build a matrix $M$ whose kernel is in one-to-one correspondence with the subspace with desired equivariance and invariance properties, removing the need for prior knowledge of Clebsch–Gordan coefficients. A similar construction is proposed for group-equivariant functions alone, without imposing permutation-invariance. For the groups $SO(3)$ and $SU(2)$, we further exploit the structure of the Lie algebra to demonstrate the sparsity pattern and rank of the matrix $M$, which yields the exact dimension of the group-equivariant and permutation-invariant space, as well as the dimension of the group-equivariant space alone. We demonstrate analytically and verify numerically that the proposed method scales linearly with respect to the dimensionality of the basis, offering a high computational gain compared to existing methods in the literature which typically scale exponentially. We finally perform a dimensionality comparison, showing that for large values of~$N$, the dimension of group-equivariant and permutation-invariant spaces is of comparable order as the dimension of permutation-invariant spaces, while pre-asymptotically, the first dimensionality is orders of magnitude lower than the second. Hence a substantial computational gain can be achieved by explicitly enforcing group-equivariance on top of permutation-invariance when approximating such functions.

We propose a geometry-driven quantum-inspired classification framework that integrates Correlation Group Structures (CGR), compact SWAP-test-based overlap estimation, and selective variational quantum decision modelling. Rather than directly approximating class posteriors, the method adopts a geometry-first paradigm in which samples are evaluated relative to class medoids using overlap-derived Euclidean-like and angular similarity channels. CGR organizes features into anchor-centered correlation neighbourhoods, generating nonlinear, correlation-weighted representations that enhance robustness in heterogeneous tabular spaces. These geometric signals are fused through a non-probabilistic margin-based fusion score, serving as a lightweight and data-efficient primary classifier for small-to-moderate datasets. On Heart Disease, Breast Cancer, and Wine Quality datasets, the fusion-score classifier achieves 0.8478, 0.8881, and 0.9556 test accuracy respectively, with macro-F1 scores of 0.8463, 0.8703, and 0.9522, demonstrating competitive and stable performance relative to classical baselines. For large-scale and highly imbalanced regimes, we construct compact Delta-distance contrastive features and train a variational quantum classifier (VQC) as a nonlinear refinement layer. On the Credit Card Fraud dataset (0.17% prevalence), the Delta + VQC pipeline achieves approximately 0.85 minority recall at an alert rate of approximately 1.31%, with ROC-AUC 0.9249 and PR-AUC 0.3251 under full-dataset evaluation. These results highlight the importance of operating-point-aware assessment in rare-event detection and demonstrate that the proposed hybrid geometric-variational framework provides interpretable, scalable, and regime-adaptive classification across heterogeneous data settings.

Non-Hermitian systems driven along slow parametric loops undergo non-adiabatic transitions whose outcome depends sensitively on the driving speed, yet no explicit formula has been available for the critical timescale $T_{\mathrm{cr}}$ at which these transitions develop. Using a $2\times 2$ Hamiltonian with circular parameter trajectories, we derive $T_{\mathrm{cr}} = \mathcal{G}\,\ln(1/|\Delta|)$ in closed form for non-encircling loops, phase-shifted loops, offset loops, and loops encircling exceptional points, where $\mathcal{G}$ is a geometry-dependent growth factor and $\Delta$ is the instability seed. This formula sharply separates the regime where the system remains in the averagely dominant eigenstate ($T< T_{\mathrm{cr}}$) from the superadiabatic regime where the instantaneous dominant eigenstate takes over ($T> T_{\mathrm{cr}}$), resolving the apparent tension between the previous literature. We identify two competing seeds: a geometric Stokes multiplier and the finite-precision floor. When the geometric seed vanishes, precision alone governs the transition, yielding $T_{\mathrm{cr}} \propto m\ln\beta$, linear in the number $m$ of digits in base $\beta$ (bits for $\beta=2$). For loops encircling an exceptional point, the Stokes seed only sets an intermediate plateau; the final transition is again seeded by the precision floor, and $T_{\mathrm{cr}}$ remains linear in $m$. This provides a purely forward-evolution manifestation of precision-induced irreversibility [Phys. Rev. A 114, 012207 (2026)], demonstrating that the fundamental limit identified through echo protocols also controls the outcome of slow non-Hermitian dynamics without requiring time reversal. For PT-symmetric energy spectra, $T_{\mathrm{cr}}$ additionally determines the onset of chirality: the dynamics is non-chiral for $T< T_{\mathrm{cr}}$ and chiral for $T> T_{\mathrm{cr}}$.

The realization of the Quantum Internet promises transformative capabilities in secure communication, distributed quantum computing, and high-precision metrology. However, transitioning from laboratory experiments to a scalable, multi-tenant network utility introduces deep orchestration challenges. Current development is often siloed within physics communities, prioritizing hardware, while the classical networking community lacks architectural models to manage fragile quantum resources. This tutorial bridges this divide by providing a network-centric view of quantum networking. We dismantle idealized assumptions in current simulators to address the "simulation-reality gap," recasting them as explicit control-plane constraints. To bridge this gap, we establish Software-Defined Quantum Networking (SDQN) as a prerequisite for scale, prioritizing a symbiotic, dual-plane architecture where classical control dictates quantum data flow. Specifically, we synthesize reference models for SDQN and the Quantum Network Operating System (QNOS) for hardware abstraction, and adapt a Quantum Network Utility Maximization (Q-NUM) framework as a unifying mathematical lens for engineers to reason about trade-offs between entanglement routing, scheduling, and fidelity. Furthermore, we analyze Distributed Quantum AI (DQAI) over imperfect networks as a case study, illustrating how physical constraints such as probabilistic stragglers and decoherence dictate application-layer viability. Ultimately, this tutorial equips network engineers with the tools required to transition quantum networking from a bespoke physics experiment into a programmable, multi-tenant global infrastructure.

Inspired by the work of McGlynn and Simenel [Phys. Rev. C 102, 064614 (2020)], this study investigates the quantum tunneling of two interacting distinguishable particles in two potential wells. We first benchmark the system by reproducing key established results: the exact quantum solution and the spurious self-trapping effect that arises in the real-time mean-field dynamics for strong interactions. To exactly capture the tunneling dynamics, we apply the time-dependent generator coordinate method (TDGCM) to the model. Numerical simulations demonstrate that the TDGCM, by utilizing the real-time mean-field states as generator states, successfully overcomes the self-trapping effect, yielding tunneling dynamics in excellent agreement with the exact solution. Furthermore, we explore the expectation values of the generator coordinates from the correlated TDGCM many-body wave function. While different methods for calculating expectation values show consistent results in some cases, significant discrepancies are observed in others, providing critical insights into the emergence of collective and single-particle behaviors in interacting systems. This work also verifies the TDGCM as a robust framework for describing collective quantum tunneling and opens avenues for its application to more complex and realistic systems.

We present a loop-shaping approach to coherent feedback (CF) control. By formulating the coupling between a quantum system and its environment in terms of the noise power spectrum, our method enables direct manipulation of the effective dissipation coefficients through spectral shaping. A systematic design framework for CF controllers is also developed, in which transfer functions are shaped to realize desired spectral responses. Applying this framework to optomechanical sideband cooling, we demonstrate that suppression of the Stokes process and enhancement of the anti-Stokes process can be simultaneously achieved, enabling ground-state cooling even in the unresolved-sideband regime. This loop-shaping framework provides an intuitive and general foundation for the design of CF controllers and can be extended to a wide class of quantum systems in which interactions with environments are characterized by noise power spectra.

Nonreciprocity, characterized by direction-dependent signal propagation, is fundamental to technologies such as isolators, signal routing, and precision sensing. This letter theoretically demonstrates nonreciprocal phonon transport and the conversion between photon and acoustic phonon signals in coupled optomechanical cavities via phase-dependent driving. It is demonstrated that, in contrast to nonreciprocal phonon transport, which necessitates both dissipation and phase-induced violation of time reversal symmetry, the nonreciprocity in photon-phonon conversion can occur without violating time reversal symmetry. We demonstrate that such nonreciprocity arises due to the path-dependent asymmetry in photon-phonon conversion. Furthermore, we demonstrate that the nonreciprocity of photon-phonon conversion can be further enhanced, achieving isolation levels of up to 40 dB by suitably modifying the phase difference of the driving lasers.

While QKD ensures information-theoretic security at the link level, real-world deployments depend on trusted repeaters, creating potential vulnerabilities. In this paper, we thus introduce a topology-hiding connectivity assurance protocol to enhance trust in quantum key distribution (QKD) network infrastructures. Our protocol allows network providers to jointly prove the existence of a secure connection between endpoints without revealing internal topology details. By extending graph-signature techniques to support multi-graphs and hidden endpoints, we enable zero-knowledge proofs of connectivity that ensure both soundness and topology hiding. We further discuss how our approach can certify, e.g., multiple disjoint paths, supporting multi-path QKD scenarios. This work bridges cryptographic assurance methods with the operational requirements of QKD networks, promoting verifiable and privacy-preserving inter-network connectivity.

We exhibit nontrivial transversal logical multi-controlled-$Z$ gates on $[\![N,\Theta(N),\tilde\Theta(N)]\!]$ quantum low-density parity-check (qLDPC) codes with soundness $\tilde\Theta(1)$, combining nearly optimal code parameters with fault-tolerant non-Clifford gates on qLDPC and quantum locally testable codes for the first time. Remarkably, our proofs proceed through highly general algebraic arguments. Building on insights from [Li et al.,~arXiv:2603.25831], we develop a general covering space framework for constructing and computing a rich family of cohomological invariant forms on sheaf codes that induce transversal logical multi-controlled-$Z$. To certify their nontriviality, we further demonstrate the existence of two-way product-expanding punctured Reed–Solomon codes, which is striking in light of the many negative examples for the product expansion behavior of ordinary Reed–Solomon codes. This approach directly overcomes the previous obstruction to realizing nontrivial logical operations while simultaneously preserving the code parameters. The claimed almost-good code results follow immediately as examples.

A classical particle under spatial constraints is strictly confined to live on a specific space manifold or path, but this assumption is incompatible with the zero-point fluctuations of a quantum particle. One way to describe quantum mechanics under constraints is the confinement potential approach (CPA). For a non-relativistic particle, the CPA maps the problem onto the solution of a Schrödinger-type equation in an isometrically embedded Riemannian submanifold of Euclidean space while the motion along orthogonal directions are decoupled and spatially confined. This approach respects quantum uncertainty, and one of its key results is the appearance of geometry- and metric-induced potentials that affect the stationary states and the dynamics of the particle. For particles constrained to different spaces, such as structures hosting sharp bents, vertices, wedges, conical apices, tips, or self-intersections, a formalism beyond the CPA is needed. Here, a step towards a CPA extension for irregular spaces is presented. After classifying the possible geometric irregularities concerning the CPA formalism, the presentation is focused on a sharply bent quantum wire modeled as an embedded curve with singular (but absolute integrable) curvature. For a subclass fulfilling the additional requirement that the geometric potential is a distribution of first order, a solution scheme for the confined Schrödinger equation is presented based on singular Sturm-Liouville theory and operator theoretic methods. The analytical considerations and numerical simulations evidence the existence of curvature-induced bound states with non-differentiable wave functions localized around the singular point, with an extension well beyond the singularity. Furthermore, a multitude of scattering states appear that may affect the transport and optical properties of the system.

Secure long-distance communication in quantum key distribution (QKD) networks depends on trusted repeater nodes along the entire transmission path. Consequently, these nodes will be subject to strict auditing and certification in future large-scale QKD deployments. However, trust must also extend to the network operator, who is responsible for fulfilling contractual obligations – such as ensuring certified devices are used and transmission paths remain disjoint where required. In this work, we present a path validation protocol specifically designed for QKD networks. It enables the receiver to verify compliance with agreed-upon policies. At the same time, the protocol preserves the operator's confidentiality by ensuring that no sensitive information about the network topology is revealed to users. We provide a formal model and a provably secure generic construction of the protocol, along with a concrete instantiation. For long-distance communication involving 100 nodes, the protocol has a computational cost of 1-2.5s depending on the machine, and a communication overhead of less than 70kB - demonstrating the efficiency of our approach.

We investigate the selective generation of Bell-pair entanglement in three qubit networks using a standard quantum collision model. By varying the network geometry, the node contacted by the ancilla, and the interaction Hamiltonians, we identify configurations in which high pairwise concurrence and Bell state fidelity are generated between different target qubits, including nonadjacent qubits and qubits not directly coupled to the ancilla. For comparison, we also consider the continuous time unitary evolution of the complete ancilla network system, sampled at the same discrete time intervals. This reference calculation clarifies how discarding each outgoing ancilla and removing its correlations from subsequent dynamics modifies the attainable entanglement and preparation time. Our results provide a proof of principle demonstration of geometry dependent Bell pair generation and routing in small qubit networks.