Papers

Here we analyze the creation of quantum simulacra: phenomena that emerge from treating a Hermitian or non-Hermitian quantum system in metrics other than the standard $L^{2}$. Changing the metric redefines the set of system observables and thus the experimental arrangement for their measurement, making quantum contextuality and microscopic reality metric-dependent. The simulacra therefore consist, on the one hand, of a resizing of the status of quantum measurement, which has always occupied a central role in quantum mechanics: beyond the connection between quantum and classical dynamics, measurements performed in an appropriate metric can emulate a microscopic reality distinct from that prescribed by the Hamiltonian. On the other hand, simulacra provide a route to implementing quantum operations that lie beyond the reach of the $L^2$ metric. Quantum simulacra offer, as an example, an explanation for the recent observation of the violation of Bell inequalities with unentangled photons [Sci. Adv. 11, eadr1794 (2025)]: photons that are separable in $L^2$ metric, become entangled when analyzed within a new metric framework. Simulacrum comes at the cost of implementing measurements of the metric-redefined observables; to address this challenge, we propose a scheme combining positive operator-valued measures with postselected subensembles.

Passive linear optics is a restricted model of quantum computation, with complexity-theoretic evidence of quantum advantage for sampling tasks and low losses that make it attractive for near-term algorithms. In qubit architectures, a body of work has revealed a close connection between barren plateaus and classical simulability. Whether an analogous tradeoff exists for bosonic systems remains largely unexplored. Building on a recently developed representation-theoretic framework for moments of random passive linear-optical circuits, we characterize the concentration of expectation values for relevant families of particle-number-preserving observables by evaluating their projections into irreducible representations of the unitary group and analyzing their asymptotic scaling. We show that concentration is governed by the misalignment of the projections into irreducible representations of the input state and the observable, giving a unified representation-theoretic interpretation of generalized entanglement and locality in the bosonic setting. We further relate these concentration properties to existing classical simulation techniques, identifying broad classes of trainable observables that admit efficient classical simulation. Conversely, we identify Fock-state inputs and observables that appear to evade exponential concentration while retaining a polynomially large signal component not accessible to known efficient classical simulation methods. The separation is only partial: most of the signal remains classically tractable, and the residual part, while not exponentially suppressed, is small enough that a truncation serves as a classical surrogate with polynomially small error. Our framework nonetheless provides a systematic route for searching for regimes that unambiguously combine the absence of exponential concentration and lies beyond known efficient classical simulation methods.

Optimal control problems arise in a wide range of scientific disciplines, but the corresponding optimization algorithms often display a strong dependence on hyperparameters that significantly influence performance and convergence. For the optimal implementation of quantum algorithms, these challenges are further amplified by high-dimensional control landscapes and the need for high-fidelity operations. Here, we propose an algorithm for optimal control problems in quantum computing to efficiently generate high-fidelity control protocols for multi-qubit systems in a hyperparameter and gradient free manner. The method, referred to as Pulse Engineering via Projection of response functions at infinite nonlinear order (PEPRino), leverages the framework of response theory to navigate the control landscape to find high-fidelity implementations. This is achieved by determining the control landscape via response functions to infinite order, efficiently evaluated by resummation in terms of the first and second order response function. To demonstrate the approach, we apply it to quantum systems consisting of two and three qubits for the optimal implementation of the Quantum Fourier Transform (QFT). We benchmark the proposed algorithm against the Chopped Random Basis (CRAB) algorithm utilizing the Nelder-Mead method, focusing on the 2-qubit scenario. The results indicate faster convergence regarding iteration steps and computational time, highlighting the advantages of our approach.

