Papers

Naseri et al. [Phys. Rev. A 106, 062429 (2022); arXiv:2205.13610] studied which quantum resources in initial states are essential for the probabilistic Bernstein-Vazirani (BV) algorithm, defining its performance as the optimal average success probability over all measurements. In this work, we consider a variant of BV algorithm, which is called the initialization-free (IF) BV algorithm, in which an arbitrary ancilla state as the oracle register is allowed, to improve the performance. We derive an explicit formula for the performance of the probabilistic IF-BV algorithm and obtain a necessary and sufficient condition for an initial state to achieve maximal performance. We further prove that, under a suitable ordering assumption on the coefficients of the initial state, the probabilistic IF-BV algorithm outperforms the standard probabilistic BV algorithm.

Lattice-based post-quantum cryptography relies on the hardness of the Learning With Errors (LWE) and Module Learning With Errors (MLWE) problems. This work introduces a constructive framework for encoding small MLWE instances as Quadratic Unconstrained Binary Optimization (QUBO) models suitable for quantum annealing. The formulation jointly represents secret coefficients and explicit error variables within a unified binary optimization structure, enabling their simultaneous recovery from the ground-state solution. Beyond the encoding, we develop a stability analysis of the resulting optimization landscape under additive perturbations. We show that the admissible noise region forms a convex polytope defined by competing candidate secrets, and establish an equivalent characterization in terms of the QUBO energy gap between the optimal and second-best solutions. Numerical experiments on low-dimensional benchmark instances using exact simulation demonstrate correct recovery of both secret and discretized error vectors, and confirm consistency between geometric stability regions and energy-gap behavior. We further quantify the scaling of logical variables and embedding overhead with increasing MLWE dimensions to assess feasibility on quantum annealing architectures. The results establish a systematic connection between MLWE problems and quantum optimization while providing a framework for analyzing robustness properties of QUBO formulations. Although current quantum annealing hardware remains insufficient for cryptographically relevant parameters, the proposed methodology offers a structured basis for studying lattice-based problems in quantum optimization settings without implying a practical threat to standardized post-quantum schemes.

Quantum theory fundamentally forbids the perfect copying of an arbitrary unknown quantum state, according to a principle known as the no-cloning theorem. Nevertheless, it is possible to construct a deterministic quantum map that produces multiple approximate copies of an unknown quantum state. This task is referred to as universal quantum cloning, further facilitating numerous quantum technologies such as quantum cryptography and quantum communication. In this work, we theoretically verify that the universal quantum cloning cannot be realized within a noncontextual theory, highlighting its intrinsically nonclassical nature. Our verification first {focuses on revealing that} $1\rightarrow2$ cloning scenario {is fully contextual}, and {further covers general examples to observe the contextual behavior of} $N\rightarrow M$ scenario. We believe that our results regarding quantum cloning serve a key role for understanding both quantum foundation and application.

Highly collimated laser beam with excellent spatial quality is essential for quantum sensing experiments, where even small residual beam divergence can accumulate over distance and introduce significant systematic errors. In this article, we present the design and detailed characterization of a high precision laser beam collimator developed for a cold-atom Gravimeter system, capable of producing an expanded laser beam with a diameter of 16 mm while achieving microradian level collimation accuracy through a five-degree-of-freedom (5-DOF) adjustment mechanism. The beam quality is evaluated using an ISO11146 compliant beam propagation measurement combined with Gaussian beam analysis to extract key parameters, including the beam waist, divergence angle, Rayleigh length, and beam quality factor $M^{2}$. The measured divergence angles of 0.006{\deg} (105 micro-radian) along the $x$ axis and 0.007{\deg} (122 micro-radian) along the $y$ axis confirm stable and well controlled collimation over long propagation distances. The demonstrated collimation architecture and characterization methodology provide a robust and scalable solution for cold-atom Gravimetry and other precision optical applications that require stable, high quality laser beams maintained over extended distances.

