Papers

A new phase diffusive regime in a current biased Josephson junction is theoretically explored which originates from embedding the junction in a circuit environment with anomalous dissipation. This is realized by placing parallel to the junction a resistor in series with a capacitor such that electromagnetic fluctuations effectively couple also to the charge of the junction. This leads to rich Josephson dynamics, in particular for the switching of the junction out of a zero voltage state. Modelled as the escape process of a fictitious phase-particle out of a metastable well, a detailed study reveals that anomalous dissipation has a strong impact at low temperatures when quantum tunneling dominates against thermal activation. As a manifestation, a regime is found, where for realistic circuit parameters the quantum escape process is substantially enhanced, followed by a short voltage pulse and re-trapping with high probability. This class of circuits may be leveraged for detecting microwave photons or dissipative quantum annealing processes. In addition, the analysis provides a general framework for engineering dissipative dynamics in nonlinear systems using anomalous environments.

We study timelike entanglement entropy and timelike subregion complexity in localized black holes with asymptotic AdS3*S3*T4 geometry, focusing on the black-pole solution. Unlike the BTZ solution, the black pole exhibits a nontrivial dependence on the internal sphere through the functions $K_y(r,\theta)$ and $G(r,\theta)$. Both observables are constructed from spacelike and timelike Lorentzian branches, but they probe the geometry in different ways: timelike entanglement yields a complex lifted area, while timelike complexity gives a real, finite renormalized volume. We employ a localized timelike prescription in which the branch profile is built at an angular label $\theta_0$ and subsequently lifted over the physical internal angle $\theta$. In the large-$r$ regime, the leading angular dependence drops out, recovering the expected short-interval behaviour. In the exact black-pole geometry, the temporal families become non-monotonic, making a fixed-boundary-interval selection essential. As the boundary interval increases, the selected branches move inward and become sensitive to the localized cap-horizon transition region. These results demonstrate that timelike Lorentzian observables probe localized-geometry effects that are absent in BTZ and in the leading large-$r$ description.

Despite rapid progress in quantum optimization, broad real-hardware benchmarks comparing multiple algorithmic families across diverse combinatorial problems under a common protocol remain limited. We benchmark gate-based quantum optimization on four NP-hard problems: multi-dimensional knapsack (MDKP), maximum independent set (MIS), quadratic assignment (QAP), and market-share (MSP). We study VQE, CVaR-VQE, standard, multi-angle, and warm-start QAOA, together with qubit-efficient PCE and QRAO, on IBM Heron r1/r2 processors using resilience-level-2 mitigation. To our knowledge, this includes the first real-hardware QRAO results and the first multi-problem PCE hardware benchmark. Across 247 method-instance combinations, we report transpiled circuit size, hardware outcomes, and an independent-error gate-count fidelity proxy, $F_{\mathrm{est}}$. For MDKP and MIS, an empirical operating point near $F_{\mathrm{est}}\approx 0.1$, corresponding to about 770 two-qubit gates at the median Heron-r2 CZ error rate, marks the onset of noise-dominated execution. QAP exposes a separate bottleneck: dense one-hot encodings and an exponentially sparse feasible manifold, with feasible fraction $10!/2^{100}$ at $n=10$; no tested hardware method produces a feasible assignment. Compiled QAOA-family circuits are generally noise dominated, and a matched uniform-random control shows that most feasible low-fidelity outcomes fall within the random range, apart from one finite-sample MIS warm-start exception. A SWAP-aware, fractional-gate, Nighthawk-topology compilation counterfactual reduces two-qubit counts but leaves all circuits below $F_{\mathrm{est}}=10^{-3}$. These conclusions apply to the tested implementations rather than QAOA in general. Qubit-efficient methods extend runnable instance sizes, but only within the empirical fidelity budget.