Variational quantum algorithms offer a promising route to combinatorial optimization, but their applicability is limited by the challenge of encoding large-scale problems within restricted qubit resources. In this work, we introduce a qubit-efficient variational framework based on Pauli correlation encoding (PCE) and apply it to electric power demand portfolio optimization. Binary variables are represented through expectation values of Pauli correlation operators, which encode multi-body correlations of the quantum state and provide a continuous relaxation enabling compact representations with few qubits. We further propose a two-stage hybrid formulation, in which a time-averaged problem provides initialization for a time-resolved optimization. Numerical simulations demonstrate near-optimal performance across problem sizes ranging from $m=18$ to $10{,}296$, with normalized cost gaps on the order of $10^{-4}$ relative to solutions with certified optimality. We show that the performance is governed by the interplay between continuous relaxation and discretization: the effective resolution of the correlator representation determines how reliably improvements in the continuous loss translate into better discrete solutions, with larger systems exhibiting more consistent behavior. Finally, we demonstrate robustness on a trapped-ion quantum processor, where high-quality solutions are obtained despite noise and finite sampling. These results establish PCE as a physically motivated and qubit-efficient framework for large-scale combinatorial optimization.

Using stimulated emission, a photon pair source can be characterized by seeding the signal mode with a bright classical beam and measuring the stimulated idler field, thus replacing two-photon coincidence counting with classical intensity detection. We apply this approach to the continuous transverse spatial degrees of freedom of a down conversion source and show that it is possible to certify spatial entanglement with only intensity measurements. We demonstrate this capability through variance-based entanglement and steering witnesses, as well as the Fedorov ratio. This method is useful for studying entanglement properties of photon pair sources in conditions where alignment and photon counting measurements are difficult and time-consuming.

Trapped-ion quantum computers rely on shuttling compilers, which cast an input algorithm into a sequence of ion-qubit movements within a given architecture. We present the first study in which a single frontier large language model (LLM), Claude Opus 4.7, generates and iteratively refines the Python code of shuttling compilers from written specifications. Starting with a compiler for (i) a linear segmented trap, we extend it to (ii) a trap with junctions, and finally achieve efficient compilation for (iii) a broad class of connected trap graphs. The compilers for the more general cases are seeded with code from the previous ones. We benchmark the LLM-generated compilers against state-of-the-art hand-crafted ones using a common suite of quantum circuits. The number of shuttling timesteps is reduced by up to 72% for (i) and up to 43% for (ii). For the broad case (iii) of freely connected architectures, we find large variations in the required number of shuttling timesteps, depending on the connectivity. A densely connected, junction-rich architecture yields up to an order-of-magnitude reduction in shuttling timesteps compared to a corridor-like one. Repeating the complete generation and evaluation with a second frontier LLM, Claude Fable 5, reproduces these findings, with the Fable 5 compilers surpassing the hand-crafted ones more often on the largest circuits. Our results show that an unmodified frontier LLM can produce working, correct, and competitive shuttling compilers without additional manual algorithmic engineering. Generating compilers this way reduces the development time for new architectures from several months to a few days.

Quantum resource testing is a fundamental primitive of quantum information processing, profoundly connected to resource manipulation. Its goal is to discriminate $n$ copies of a given resourceful state $\rho$ from all free (i.e., resourceless) states; key instances for applications are entanglement testing and quantum magic testing. The asymptotic characterisation relies on the recently proven Generalised Quantum Stein's Lemma (GQSL), which establishes the rate of decay of the false negative error probability for a fixed false positive error probability. This result, however, is intrinsically asymptotic and thus can provide no finite-resource guarantees, which makes its practical implications unclear. Here, we establish the first rigorous finite-$n$ bounds on quantum resource testing and hence quantum resource manipulation, thus strengthening the GQSL and providing explicit estimates on the number of copies needed to achieve a prescribed performance. As notable consequences, we obtain (a) the convergence of the regularised Rényi relative entropies of a resource, which settles the important open problem from [Fang/Hayashi, arXiv:2508.12901, IEEE ToIT 72:6, 2026]; and (b) the first sample-complexity bound for asymmetric resource testing: for any fixed false positive error probability, a false negative error probability of at most $\delta$ can be achieved with $n=O\left(\frac{\log(1/\delta)}{D^\infty(\rho\|F)}\right)$ copies of $\rho$, in the limit where $\delta \to 0$.