A topological invariant based on polar-decomposition of matrices correctly captures the topology of finite non-Hermitian chains exhibiting the non-Hermitian skin effect, provided that an appropriate crop-length parameter is chosen. This parameter, which sets the cutoff used in the calculation of the invariant, is usually chosen empirically and becomes especially important near topological phase transitions, where finite-size effects are strongest. Here we show that the required crop-length is controlled by physical decay (localization) lengths. For nearest-neighbor and pure longer-range hopping Hatano-Nelson-type chains, the crop-length is set mainly by a single localization length and is well approximated by a scalar multiple of that length. For more general longer-range hopping models, it is governed instead by a multichannel root structure of the characteristic polynomial. Random-forest regression captures finite-size and near-boundary corrections while preserving this decay-length interpretation. Trained on one set of Hamiltonians, the predictor accurately generalizes to unseen Hamiltonians and complex base energies, reproducing crop-lengths across full phase diagrams. We further show that the predictions learned from clean nearest-neighbor hopping chains remain stable under moderate hopping disorder. These results provide a practical and physically interpretable way to choose the crop-length, which in turn determines when the real-space invariant can reliably capture the topology of finite non-Hermitian chains.

Tile codes are a family of planar quantum low-density parity-check (qLDPC) codes with weight-6 stabilizers and open boundary conditions, offering an encoding efficiency $kd^2/n$ of up to four times that of the surface code. In this work, we develop an exhaustive search algorithm for finding SWAP-based routing schemes that implement syndrome extraction for four tile-code families using only nearest-neighbor interactions on a two-dimensional square lattice, matching the connectivity of the surface code. Using explicitly constructed routed syndrome-extraction circuits decoded with BP+OSD, we estimate the circuit-level thresholds of these code families. For the SI1000 noise model, the threshold without such a connectivity constraint is obtained in a range 0.23%-0.31%, while it decreases to 0.11%-0.13% with routing, representing a reduction factor of around two to three. Despite this threshold penalty, our resource-footprint analysis shows that routed tile codes require fewer physical qubits per logical qubit than the surface code at sufficiently low physical error rates: Under the SI1000 noise model, we find a crossover near $p^*\approx 0.08\%$, below which routed tile codes become more qubit-efficient, with an advantage that grows monotonically as the physical error rate decreases.

Nonlinear differential equations play a crucial role in modeling a wide range of phenomena, yet their solutions remain notoriously difficult to obtain. With the rapid development of quantum computing, quantum algorithms for efficiently solving such equations are actively being explored. One promising approach is based on Carleman linearization, which transforms nonlinear differential equations into linear systems. However, this method suffers from exponential divergence beyond a certain time scale. By reformulating the solutions in terms of eigenvalues and eigenvectors, we identify that this divergence originates from the Laurent expansion outside its neighborhood of convergence. To address this issue, we insert a regularized function to the divergent solution hinted by analytical continuation. We validate this divergence-correction method on both the logistic equation and some other partial differential equations like KPP-Fisher equations and Phase-Field models under periodic conditions. We implement our method for the logistic equation using the Linear Combination of Unitaries (LCU) quantum algorithm, providing a detailed complexity and error analysis.

Barrios Hita et al. [Phys. Rev. Lett. $\bf{136}$, 240202 (2026)] argued that quantum mechanics can be formulated over the real numbers by replacing the tensor-product postulate with a quotient-space construction, and concluded that complex numbers are therefore a matter of convenience. We show that the operational content of this construction is not that of a generic real Hilbert-space theory. Empirical equivalence requires a distinguished real linear operator $J$ with $J^2 = -\mathbb{1}$, and all physical effects, instruments, and dynamics must preserve the corresponding $SO(2)$ gauge. Moreover, the composite-system rule is a balanced tensor product over this hidden complex structure, not the ordinary tensor product over $\mathbb{R}$. In multipartite network scenarios, this changes the meaning of source independence: canonical real representatives are not source-factorizable in the usual tensor-product sense. Thus, the construction is best understood as standard complex quantum mechanics written in real notation, not as an independent real-amplitude theory. This clarifies what is, and is not, excluded by experiments testing the necessity of complex numbers.