Block encoding is the standard technique for accessing matrix data in quantum linear-algebra algorithms. Its implementation directly affects its subnormalization, which in turn controls the algorithm's success probability, simulation time, and downstream costs. Explicit construction of block encodings with provably optimal subnormalization exists for only a handful of operators, with bespoke calculations used in its design. In this work, we develop a framework to block encode translation-invariant finite-difference operators on a periodic grid. These operators are the finite-difference discretizations of the constant-coefficient partial differential equations that sit at the core of scientific computing. We show that the moment order of these stencils can be used to simultaneously determine the continuum operator approximated, the vanishing order of the Fourier symbol, and the cost of the block encoding. From there, we derive a closed-form optimality criterion as a function of the stencil coefficients, which certifies whether the construction attains the optimal subnormalization for an entire operator family, uniformly in grid size, and quantifies the gap when it does not. The framework subsumes optimal constructions for the Laplacian operator in the literature and can be used to certify new instances at higher even orders, including the biharmonic operator. Furthermore, we derive success-probability floors parameterized by spectral properties of the operator's symbol and find explicit constants for the block encoding of the advection-diffusion family for which no prior explicit spatial block encoding exists.

We demonstrate how the interference effects for a quantum particle in the double-slit experiment can be described by classical probabilities. We investigate a classical field theory for a complex scalar field with probabilistic initial conditions. A central element are conserved charges leading to the concept of particles. These are statistical observables which describe properties of the probability distribution for field configurations. The conserved charges define subsystems for particle excitations of a vacuum state. The classical probability distribution for the one-particle subsystem can be expressed in terms of a complex wave function. The Liouville equation for the classical probability distribution implies that the time evolution of this wave function obeys the Schrödinger equation for a quantum particle in a potential. The potential arises from space-dependent external fields in the otherwise relativistic classical field theory. It can be chosen arbitrarily, realizing the typical quantum effects of interference, tunneling or discrete energy spectra.

While a minimal Kitaev chain is promised to host unprotected Majorana zero modes, its role for spin qubits is relatively underappreciated. Following recent breakthroughs in the fine control of transport behaviors, we propose to use minimal Kitaev chain as a robust coupling module between spin qubits. Long-distance, anisotropic exchange coupling can be mediated by the Andreev bound states (ABSs) in the hybrid segment. The chemical potential of ABS gives a simple way to selectively control the coupling strength and its response to local perturbations. Moreover, this additional control degree of freedom creates a unique sweet spot, allowing both strong coupling and first-order immunity against charge noise. The protected qubit encoded on the minimal Kitaev chain at the sweet spot is shown to boast over 200 fold improvement in decoherence time.

Gate-based digital quantum simulations offer an exciting new paradigm for studying the many-body physics of strongly correlated systems. In this context, electron-phonon models are challenging for qubit-only quantum simulators, as bosonic degrees of freedom require costly finite-dimensional encodings. Here, we elaborate on an alternative approach based on a digital-analog circuit QED architecture, where fermions are encoded in transmon qubits while bosons are represented directly by microwave resonators. The central building block of this framework is a qubit-resonator Rabi gate that emulates strong electron-phonon coupling and can be implemented through a sequence of resonant Jaynes-Cummings gates interleaved with layers of single-qubit rotations. Using this Rabi gate as the fundamental unitary operation, we construct quantum circuits for the Hubbard-Holstein and Yukawa-Sachdev-Ye-Kitaev models, which describe, respectively, strongly correlated electrons coupled to phonons and phonon-mediated interactions among Majorana fermions. We further demonstrate how nonclassical phonon physics and signatures of quantum chaos in these models can be probed through circuit simulations, and develop measurement and variational protocols tailored to near-term superconducting quantum hardware.

The multi-qubit gates fidelity of superconducting quantum processors can be limited due to the dressing of computational states by noncomputational ones. Here, we experimentally and analytically investigate a transmon-transmon-bus system where the computational states dressing is tunable over a broad range. We estimate the dressing using three methods: a full three-element model, an effective mode approach, and an unperturbed mode approach. The obtained results highlight the importance of the accurate estimation and control of the computational states dressing in order to optimize gates on superconducting platform.