Any algorithm execution on quantum computers requires several repeated and costly executions (known as shots) to obtain reliable results. In this work, we propose a closed-form accurate analytical expression to determine optimal number of shots required for reliable execution of any algorithm on a quantum computer. We also present a theoretically grounded technique to distribute fixed shot budget across different partitions in a quantum circuit minimizing the total error. Our proposed analytical model helps to reduce the shots associated with reliable execution of quantum algorithms by about 58% compared to current practice, in turn reducing the energy consumption by upto 62%. Furthermore, our proposed optimal shot allocation technique across different partitions reduces total error by up to 73% compared to conventional approaches.

We establish a connection between Hardy's paradox and nonlocality sharing in sequential bipartite scenarios, where each subsystem is measured in turn by a chain of observers. We show that any correlations exhibiting a Hardy paradox in the two-input two-output scenario enable sequential violations of the CHSH inequality between arbitrarily many pairs of observers, using only projective measurements and the assistance of a small local ancilla system. Since almost all pure entangled states, with the only exception of the maximally entangled one, admit Hardy correlations, our protocol applies generically: almost all pure entangled states, if assisted by a local ancilla, allow for nonlocality sharing between arbitrarily many observer pairs using only projective measurements.

Quantum communication is ruled out when an eavesdropper can reconstruct the receiver's state. Yet states are operationally specified by measurement statistics, raising a sharper question: can access to every expectation value destroy communication? We show that it can. We call unbiased, variance-nonincreasing reconstruction under arbitrary reference extensions complete observable shadowing and prove that it forces unassisted private and quantum capacities to vanish. An explicit qutrit channel realizes this mechanism while being neither antidegradable nor PPT, resolving the long-standing questions of whether quantum capacity can vanish outside those two classes and whether antidegradability is the only route to zero private capacity. Notably, it superactivates every finite-dimensional channel with zero quantum but positive private capacity. Statistical access can therefore preclude standalone communication without erasing latent coherent utility.

Fluctuation theorems for work provide universal constraints on nonequilibrium fluctuations, yet their quantum generalizations often rely on externally prescribed classical driving protocols. While for classical systems, fluctuation theorems have been extended to autonomous work, where the dynamics of the work source is subject to the backaction of the system, their generalization to the quantum regime is constrained by the uncertainty principle. Here, we extend fluctuation theorems for autonomous work from the classical regime to the quantum regime. By performing successive projective measurements over the work source and the system, we derive Jarzynski-type and Crooks-type fluctuation theorems for autonomous inclusive work from initial mixed thermal states. These relations are analogous to fluctuation theorems for autonomous work in the classical regime and explicitly incorporate the fluctuations of the work source. However, quantum noncommutativity prevents a consistent reduction to the nonautonomous counterparts, even in the limit of a large work source and correspondingly negligible backaction. By contrast, under the exclusive work definition, the nonautonomous limit is recovered when the measured observable of the work source commutes with its bare Hamiltonian and the backaction of the system on the work source is negligible. Our results are illustrated with the Dicke model, where a single-mode radiation field and an ensemble of two-level atoms act as the system of interest and the work source, respectively.

We prove the sharp uniform continuity bound for quantum conditional entropy. If two bipartite states are at trace distance at most $\delta$ and $d=\dim A$, the optimal dimension-only modulus of continuity is $h_2(\delta)+\delta\log(d^2-1)$ up to $\delta=1-d^{-2}$ and $2\log d$ thereafter, where $h_2$ denotes the binary entropy. When $\dim B\ge d$, this bound is tight for every $\delta\in[0,1]$. The key proof idea was developed with the assistance of ChatGPT 5.6 Sol, building on and adapting the tight classical proof of Alhejji & Smith [IEEE ISIT (2020)], which follows a conceptually different approach.