A resource theory of quantum measurement can be addressed in terms of quantum coherence and measurement sharpness, respectively. The former analyzes the off-diagonal structure of POVM elements in a predetermined basis while the latter analyzes the deviation from trivial, state-independent, measurements. We establish a direct connection between the two resource theories by identifying measurement sharpness as the maximal coherence that is achievable under all possible unitary changes of the reference basis. For a broad class of POVMs whose elements share a common eigenbasis, we show that the maximal distance-based coherence of measurement coincides exactly with the corresponding distance-based sharpness monotone. We further extend this equivalence, with element-additive distances, to POVMs whose elements admit a common mutually unbiased basis structure. These results provide a measurement-theoretic analogue of the maximal-coherence & purity correspondence for quantum states. We also show that the maximal coherence of measurement is faithful with respect to trivial measurements and is monotonic under fuzzifying operations for dichotomic measurements, as well as under mixed-unitary and unitarily covariant preprocessing channels. Finally, we illustrate the operational meaning and limitations of the equivalence through qubit POVMs, single-photon phase sensing, and noisy photon-number resolving detection. In particular, the maximal Fisher information in a Mach-Zehnder interferometer is shown to be determined by the squared maximal coherence of the measurement, while in an imperfect photon-number resolving detector the maximal coherence behaves as a proper sharpness monotone, unlike conventional PVM-based unsharpness measures.

Real-time decoding is a major bottleneck in scaling quantum error correction (QEC) from noisy intermediate-scale quantum (NISQ) devices to fault-tolerant quantum computing. We present an adaptive confidence-gated decoding framework for the rotated surface code that treats decoding as a two-stage inference problem. A lightweight feed-forward neural network performs fast-path decoding for the majority of syndrome measurements, while only low-confidence predictions are escalated to a minimum-weight perfect matching (MWPM) refinement stage. We benchmark the framework on rotated surface codes with distances $d \in \{3,5,7,9,11\}$ under circuit-level depolarising noise using the Stim stabiliser simulator. The evaluation characterises logical accuracy, confidence-controlled accuracy-latency trade-offs, decoding throughput, per-shot latency, and decoding-graph resource scaling. Routing only 3.3%-6.2% of syndromes to the refinement stage improves logical accuracy from 99.21% for the neural-only baseline to 99.81% at a confidence threshold of 0.95 while incurring only a bounded increase in average decoding cost. Neural-decoder throughput saturates near $4.6 \times 10^{5}$ samples s$^{-1}$ at batch size 512 on commodity CPU hardware, indicating that the neural fast path is not the dominant throughput bottleneck beyond code distance $d=7$. We release the complete benchmarking pipeline, trained models, raw benchmark data, and source code, and explicitly distinguish the experimentally validated contributions from the broader hardware-aware QEC co-design roadmap, including hardware-constrained code discovery, GPU-accelerated inference, and multi-noise optimisation, which remain directions for future work.

Dilution refrigerators are the enabling infrastructure of superconducting quantum computers, yet their fault diagnosis is still dominated by threshold alarms that report that something is wrong, not what. We present Onnes, a physics-grounded digital-twin simulator of a dilution refrigerator (a forward physics model with a learned real-fridge noise fingerprint) that drives a live multi-agent LLM operations layer, and use it for a controlled head-to-head between a zero-shot LLM agent panel and a supervised ML classifier on cryogenic fault diagnosis. The twin couples a real dilution-cooling floor, a noise-and-correlation fingerprint learned from real BlueFors logs, and six physics-grounded fault classes, three engineered to overlap on temperature but separate on flow and pressure. Across a 1000-turn evaluation the zero-shot panel shows no significant difference from the classifier on detection but trails on classification, its errors concentrating on the confusable faults. Curated contrastive few-shot demonstrations and self-consistency voting then raise classification accuracy from 0.685 to 0.990, matching the supervised classifier (0.985) with no parameter updates and six labeled demonstrations; an ablation attributes the gain almost entirely to the demonstrations. Run as a continuous monitor across a nine-run fault-by-seed sweep, the agent catches every developing fault within one poll interval, and a confidence gate suppresses pre-onset false alarms whose rate is backend-dependent. As a first sim-to-real check, a detector trained purely on real BlueFors telemetry posts a real-hardware false-alarm rate of 6.4% and 100% recall on physics faults injected onto real held-out windows. All numbers are drawn verbatim from released run logs.