Deterministic sources of entangled photon pairs and indistinguishable photons are expected to play a key role in photonic quantum technologies. Semiconductor quantum dots are promising candidates due to their on-demand emission and compatibility with nanophotonic structures. However, current implementations face trade-offs between extraction efficiency, Purcell enhancement, as well as charge noise that causes blinking and degrades indistinguishability. Here we demonstrate a tunable nano-optoelectronic device based on a quantum dot embedded in a p-i-n diode circular-Bragg-grating-resonator and featuring extraction efficiencies up to 0.55(6) and Purcell-factor of $\sim$8. The device generates wavelength-tunable entangled photon pairs with suppressed blinking and raw (corrected) concurrence > 0.89 (0.91) over a range of 1.6 nm. The very same source also emits single, nearly Fourier-limited and highly indistinguishable photons with raw (corrected) $\mathcal{V}_{\text{HOM}}$ = 0.951(4) (0.988(6)). These results demonstrate a viable platform for semiconductor quantum photonics.

Neutral Atom Quantum Computing (NAQC) is an emerging modality for scalable quantum computation, valued for its long coherence times and the naturally identical atomic qubits. However, one of the main drawbacks is its slow execution rate, dominated by lengthy classical processing tasks, such as fluorescence imaging, cooling, and atom rearrangement. We address this bottleneck with AtomFlow, a field-programmable gate array (FPGA)-based control architecture that consolidates fluorescence-image analysis and a newly developed atom-rearrangement algorithm onto a single Zynq UltraScale+ device. By co-locating the two stages on the same board and emitting rearrangement moves in a streaming fashion as soon as they are computed, AtomFlow eliminates the round-trip latency of conventional host-mediated pipelines. Evaluated on a 16x16 atom array, AtomFlow achieves an end-to-end latency of 25.3 ms with a first-move latency of 4 ms and an average move generation of 1 ms. Furthermore, our scalability analysis demonstrates that the architecture can readily support larger atom arrays within a single-board resource budget.

We investigate discrete dynamics in quantum circuits with gates corresponding to the S-matrix of a supersymmetric 1+1D quantum field theory. We show that for a brick-wall configuration such circuits support both localized and delocalized dynamically conserved operators known as strong zero modes (SZM), the number of which depends on the parameter regime. We demonstrate that, while some of the SZM remain localized at boundaries, other SZM propagate ballistically, guided by a choice of circuit parameters. Such propagation can be explained by a strong Dzyaloshinskii Moriya term appearing in the dynamics. We describe how to exploit propagating SZM for quantum information transport and discuss the robustness to various types of noise.

We investigate the non-Hermitian skin effect (NHSE) and topological phases in a ladder model with staggered nonreciprocal inter-leg hopping, consisting of an Su-Schrieffer-Heeger (SSH) chain coupled to a normal tight-binding chain. By tuning the system parameters, we show that the direction of the NHSE under open boundary conditions can be reversed and can even become energy dependent. The NHSE is further characterized by the spectral winding number under periodic boundary conditions. We further demonstrate that the inter-leg coupling significantly enlarges the topologically nontrivial parameter regime. Remarkably, the zero-energy topological edge modes reside on different legs of the ladder and are characterized by real-space winding numbers $W=\pm1$. Furthermore, increasing the nonreciprocity of the inter-leg hopping modifies the topological phase boundaries and eventually drives the system into a topologically trivial phase. Our results establish staggered nonreciprocal inter-leg hopping as an effective mechanism for engineering both the non-Hermitian skin effect and topological phases in ladder systems.

Exceptional points (EPs) are non-Hermitian degeneracies at which two eigenvalues and their eigenvectors coalesce, producing a defective Hamiltonian and a double pole of the $S$-matrix. Using the coupled-channel Gamow Shell Model with the $\ell=1$ spin-orbit strengths as control parameters, we locate and characterize EPs in $^6\text{Li}$, $^7\text{Li}$, $^7\text{Be}$, and $^8\text{Be}$, and analyze their imprint on energies, widths, phase rigidity, spectroscopic factors, elastic cross sections, survival probabilities, and spectral functions. The signatures of the EP in scattering and time-domain observables are found to be strongly channel-dependent, and threshold effects play a decisive role in determining the accessibility of the EP in parameter space.