Variational quantum circuits have been central to many proposed near-term applications of quantum computing, but a growing body of evidence suggests that trainability and quantum advantage are fundamentally at odds: ansätze expressive enough to resist efficient classical simulation tend to exhibit barren plateaus, while structures that provably rule out barren plateaus typically render them classically simulable. We propose a stacked linear combination of unitaries (S-LCU) as a variational ansatz which provides a tunable trade-off between barren plateaus and classical simulability. Using a diagrammatic analysis, we bound the loss-landscape variance of the Free Fermion S-LCU, whose elements are fermionic Gaussian unitaries. We prove a variance lower bound of $\Omega(1/(n k^{3l}))$, with a simulation cost of $O(k^{2l} n^3)$ using the best known classical algorithm, compared to a quantum gate complexity of only $O(lkn^2)$. The number of layers $l$ serves as a single dial that trades computational complexity against the rate of cost concentration. This offers practitioners a systematic method for constructing ansätze with a complexity-trainability trade-off that best suits their application and hardware.

Completely positive (CP) matrices are ubiquitous in modern science and technology with applications in optimization, graph theory, and quantum entanglement. Recently, Johnston et al. [Linear Algebra and its Applications, 2022] have cast CP matrices into the framework of quantum resource theories, where CP states serve as free states and CP-preserving channels act as free operations. This work addresses several questions raised in their work. Specifically, we provide the necessary and sufficient conditions of CP-preserving channels in small dimensions, which are necessary in higher dimensions, and discuss the resource quantification via the trace distance of non-negativity. By constructing an explicit counterexample, we demonstrate that the trace-distance measure of non-negativity violates strong monotonicity. We also provide an alternative proof that every CPDNN channel $\Phi:\MM_n\to \MM_2$ is CPCP. Additionally, we show that any unital CPDNN map $\Phi:\MM_2\to \MM_n$ is also CPCP.

Grover's algorithm provides a quadratic speedup for searching unstructured databases and is traditionally implemented with qubits in Hilbert spaces whose dimensions are powers of two. With the advent of quantum platforms utilizing qudits—quantum systems with more than two levels—there is a need to generalize Grover search to these architectures, including heterogeneous systems with qudits of varying dimensions. Here, we present a unified framework for qudit-based Grover search, detailing the construction of oracles and diffusion operators with and without ancilla qubits and generalizing deterministic and fixed-point search variants that ensure exact or bounded success probabilities. We analyze phase-matching techniques and provide explicit circuit decompositions suitable for diverse hardware platforms. We also compare the corresponding trajectories on the Bloch sphere to provide an intuitive visualization of how the different phase choices amplify the target state. These results facilitate flexible, hardware-oriented protocols for implementing Grover search on qudit processors, potentially reducing circuit depth and enhancing success probabilities, thereby offering a practical toolkit for quantum computation and sensing applications leveraging multilevel quantum systems.

The simultaneous estimation of multiple parameters is a central task in quantum metrology, distributed sensing, and the calibration of large photonic interferometers. A fundamental question is how many independent parameter combinations can inherit Heisenberg scaling from a given number of squeezed probes in a multimode Gaussian network. Here, we answer this question for arbitrary passive linear optical networks. For a $p$-parameter, $M$-channel interferometer probed by $k$ single-mode squeezed states and at least one coherent state in the remaining channels, we show that the rank of the Heisenberg-scaling coefficient of the quantum Fisher information matrix is bounded by $n_{\rm HS}\le \min\{p,k(k+3)/2\}$, which corresponds to the maximum number of independent combinations of parameters that can be estimated with Heisenberg-scaling sensitivity. The bound separates into two geometrically distinct contributions. The covariance contribution of the quantum Fisher information, which describes squeezing-enhanced fluctuations, provides at most $k(k+1)/2$ parameter combinations estimable at Heisenberg-scaling sensitivity, while the first-moment contribution provides at most $k$ additional independent parameter combinations with Heisenberg-scaling sensitivity. We identify the conditions for saturating these bounds and construct a passive family of interferometers that saturates these bounds.