We introduce population-transfer dynamics as a practical validation observable for active-space-derived reduced Hamiltonians in multistate reaction-center chemistry. Using a cytochrome P450-inspired Fe-complex model, we construct a reaction-coordinate-dependent effective Hamiltonian from state-averaged complete active-space self-consistent field (SA-CASSCF) calculations, map it to a quantum-circuit representation suitable for current hardware, and propagate dynamics from the reactant-side ground state. The reduced Hamiltonian reproduces the SA-CASSCF reference with an RMS deviation of 0.030 eV and a maximum absolute deviation of 0.143 eV. As a dynamics-based diagnostic, the product-manifold population p_P(t) identifies a pronounced near-degeneracy region around x = 0.3, where state mixing is strongest. Classical exact time evolution yields a product population of 0.488 at x = 0.3 after 10 fs, compared with 7.26 x 10^-2 at x = 0.2 and 5.90 x 10^-3 at x = 0.0. To enable execution on current trapped-ion hardware, we examine the trade-off between dynamical fidelity and circuit resources through coupling pruning and first-order Trotterization. A coupling cutoff of 0.02 eV reduces the non-zero coupling set from 32 to 7 while preserving the dominant transfer pathways, and M = 30 provides the best practical operating point. Finally, we demonstrate the workflow on Quantinuum's trapped-ion quantum computer Reimei. The hardware reproduces the key reaction-coordinate trend identified by the classical model, including the maximum at x = 0.3, where the measured product population is 0.42 on hardware and 0.43 on the matched emulator. This work establishes a dynamics-based framework for assessing active-space-derived reduced Hamiltonians and demonstrates chemically interpretable multistate electronic dynamics on current trapped-ion hardware.

Leakage to noncomputational states limits the speed of single-qubit gates in weakly anharmonic transmons. Conventional pulse-shaping methods, including derivative removal by adiabatic gate (DRAG), primarily suppress the leakage remaining at the end of a gate. Here we demonstrate that endpoint leakage and the transient leakage population that accumulates during the gate represent distinct control objectives. Endpoint leakage is associated with the drive spectrum at the anharmonicity, whereas transient exposure depends on spectral weight over a finite frequency band and governs the additional leakage induced by dephasing. A spectral null at the leakage transition therefore suppresses the endpoint amplitude without necessarily reducing transient exposure. Based on this distinction, we introduce a path–endpoint separation pulse that combines transient-path shaping with a two-tone endpoint correction. For a $10$ ns $R_X(\pi/2)$ gate with an anharmonicity magnitude of $0.2$ GHz, numerical simulations show a $21\%$ reduction in transient exposure relative to cosine DRAG and a corresponding $20\%$ reduction in dephasing-induced excess leakage. The two correction tones further suppress residual leakage through the $|2\rangle$ and $|3\rangle$ channels, lowering the coherent endpoint leakage from approximately $7\times10^{-7}$ to $3\times10^{-8}$ without increasing transient exposure. These results establish transient exposure and endpoint leakage as complementary targets for the design of fast transmon gates.

Chiral quantum emitters interact with light only in one propagation direction, allowing them to be linked into cascaded systems in which photons mediate ordered, long-range interactions. Such systems are predicted to host novel regimes of many-body physics of light and matter. Exploring these regimes requires arrays of identical quantum emitters with directional, low-loss coupling to guided photons, a combination that has thus far remained experimentally out of reach. Here we realize a cascaded network of superconducting qubits using an architecture that overcomes these bottlenecks. We implement a four-qubit chain spanning two modules, with separations ranging from millimeters to half a meter, and exploit the shared waveguide as a dissipative resource to stabilize reconfigurable entanglement, reaching a genuinely multipartite regime unavailable in reciprocal baths. By scattering weak pulses off the chain, we observe photons sorted in time by photon number, a signature of the strong photon-photon interactions mediated by the emitters. Together, these results provide experimental access to many-body light-matter regimes that are beyond the reach of reciprocal systems.