Second-order boundary value problems are central to computational science, yet standard matrix-based numerical formulations can obscure the local geometric structure that quantum circuits may exploit. Here we introduce a framework for explicitly constructing finite-dimensional counterparts of continuous differential operators in a form compatible with quantum computation. Starting from the exterior derivative, its adjoint, and the Hodge operator, we derive discrete realizations of second-order operators on primal–dual cell complexes and reformulate them as star-local update rules expressed through explicit functions that return the relevant bounding chains rather than through matrix representations. This yields simple, uniform, and scalable quantum circuits. We demonstrate the construction for div–grad and curl–curl operators, showing that the same star-local compilation principle extends across different operators, cell complexes, and manifold dimensions within a common framework. More generally, the framework provides a systematic route to quantum algorithms for partial differential equations.

Quantum oracles are a common building block of many quantum algorithms, where circuit depth is a primary cost that directly affects overall performance. Synthesizing oracles for SAT (CNF) formulas under a limited ancilla budget, however, tends to yield deep circuits, as existing methods underexploit clause-level parallelism. In this work, we present the Clustered Synthesis Tree (CST), a depth-oriented framework whose core idea is to group the individual clause leaves of a hierarchical synthesis tree into clusters, exposing instance-dependent clause-level parallelism under ancilla constraints. CST comprises three parts: the clause-grouping problem it induces, which we formulate as an ancilla-constrained scheduling problem and prove NP-complete in general, is addressed by SeedGrow, a polynomial-time $O(m^2 k)$ heuristic; ClausePack, a reversible oracle that evaluates a cluster's clauses in parallel at only a logarithmic-depth overhead; and CST-Map, which compiles the clustered tree into an executable SAT-oracle. On random $4$-CNF under the same ancilla budgets, CST reduces the oracle's circuit depth over the state-of-the-art (SOTA) baseline by $68\%$–$94\%$. On the standard SATLIB benchmarks, CST achieves about a $2.6\times$–$43.2\times$ reduction over the SOTA baseline, with the largest gains under dense variable sharing, and matches the baseline's maximum-budget depth using only $3.7\%$–$20\%$ of its ancilla qubits. A Grover-search resource estimate shows the advantage carries over to the full algorithm, reducing total circuit depth by $70\%$–$89\%$.

Testing quantum states for symmetries has multiple applications in quantum state comparison or as a primitive in more complex quantum algorithms. We present a method that determines whether an input photonic state is invariant under the action of a cyclic group defined by an operator $\hat{S}$ with eigenvalues which are roots of unity. The results generalize previously known circle and SWAP tests related to suppression laws in Fourier interferometers and offer a new test for permutations defined by a binary shift and a way to search for eigenstates in multiphoton states. Finally, we discuss the scenarios where this measurement can be used to perform Hadamard test, a fundamental primitive in variational and quantum machine-learning algorithms.

We investigate the use of variational quantum algorithms to prepare and characterize fractional quantum Hall states on near-term quantum processors. Focusing on the $\nu=1/3$ Laughlin phase described by the $V_1$ Haldane pseudopotential, we formulate the lowest-Landau-level problem in second quantization, and implement particle-number-preserving variational circuits combined with the variational quantum eigensolver (VQE) and variational quantum deflation (VQD). We benchmark the approach in two complementary geometries: Haldane sphere and torus shape. On the Haldane sphere, the target state is a unique zero-energy Laughlin ground state, providing a controlled test of the variational workflow and of excited-state reconstruction. On the torus, the problem retains the genuinely two-dimensional periodic character of the quantum Hall liquid and exhibits the threefold topological ground-state degeneracy expected for the $\nu=1/3$ fractional filling factor. This feature makes the torus a more demanding benchmark than the quasi-one-dimensional cylinder or thin-torus limits commonly exploited in state-preparation quantum protocols. We benchmark the hardware-optimized variational states against exact diagonalization using energy estimates, error-mitigated observables, and subspace-containment diagnostics. Our results show that hybrid quantum algorithms can approximately reconstruct the low-energy structure of small fractional quantum Hall systems, including the topological ground-state manifold on the torus. Beyond serving as a benchmark for quantum hardware, this geometry-resolved approach provides a route toward quantum simulations of fractional Chern insulators and strongly correlated topological phases in realistic two-dimensional materials.