Residual dispersion breaks temporal-mode matching in photon-starved coherent links. For equiprobable $M$-ary PSK coherent states in a known spectral mode, with unknown symbols and carrier phase, we establish the quantum limit for blind joint estimation of group delay and second-order dispersion: after eliminating the common phase, it is $4N_s\mathbf{C}$, set by the covariance of the centered generators alone. A multi-output quantum pulse gate with photon-number-resolving detection locally attains it and supports reception below the standard quantum limit under turbulent fading.

Quantum networks can enable distributed computing and sensing. To realize these capabilities securely, quantum identity authentication is essential. Without authentication at the quantum layer, malicious repeaters may retain entanglement instead of performing swapping, enabling man-in-the-middle attacks (MitM) between communicating parties. Authentication mitigates this threat by embedding authentication qubits within data qubits at positions and bases based on a secret key shared a priori. While prior work analyzes security and MitM detection guarantees, physical layer side channel analysis remains unexplored. If an attacker infers protocol stages, it can avoid authentication qubits and extract data qubits, rendering authentication ineffective. To this end, we carry out experimental studies using a quantum communication testbed. A beam splitter is used to tap a portion of the optical signal, allowing the observer to collect side channel data without disrupting the quantum state. We evaluate two sampling settings, where 30% or 10% of the signal is diverted. The collected side channel data includes photon arrival timing and optical power data obtained using a single-photon detector and a power meter. Using this dataset, we extract and engineer features that capture both timing dynamics and signal intensity variations. We then train machine learning models to classify protocol stages based solely on side channel observations. Our results show that protocol-stage inference is feasible with high accuracy, reaching 98% (F1-score 97%) at 30% sampling and 96% (F1-score 94%) at 10% sampling. These findings reveal an overlooked vulnerability and highlight the need for robust designs against side channel inference attacks.

We use Krylov complexity as a typical diagnostic of quantum many body dynamics in the context of BMN matrix model at large mass gap. We calculate several physical entities, for example, the moments and return amplitudes at large mass deformation. We calculate them for both spread complexity of states as well as Krylov growth of operators in the matrix model. We propose a general expression for the moments at any given order $n$. We also discuss orthogonal polynomials for spread as well as operator Krylov complexity. In the context of the Krylov operator growth we further compute the spectral function and the density of states. A careful analysis of the spectral function near the resonance reveals various IR divergences in addition to the physical collective modes. These collective modes appear to be exceptionally stable due to large mass gap. On the other hand, the UV of the theory appears to be extremely damped due to higher scattering rates. We carefully diagnose these IR divergences near resonance which reveals that these collective modes are in fact non-propagating and should be thought of as diffusion modes or relaxation modes with infinite relaxation time. We also calculate the Krylov variance and Krylov entropy for the matrix model and in particular at early time. The linear early time growth of the Krylov entropy confirms the onset of quantum chaos in the matrix model at large mass gap.

Quantum communication is a key enabler of next-generation networks, leveraging quantum entanglement to enable a new class of information exchange. While prior work has focused on the theoretical analysis of communication protocols, their exposure to physical layer side channel analysis remains largely unexplored. In classical systems, side channel analysis has been shown to reveal sensitive information without accessing the underlying data, raising the question of whether similar risks exist in quantum networks. In this work, we investigate whether different quantum communication protocols exhibit distinguishable signatures that can be inferred through passive side channel observations. We consider a threat model in which an observer accesses only a fraction of the optical signal without directly measuring the encoded quantum states. Under this setting, we experimentally examine four representative protocols, namely entanglement distribution, quantum gate sequences, heralded quantum key distribution, and quantum identity authentication, realized on a polarization entangled photon link. Observable physical layer features, including single photon detection statistics and optical power measurements, are collected and used to construct protocol fingerprints. We develop a data-driven framework for protocol identification based on these observations. Our results show that protocol identity can be inferred with accuracy reaching up to 96% under 30:70 sampling configuration/optical tapping, while remaining distinguishable at 10:90 with accuracy ranging from 70-89%. Bell inequality measurements confirm that the sampling/tapping process preserves entanglement, validating the non-destructive nature of the observation model. These findings demonstrate that side channel analysis can expose protocol-level information without disrupting quantum correlations, introducing new security considerations.