Quantum techniques, developed in recent decades, provide new approaches to achieving high-precision measurements beyond the classical bounds. In this paper, we theoretically demonstrate a metrology method for improving the sensitivity of the interferometric optical gyroscope, robust against the loss, by using coherent-light stimulated two-mode squeezed beams as the light source. The detection protocol is based on a simple intensity measurement, and the quantum noise is far below the shot-noise limit. The enhancement factors for different coherent light fields are analyzed in detail. Additionally, the influence of loss during the propagation in the optical path is studied, and the conditions for achieving sub-shot-noise measurement sensitivity are obtained. We also find that the phase sensitivity of the proposed gyroscope scheme becomes closer to the quantum Cramér-Rao bound with increasing of the photon number of the coherent beams.

Quantum convolutional neural networks (QCNNs) combine the power of quantum computing and classical CNN for computational speedup in classification tasks. However, noise levels on state-of-the-art quantum devices remain too high for practical QCNN execution. In addition, despite the reliable surface code providing a method for error rates below a threshold value, they have a prohibitively large qubit cost. Recently introduced bivariate bicycle (BB) codes are of particular interest for their high error threshold, constant encoding rate, and linear code distance. Through simulation with realistic hardware noise sources, we demonstrate that a 4-qubit unprotected QCNN fails to converge and exhibits a worse learning rate compared to numerical simulations. Addressing both limitations, we propose a distance-4 BB quantum error-correction (QEC) technique for QCNNs. In doing so, we validate that our low-overhead QEC technique for QCNNS represents a step toward practical QCNNs.

Building on the framework developed by Perche [Phys. Rev. D 106, 025018 (2022)], we study two localized nonrelativistic quantum particles propagating along timelike geodesics in a curved spacetime background. Each particle is coupled to a quantum clock that operationally records the time spent in a prescribed spatial region. We compute the covariance of the resulting time observables for separable and entangled two-particle states, comparing flat and curved backgrounds. We then reformulate the protocol as a Bell-like experiment and show that the Bell parameter can acquire a curvature-induced correction. In particular, a protocol calibrated to saturate the classical bound in flat spacetime can be driven above this bound in curved spacetime for entangled states. We focus on two-dimensional curved backgrounds in which the local tidal term induces an effective harmonic potential in the Fermi-frame description. Our results show that spacetime curvature can modify operationally defined quantum correlations and suggest entangled quantum clocks as probes of spacetime curvature.

We study the transmission eigenvalues of monitored Haar products \[ B_L=(PS_L)(PS_{L-1})\cdots(PS_1), \] where the $S_i$ are independent Haar unitaries and $P$ is a deterministic projection. For fixed $L$, we prove that the empirical eigenvalue distribution of $B_L^\dagger B_L$ converges to $\nu_c^{\boxtimes L}$, where $\nu_c=(1-c)\delta_1+c\delta_0$. We then take the free small-loss limit and identify the limiting law by \[ S_{\mu_\tau}(z)=\exp\left(\frac{\tau}{1+z}\right). \] Lagrange inversion gives explicit Erlang-type moments, explaining the polynomials appearing in Beenakker's recursion. We also record spectral consequences, including the atom $\mu_\tau(\{1\})=(1-\tau)_+$ and the real branch point $\tau \mathrm{e}^{1-\tau}$, and formulate the diagonal scaling $L\sim\tau N$, $c=1/N$, as a quantitative convergence problem supported by low-order moment checks.