Moment-based relaxations of the positive partial transpose (PPT) criterion have been recently introduced, as a hierarchy of entanglement criteria involving only experimentally accessible quantities of a given bipartite state. The goal of this work is to study their typical detection performance on high-dimensional bipartite systems. Concretely, we investigate whether random bipartite mixed states on $\mathbb C^d\otimes\mathbb C^d$, obtained as the marginal over an environment $\mathbb C^s$ of a uniformly distributed pure state, generically satisfy or violate them. For each fixed level $m\in\mathbb N$ in this hierarchy of moment-based PPT criteria, we are able to identify a threshold environment dimension $s=\lambda_md^2$ at which the behavior of the associated random state switches from violating to satisfying it, with probability going to $1$ as $d$ grows. The proof combines combinatorics of permutations techniques to estimate the average value of moments of partially transposed random states and concentration of measure arguments to bound the probability of deviating from such average, when the underlying local dimension $d$ is large. We additionally need tools from the theory of Hankel determinant evaluation via orthogonal polynomials.

We control the spectral distribution of a spin ensemble by applying a magnetic field gradient using an anti-Helmholtz coil inside a dilution refrigerator, and demonstrate impedance matching between the ensemble and a transmission line, achieving -50 dB absorption of incident radiation. This represents a first step toward a spin-ensemble-based quantum memory for itinerant microwave photons. We further model the spectral distribution under the applied gradient to predict the spin-resonator response, and use the device to systematically tune the weak-to-strong coupling transition in both continuous-wave and time-domain pulsed measurements.

Privacy of a quantum metrological protocol concerns the extent to which single parameters can be kept inaccessible to an observer or to other users of the network. In this work, an information geometric framework is developed to quantify privacy and accessibility of functions of parameters effectively, that is, up to a finite accuracy in state discrimination. Both quantities are defined by measuring volumes in the parameter space induced by the underlying quantum states. This construction subsumes previous definitions of privacy based on the degeneracy of quantum Fisher information, naturally encompassing imperfect implementations. Using extended-GHZ states as a representative example of a quantum network scenario, privacy and accessibility are characterized by quantum correlations and accuracy, providing scaling laws depending on imperfect measurements and entanglement.

Weak values (WVs) arise from weak measurements performed within a time-symmetric formulation of quantum mechanics, where a system is both pre- and post-selected. Anomalous WVs that lie far outside the eigenvalue spectrum of the observable hold both fundamental and practical significance. However, their generation typically relies on near-orthogonal pre- and post-selection, which confines them to a single post-selection outcome with extremely low success probability. This constraint limits experimental accessibility and hinders the full exploitation of time symmetry. To overcome these limitations, we utilize quantum entanglement and post-selection-controlled operations to generate correlated pairwise two-state vectors. By changing the role of post-selection from passive filtering to active engineering, this approach enables the observation of anomalous complementary WVs associated with mutually exclusive post-selection branches. Our results extend the operational accessibility of time-symmetric quantum structures associated with the two-state vector formalism, and open new avenues for exploring the applications of time symmetry in quantum information processing.

The short Doppler-limited coherence time of the laser-excited Rydberg state, usually orders of magnitude shorter than the lifetime of the Rydberg state, hinders the Rydberg-mediated quantum technologies. Here, we show that a 649~nm~$-$~658~nm two-photon excitation of the $6sng~^1G_4$ Rydberg state from a long-lived d-orbital clock state of barium can be achieved with a two-photon wavevector that is tiny, which effectively removes the Doppler-limited decoherence. Moreover, the $6sng~^1G_4$ Rydberg state has strong dipole-dipole interaction due to small Förster defect with nearby Rydberg states and possesses long radiative lifetime. These can benefit quantum computing based on individually trapped neutral atoms, and can enable long-lived Rydberg polaritons in atomic media, which brings fresh opportunities in all-optical quantum information.