Electronic decay processes provide a fascinating window into correlated electronic rearrangements occurring on ultrafast timescales. Following these dynamics in real time has become increasingly accessible experimentally, but extracting the underlying electronic dynamics from measured spectra requires understanding how nuclear motion shapes the observable signal. Here, we extend an analytical description of time-resolved electronic decay spectra to include dissociative nuclear dynamics and apply it to Interparticle Coulombic Decay (ICD) in the neon dimer. The resulting spectra reproduce the experimentally observed spectral shape and reveal an unexpectedly important role of interference between pathways involving different vibronic resonance states. We further establish a clear connection between the temporal build-up of the spectral structure and the nuclear wavepacket dynamics in the decaying electronic state. Most strikingly, our analytical expressions reveal that the time-dependent integrated ICD signal contains contributions proportional to both $\exp(-t/\tau)$ and $\exp[-t/(2\tau)]$. Nevertheless, a conventional mono-exponential fit can describe the temporal signal remarkably well while yielding a decay lifetime that differs substantially from the underlying value. Applying the theoretically derived fitting model to experimental data for the neon dimer yields an ICD lifetime $\tau$ of 73 fs, rather than the previously extracted 150(50) fs, placing the experimental value within the range of previous theoretical predictions. Since the underlying temporal structure is common to electronic decay processes, our findings have implications for extracting lifetimes from time-resolved decay spectra well beyond ICD.

The Traveling Salesman Problem is a classical NP-hard problem with significant implications in logistics, circuit design, and operations research. This paper presents a comparative study of four approaches to solving the Traveling Salesman Problem: brute-force enumeration, a 2-approximation algorithm using minimum spanning trees, simulated annealing, and the Quantum Approximate Optimization Algorithm. We implement each technique and evaluate them on graphs of varying sizes to analyze performance, solution quality, and scalability. In doing so, we have also developed an open-source framework that allows researchers and practitioners to explore, test and extend these methods.

Entanglement distillation and entanglement swapping have been extensively studied assuming perfect quantum memories. However, near-term quantum networks will be fundamentally limited by quantum memories with a finite coherence time, resulting in complex choices for the timing and ordering of these operations. In this work, we study entanglement distillation and entanglement swapping at the level of the elementary building blocks of noisy quantum repeater networks, with the goal of elucidating the fundamental tradeoffs induced by memory decoherence. First, we focus on a minimal one-hop setting, where we analytically compare “distill-as-soon-as-possible” and “distill-as-late-as-possible” strategies against a baseline strategy that simply discards the older entangled state. We find that in the low memory coherence time regime, discarding the older entangled state achieves higher expected output fidelity, while in the high coherence time regime, delaying distillation until the end achieves the highest expected output fidelity and, over most of the deadline range, the highest weighted coherent information, at the expense of a lower success probability. We then extend our analysis to two-hop repeater chains using Monte Carlo simulation. In this setting, we find that the highest weighted coherent information is achieved by strategies that defer distillation to the end of the time window, with Distill-ALAP-then-Swap-ALAP and Swap-ASAP-then-Distill-ALAP leading at different operating points, while Discard-Oldest-then-Swap never reaches positive weighted coherent information in any regime tested. Together, these results clarify how decoherence reshapes the optimal operation timing in quantum networks and provide instructive insights into the link-level principles that govern larger-scale architectures.