In this work, we investigate the relationship between quantum coherence and multiparameter quantum estimation in a graphene-based system. We focus on the estimation of two relevant physical parameters, namely the temperature $T$ and the wave vector $k_x$, and analyze how their variations affect both quantum coherence and the achievable metrological precision. The minimum variances associated with the estimation process are evaluated through the quantum Cramér–Rao bound within both simultaneous and independent estimation schemes. Our results show that quantum coherence is enhanced in the low-temperature regime and around $k_x=0$, while it decreases progressively as either the temperature or the wave vector increases. However, the regions where coherence is maximal do not necessarily coincide with those of optimal estimation precision. In particular, the variance associated with temperature estimation exhibits a divergent behavior near $T=0$, indicating that the system becomes weakly sensitive to small temperature variations in this regime. By contrast, the estimation of the wave vector $k_x$ is more directly related to the coherence properties of the system, with improved precision obtained near $k_x=0$. Furthermore, we introduce the ratio $\Gamma$ to compare the total variances obtained from the independent and simultaneous estimation schemes. This quantity provides a useful measure of the relative difference between the two strategies when the parameters are estimated separately or jointly.

Blind quantum computing (BQC) allows a client to delegate quantum computations to a remote server without revealing the input, computation, or output. In addition to being blind, the client can sometimes also verify that the server has performed their instructions correctly, a property known as verifiability. A key part of realizing such verifiable BQC (VBQC) is choosing the design of the client device: many architectures have been proposed, each with different hardware requirements, security properties, and performance characteristics, making it difficult to identify which is most suitable for a given implementation. In this work, we present a comparative analysis of client architectures for VBQC with a matter-qubit server. We restrict our analysis to single-server, single-client protocols with information-theoretic security based on measurement-based quantum computation. We identify three main categories of client: emission-based, measurement-based, and rotation-based, each with multiple variants depending on how the client interacts with the server. We evaluate each across different dimensions: we compare guarantees of existing corresponding security proofs, we derive equations for the rate at which each client can execute a protocol, we provide an overview of each architecture's error behaviour, and discuss hardware cost and design considerations. Client architectures implementing measurement-based remote state preparation and reflection-based teleportation emerge as strong default candidates, but as the right choice remains context-dependent, we provide a framework for navigating considerations to guide the selection of the most suitable architecture for a given setting.

The temporal Clauser-Horne-Shimony-Holt (CHSH) inequality witnesses the nonclassicality of temporal correlations, but its violation is generally degraded by environmental noise. Here, we show that violation of the temporal CHSH inequality can be revived through coherent control of noisy quantum evolutions. We compare two physically distinct implementations: coherent control of noisy evolutions induced by interaction of the system with independent environments, and coherent control of two physically distinct, unitarily equivalent Stinespring dilations of the same noisy channel. Although these constructions generate identical deterministic system dynamics, they induce distinctly different post-selected evolutions. With a focus on the amplitude damping channel (ADC), we show that coherent control of equivalent dilations extend the range of temporal CHSH inequality violation well beyond both the incoherently controlled, or deterministic, scenario and what is achievable with independent environments. Under setting-independent post-selection of the coherent control implementation, the resulting violation further certifies that the channel is not strongly CHSH nonlocality-breaking. Our results identify the choice of Stinespring dilation as an operationally relevant resource in coherently controlled tests of temporal quantum correlations.

As quantum networks move toward practical deployment, standardized performance monitoring becomes essential. This article proposes a structured monitoring framework for quantum networks with performance metrics, including quality (e.g., entanglement fidelity, QBER, loss, dark count rate), throughput and latency (e.g., entanglement rate, waiting time), timing (e.g., coincidence window, production and coincidence jitter), and exogenous factors (e.g., temperature, humidity, vibrations). These measurements enable real-time observability, benchmarking, and control, supporting use cases such as fault diagnosis, adaptive timing, and entanglement routing. Additionally, we implement a non-invasive prototype environmental monitoring system integrated with the quantum network infrastructure at Oak Ridge National Laboratory, demonstrating practical feasibility of live data collection and alert generation. Furthermore, we discuss the challenges of real-time monitoring and the trade-offs between observability and system performance. This work establishes a foundation for developing advanced quantum network monitoring systems and lays the groundwork for future autonomous control and quantum software-defined networking.