Quantum state tomography is sample-starved, and the states one prepares live on a narrow, learnable manifold. A $k{=}0$ prior-only control shows that on concentrated families a prior estimate is already near-optimal, so “high fidelity at few measurements” can be family memorization rather than tomography; genuine measurement-efficiency needs a model that conditions on the measurements and demonstrably uses them. On a shared matrix-product-state (MPS) core parameterization we study two routes. Approach~A learns a generative prior over MPS cores with measurement-guided posterior inference (gold-standard-validated, but whose few-measurement accuracy the control shows is largely the prior). Approach~B, our main proposal, is a fixed-protocol amortized MPS estimator trained once with a gauge-invariant fidelity loss; we deliberately do not rest it on a permutation-invariant set encoder (a plain MLP matches it). The decisive lever is the measurement design: motivated by the fact that local reduced density matrices determine a $\chi$-MPS, conditioning on an informative local Pauli set rather than random strings turns a modest, memorization-prone estimator into a high-fidelity one ($\approx\!0.95$, up to $+0.59$ over prior-only, decisively passing a shuffled-measurement control). A dropout ensemble, conformally recalibrated, gives $\approx\!90\%$-coverage intervals – including for observables never measured, where a shot-based interval does not exist. Quality holds as the system grows (fidelity $0.90$ at $n{=}10$, gain growing in $n$; $0.88$ at bond dimension $\chi{=}4$), the parameterization is polynomial (native contraction to $20$ qubits), and we close the loop on IBM hardware ($5$ states at $0.97$ from hardware-measured Paulis).

We demonstrate the feasibility of entanglement-based quantum key distribution (eQKD) in high-security financial infrastructure over a 22 km fiber link with 8 dB loss between two data centers using polarization entanglement. The fully automated system continuously generated secure keys for four months at an average rate of 63.8 kb/s, which were stored into a key management system and consumed to establish a VPN tunnel. The setup achieved 93.7% total up-time, with no downtime caused by the quantum optical components. Active polarization control kept the quantum bit error rate below 2% for 97.4% of the time and timing synchronization based on the entangled photon pairs' intrinsic temporal correlations achieved sub-300 ps precision. Our standalone system requires neither polarized guide lasers nor external high-precision time references. These results show practical integration of eQKD into operational financial infrastructure.

Distributed quantum computation needs to move logical qubits across lossy optical links, yet this transmission layer is usually designed separately from the computation it serves. We treat the two together by recognizing that a measurement-based quantum repeater is a two-dimensional code foliated along the transmission axis, so that the dominant channel loss is concentrated on the transmitted sector while the locally measured qubits are largely spared. Matching a code's distance to this structural asymmetry, we show that a rectangular Bacon-Shor subsystem code transmits a logical qubit markedly more efficiently than transmission-unaware encodings. Over continental distances, its cost-optimal repeater density is about an order of magnitude lower than that of a recent $[[48,6,8]]$ benchmark at comparable transmission rate, and roughly half that of a symmetric code of equal size. Moreover, we extend the framework to a central-to-client round trip in which a code-level, distance-preserving code switch joins the transmission legs to the client's computation, and joint decoding of the heterogeneous syndrome record at the central node lets distributed quantum computation proceed with a decoder-free client.

Finite quantum-logical constructions can appear classical or nonclassical depending on which structure is retained. We distinguish incidence tests based on valuations, colorings, and partition representations; simplex-embedding tests for specified prepare-and-measure fragments; and operator-functional tests imposing spectral and product rules. We show that the collective GHZ joint measurement is a single Boolean context and becomes nonclassical only when a common assignment of local factors, together with product preservation, is required. For selected labelled ray fragments, we compute state-depolarizing thresholds for a restricted projector-cone factorization and for a specified vector-generated operational closure, separating exact primal–dual certificates from numerical estimates. These values are properties of the stated fragments and noise model, not invariants of the underlying hypergraphs or a universal ordering of contextuality.