We investigate thermal quantum correlations in a system of two coupled superconducting spin qubits described by an effective Andreev spin-qubit Hamiltonian in the presence of spin-orbit interaction. Using Local Quantum Fisher Information (LQFI) and Local Quantum Uncertainty (LQU) as quantum-correlation quantifiers, we analyze the effects of the superconducting phase difference, tunneling amplitude, spin-orbit coupling, and temperature on the nonclassical properties of the system. Analytical expressions for the thermal density matrix are obtained and employed to evaluate both quantities. Our results show that quantum correlations decrease monotonically with increasing temperature, while stronger tunneling and spin-orbit interaction significantly enhance their robustness. Moreover, the superconducting phase introduces a pronounced periodic behavior through the modulation of the effective exchange couplings, leading to constructive and destructive interference regimes that strongly influence the correlations. By analyzing the energy spectrum of the effective Hamiltonian, we demonstrate that the enhancement of quantum correlations is closely associated with an increased energy gap between the ground and first excited states, which suppresses thermal excitations and stabilizes the correlated ground state. Furthermore, LQFI is consistently larger than LQU throughout the investigated parameter space, reflecting its higher sensitivity to quantum fluctuations and local parameter estimation. These findings reveal the microscopic mechanism governing thermal quantum correlations in Andreev spin qubits and highlight the important roles of phase engineering, spin-orbit interaction, and tunneling in protecting quantum resources in hybrid superconducting quantum devices.

To achieve translational symmetry for the computation of the band structure of a lattice model, one can either consider an infinite lattice or impose periodic boundary conditions (PBC). While in systems with short-range couplings these two approaches are equivalent, we show that for long-range couplings one can obtain considerably different results. We compare the two methods on the basis of one-dimensional quantum emitter chains both in free space and when coupled to a waveguide. The latter system allows for asymmetric couplings enabling the non-Hermitian skin effect, which we analyze using the two different band-structure calculation methods. We find that only PBC lead to physically and mathematically robust results, while the infinite-chain approach entails convergence issues and is unable to satisfyingly explain the emergence of the non-Hermitian skin effect in the waveguide system. Using PBC reveals unusual findings like a non-star shaped generalized Brillouin zone and strongly localized eigenstates with zero winding number.

We study the task of estimating a $d-$dimensional quantum state $\rho$ under the constraint that the measurement is $\alpha-$gentle. Such measurements $M$ do not collapse the state; they issue both a random variable $R^M = \omega$ containing statistical information and a post-measurement state $\rho_{M \to \omega}$ such that $\|\rho_{M\to \omega} - \rho\|_{Tr} \leq \alpha$. We describe gentle measurements and their connection to quantum differential privacy. Our results show that the optimal minimax estimation rate in Frobenius norm is of order $d^3/(n \alpha^2)$, instead of $d^2/n$ for general measurements. Moreover, for rank $r$ states with $r\leq d$ we prove that the optimal minimax rate is $rd^2/(n \alpha^2)$, instead of $rd/n$. Very surprisingly, the loss for gentleness $d/\alpha^2$ scales with the ambient dimension of the Hilbert space, rather than the number of parameters $rd$, typically seen in classical differential privacy. We propose optimal gentle measurements and indicate how they can be physically implemented using an ancillary state and a CNOT gate to entangle it with the initial state. We notice that the resulting random variable has a likelihood that satisfies local differential privacy. Lower bounds are proven through a new quantum information-theoretic inequality applied to well chosen families of states in the manifold of (small-rank) quantum states.

I construct a Bohmian version of a 2-state quantum system, where in addition to the quantum state, the system is characterized by a definite physical state which changes stochastically under the guidance of the quantum state. I argue that the probabilities produced by this process are well-defined, contrary to claims in "Why quantum mechanics cannot be formulated as a Markov process" by D. Gillespie (1994) about a related model.