We show that the teleportation-based quantum state tomography (QST) protocol, originally built to reconstruct qubits (spin-1/2 systems), can be extended to deal with qutrits (spin-1 systems) as well. Similarly to the original proposal, only two resources are needed to implement the spin-1 teleportation-based QST protocol: (1) Alice should be able to implement the analog of Bell measurements for spin-1 systems; and (2) she should be able to prepare a few different single qutrit states that will be teleported to Bob.

We investigate the Hilbert–Schmidt speed as a witness of non-Markovianity in finite-dimensional quantum dynamics. For a differentiable one-parameter family of quantum states, the Hilbert–Schmidt speed is defined, up to a conventional factor, as the Hilbert–Schmidt norm of the corresponding Hermitian traceless tangent operator. We show that, for unital dynamics in arbitrary finite dimension, P-divisibility implies the monotonic decrease of the Hilbert–Schmidt speed. Hence, any increase in this quantity signals the breakdown of P-divisibility, and therefore also excludes CP-divisibility. For qubit systems, we establish a stronger result: every P-divisible evolution decreases the Hilbert–Schmidt speed, independently of unitality. Thus, in dimension two, HSS growth is a valid witness of non-Markovian behaviour for arbitrary positive divisible dynamics. This conclusion is dimension dependent. In dimensions $d\geq3$, non-unitality can generate HSS growth even under CP-divisible dynamics. We demonstrate this by constructing an explicit non-unital CP-divisible qutrit semigroup for which the Hilbert–Schmidt speed strictly increases. Finally, for unital GKSL dynamics, we derive a generator-level dissipation identity explaining the monotonic decay of the Hilbert–Schmidt speed. These results specify the regimes in which HSS growth can be interpreted as evidence of the failure of divisibility and clarify its limitation for higher-dimensional non-unital evolutions.

Random fractal lattices provide a geometrically disordered setting in which quantum correlations can be shaped by noninteger dimensionality rather than onsite randomness. We investigate the entanglement properties of noninteracting fermions on random fractal lattices generated by a stochastic growth algorithm. By varying the growth parameter and adding missing links with probability $p$, we tune the Hausdorff and spectral dimensions while keeping the system free of onsite disorder. For ground states at different fillings, we compute the bipartite entanglement entropy of subregions defined by graph distance and analyze its scaling with subsystem size. Over a broad parameter range, we find robust power-law behavior governed primarily by the Hausdorff dimension, consistent with a generalized area law and without the logarithmic enhancement familiar from Euclidean free fermions. We also study entanglement growth following a global quench from an uncorrelated checkerboard state and uncover an asymptotic scaling collapse in which the subsystem-size dependence is governed by the Hausdorff dimension, while the temporal evolution is governed by the spectral dimension. The resulting dynamics are logarithmically slow over an extended intermediate-time window. These results show that geometric randomness alone can generate both nontrivial ground-state entanglement structure and slow quantum-information spreading in free-fermion systems.

The Uhlmann phase extends geometric phases to mixed quantum states via a parallel-transport condition on purification amplitudes, yet its direct implementation under standard Hamiltonian dynamics is obstructed by the non-Hermitian nature of the purification. We establish that for any smooth one-dimensional closed loop of full-rank qubit density matrices, there exists a four-level Hermitian parent Hamiltonian whose doubly degenerate ground-state subspace carries a Wilczek–Zee connection exactly equal to the Uhlmann connection. Consequently, the Uhlmann holonomy is faithfully reproduced by adiabatic evolution in the enlarged system. We further prove that this auxiliary-field construction is obstructed in generic two-dimensional parameter spaces by a Frobenius integrability condition, which we derive explicitly. The one-dimensional Uhlmann phase is thus placed on the same footing as the non-Abelian Berry phase, offering a purely Hermitian, Hamiltonian-based route to simulating mixed-state geometric phases. Numerical integration of the adiabatic dynamics confirms the exact correspondence and validates the convergence to the Uhlmann holonomy in the large-gap limit.