Multiscale modeling of complex chemical systems requires algorithms that operate coherently across electronic, atomistic, mesoscopic, and continuum scales. While quantum algorithms have been proposed for each regime, no systematic framework exists to compose them across scale boundaries. Here, we identify the conditions under which fault-tolerant quantum algorithms might preserve scale-specific quantum advantages. We map quantum phase estimation, Hamiltonian simulation with Gibbs state preparation, quantum random walks, and quantum partial differential equation solvers onto electronic structure, molecular dynamics, mesoscopic kinetics, and continuum reactor physics, respectively. Crucially, these correspondences do not imply unconditional end-to-end quantum advantage; speedups depend heavily on state preparation, memory architectures, matrix conditioning, and classical readout costs. Six unresolved questions define this composition problem, illustrated via a quantum hierarchy for \ce{CO} oxidation over \ce{Pt(111)}. We propose viewing inter-scale transfer as a quantum channel composition problem at the interface of algorithm design and non-equilibrium statistical mechanics, and ask whether information loss at scale boundaries is intrinsic to multiscale modeling or merely a consequence of lossy classical transduction between algorithmic layers. The resulting roadmap suggests that multiscale quantum advantage is governed primarily by the structure of information transfer between algorithmic layers, rather than by performance at individual scales alone.

We present a quantum process calculus that can split the system state along process boundaries and follow the evolution of each process in isolation, without losing information about the joint state-a property we call spatial compositionality. Compositionality is the key to reasoning about any complex system, yet quantum process calculi have struggled to provide its spatial kind, which would enable analyzing a system one process at a time. Many a quantum process calculi have been proposed, but they invariably rely on a global state representation based on state vectors or density matrices, with no known way to split them without losing information about entanglement. We propose to model quantum states with Deutsch-Hayden descriptors instead, which provide a modular representation of qubit states and their evolution. We adapt these descriptors to allow arbitrary splitting and merging of the store of qubits, leading to an unusual process calculus in which qubit transfer messages carry the actual state of the qubit, where existing calculi transfer only a reference. The calculus gives localized views of system state visible to each process, which can be assembled back together into the joint state. We define a notion of process equivalence with extensive justification grounded in physics and show a bisimulation whose soundness proof is simplified by spatial compositionality. The calculus can model open systems entangled with external processes, and we demonstrate this capability on a fragment of the BB84 key distribution protocol. This exercise shows that Deutsch-Hayden descriptors can successfully track qubit movements across process and system boundaries, though it needs help from density matrices to reason about information flow.

Probing, understanding, predicting, and controlling the real-time dynamics of quantum phase transitions in open systems are of pivotal importance to modern condensed matter physics, statistical physics, and quantum computing, among others. Here it is argued that a distinct temporal renormalization-group eigenvalue is needed for quantum criticality in open systems weakly coupled to their finite-temperature environment. This new physics enables the formulation of a general scaling theory that can accurately account for the critical properties including the specific Kibble-Zurek scaling in such open quantum systems. Remarkably, the critical exponents of time-related quantities are altered nonperturbatively regardless of how weak the coupling is, except for an Ohmic bath. Perspectives for future study are also discussed.

Interacting dipolar two-level systems form a special class of qubits that interact with a cavity in a particular way. We first prove that the Markovian dynamics of one 1/2-spin in interaction with a quantised magnetic field from a multi-mode cavity at thermal equilibrium is equivalent to a two-level atom interacting in the dipole approximation with the electric field of the cavity. We then use the Born-Markov approximation to study the dynamics of two spins interacting through the antiferromagnetic Heisenberg coupling in the same environment. By solving the GKSL equation, we find the exact expression of the density matrix of the system, with the off-diagonal coherence decay time and spin relaxation time. The concurrence for the stationary state is explicitly derived for any kind of initial state and the role of the singlet state is brought to light. The temporal evolution of the concurrence is numerically computed for different initial states, the phenomenon of sudden death and revival of the entanglement is observed for this dynamics. A detailed analysis of the sudden death and revival of the concurrence is conducted for Werner states, with new analytical results obtained thanks to the solution of the GKSL equation. We finally derive the equations and the stationary concurrence for the XXZ coupling.