We solve the two-copy distillability problem for Werner states in every local dimension. Our main matrix result is a sharp, dimension-free inequality: for every rank-at-most-two operator, the sum of the squared Hilbert–Schmidt norms of its two partial traces is bounded by twice its squared Hilbert–Schmidt norm plus one half of the squared modulus of its trace. This implies that a Werner state $\rho_\alpha$ is two-copy distillable if and only if $\alpha<-1/2$. In particular, the two-ququart state $\rho^{(4)}_{-1/2}$ is two-copy undistillable, resolving Problem 5 of Horodecki, Rudnicki, and Życzkowski. For an arbitrary finite number $k$ of copies, we give three exact formulations of the remaining problem. At the endpoint $\alpha=-1/2$, undistillability is equivalent to nonnegativity of the endpoint partial-trace form on every rank-at-most-two operator. We also derive an equivalent hierarchy of operator inequalities $H_k(\psi)\succeq0$ for pure states with a maximally mixed qubit marginal. The two-copy proof does not formally induct, because partial trace can increase rank and $2$-positivity is not generally preserved by tensor products. We prove two rigorous many-copy extensions. First, the quadratic form factorizes exactly on tensor-factorized witnesses; for any such decomposition, the endpoint inequality holds if its possible rank-two factor is supported on a block containing at most two copies. Second, we construct explicit constants $\gamma_k>0$ such that $\alpha\ge-\gamma_k$ implies $k$-copy undistillability in every dimension. The initial proofs were generated by ChatGPT 5.6 Sol; the authors have verified and rewritten them to enhance readability and provide additional context.

What are the minimal requirements for a physically reasonable mathematical model for quantum theory or a potential extension? In addressing this question, rather than relying on the generalized probabilistic theories or other usual approaches, we propose a reset based on the following fundamental features: transition probabilities, which are typical of quantum theory, and continuous reversible dynamical processes (e.g., represented by a Lie group), which play the same crucial role in classical as well as in quantum physics. In doing so, we get back to the very elementary transition probability space framework originally introduced by Bogdan Mielnik in 1968 and combine it with the continuous reversibility condition. The primary class of valid spaces arises from the irreducible atomic JBW algebras, which encompass the irreducible atomic von Neumann algebras and the Jordan matrix algebras. The von Neumann algebras represent the model of common quantum theory. Beyond these, there is a non-standard valid space, where the exceptional Lie group $E_6$ acts transitively. While $E_6$ has been proposed as a candidate for internal symmetries in particle physics, we highlight that this model deviates from standard quantum theory in critical ways. Specifically, it fails to guarantee the existence of post-measurement states in all situations. Though the above postulates are powerful, they still allow for some physically meaningless models. A further feature of quantum theory (the correspondence between the pure states and the minimal projections) leads us to an additional requirement that rules out these models. However, a complete classification of the valid models remains one of the open issues, pointed out in the paper, which is intended for the mathematical and physical experts, inspiring them to tackle these problems.

An upstream neutral mode can influence quasiparticle tunneling even when electric charge propagates only downstream. We propose a three-path fractional quantum Hall interferometer that probes this directional structure through the flux dependence of average terminal currents. Interference between direct and two-step tunneling first contributes at cubic order in the tunneling amplitudes of three weak quantum point contacts. In the local theory, equal drain voltages separate the downstream and upstream responses: for a purely downstream tunneling excitation, the cubic fundamental Aharonov-Bohm harmonic vanishes at one drain, while the other remains bright. Averaging measurements with exchanged unequal drain voltages extends this separation to a configuration in which all contacts are biased. It requires independent calibration of the electrostatic phase shift and fixed or known tunneling magnitudes. For a selected Abelian excitation with two-point correlation exponent $0<\Delta_{\boldsymbol{\ell}}<1$, the common low-temperature bias power and directional amplitude ratio determine its scaling dimension and principal exchange angle. We also show that a weak static density interaction spanning two tunneling points can activate the dark harmonic without adding an upstream mode. In the high-bias static limit, the first-order Laughlin activated amplitude scales as $E^{2\nu-1}$, where $E$ is the source-drain bias energy and $\nu$ is the filling factor. In the weak localized single-mode infrared regime, the bright harmonic retains its leading scaling and can serve as a reference in the same device. The calculation assumes one coherent tunneling species and common-temperature edge correlations with unresolved propagation times.