We propose a nonlocal flux-transfer experiment in which a quantized magnetic-field excitation confined within one toroidal superconducting structure is coherently transferred to a spatially separated toroid without magnetic-field occupation of the intervening region. The transfer arises from quantized Aharonov-Bohm-type vector potential coupling mediated by a superconducting loop threading the toroids, which, however, remains in the ground state, acting only through a global fluxoid constraint. A direct experimental signature would be the observation of correlated, time-resolved flux exchange between remote toroids in a SQUID readout. We analyze an apparent signaling paradox related to this interaction as a probe of the broader question of whether spatiotemporal quantum coherence is fundamentally bounded. The proposed setup can provide an experimental testbed for addressing foundational questions such as the existence of an objective collapse of a wavefunction or the fundamental limits of macroscopic quantum coherence which is relevant to large scale quantum computers.

When reference frames are treated quantum mechanically, the subsystem structure of quantum systems is no longer absolute, but depends on the choice of the quantum reference frame (QRF). This raises a basic question: which dynamical properties are preserved across QRFs, and which depend on the physical reference used to define the system? We study this question in the general setting of open quantum systems. At the operational level, after a QRF transformation, the old reference frame and environmental degrees of freedom may be inaccessible and must therefore be traced out. This motivates the definition of reduced quantum-reference-frame channels: maps that connect the joint description in one frame to the accessible subsystem in another. We characterize their symmetry-constrained structure and define a regime in which a reduced entropy-coherence conservation law holds. We also identify when the induced reduced action on the open system admits a classical interpretation as random frame misalignment, and when it instead reflects quantum reduced-frame effects. We then apply the framework to pure-dephasing dynamics and derive a necessary and sufficient compatibility condition for population preservation. When the frame symmetry commutes with the open system's free Hamiltonian, coherences acquire a multiplicative frame factor, so that locally inferred decoherence rates split into environmental and reference-induced contributions. Ramsey interferometry gives this split a direct operational meaning. Finally, a gravity-motivated dephasing model illustrates how degradation of a phase reference can mimic signatures usually attributed to intrinsic decoherence mechanisms.

Simulating open quantum systems on digital quantum computers typically relies on the use of auxiliary qubits, resulting in overheads of noisy multi-qubit gates, that severely limit execution on near-term hardware. In this work, we explore the simulation of non-Markovian dynamics as well as memory channels leveraging the method of trajectory mixing, valid for mixed unitary channels. This allows to drastically reduce circuit depth, trading entangling gates for a statistical mixture of independent, pure state trajectories. Using a realistic noise model calibrated to modern quantum processors, we show the benefits of this approach, yielding higher state fidelity and better preservation of quantum correlations. This shows the possibility of simulating long-time non-Markovian evolutions with low noise and limited resources.

We study the multidimensional erratic structure of correlation functions produced by local operator quenches in finite-volume free massive scalar field theory in dimensions 2 and 3. The basic observable is the subtracted equal-time two-point function in the locally excited state and its spatiotemporal patterns of extrema. We analyze these extrema by the multidimensional diagnostics recently introduced for chaotic scattering amplitudes and related problems: all-pair distance distributions, nearest-neighbor spacings, greedy-path spacing ratios, and the extrema form factor. For the $1+1$-dimensional local quench we find that, in the regime of small Euclidean smearing, the fitted extremum statistics move close to the $\beta=1$ random-matrix benchmark, while increasing the smearing scale softens the effective repulsion and moves the distributions away from the GOE-like value. For the $2+1$-dimensional local quench we find that the nearest-neighbor statistics of the refined extrema are close to, or above, the $\beta=1$ benchmark, and the greedy-path ratio statistics are described by even larger effective $\beta$ values. Finally we studied the all-pair extrema spatial form factor and found that, in the one-, two-, and three-dimensional cases, its main structure is controlled by the corresponding uniform interval, rectangle, or cuboid geometry of the extrema cloud and found the dip-ram-plateau structure in the last two cases. Thus the form factor provides a complementary global diagnostic of how the extrema fill their effective metric support, while the genuinely nontrivial local and mesoscopic organization is carried by the nearest-neighbor and greedy-path statistics.