Papers

We propose a bipartite quantum key distribution (QKD) protocol based on causal nonseparability: the presence of a resource – a process matrix – that does not correspond to any definite causal order between two parties. In our protocol, Alice and Bob perform local operations arranged in a “causal-order guessing game,” whereby each round yields an 85.35% probability of matching bits when the communication is undisturbed. This raw matching probability (or equivalently, a $\sim14.65\%$ error rate) is amenable to standard forward error-correction strategies. We further discuss the practical construction of the QKD protocol using indefinite causal order, where several different scenarios are deeply analyzed.

This work integrates the physics-informed neural network (PINN) approach into the neural quantum state framework to simulate open quantum system dynamics, to circumvent the computationally expensive time-dependent variational principle required in conventional variational methods. The proposed PINN-DQME method employs time-encoded neural networks within a time-domain decomposition strategy to represent the evolution governed by the dissipaton-embedded quantum master equation (DQME). We implement and validate this approach in the single-impurity Anderson model, benchmarking the PINN-DQME results against the numerically exact hierarchical equations of motion. The PINN-DQME method demonstrates high accuracy in simulating quantum dissipative dynamics at high temperatures, where non-Markovian effects are weak. However, for strongly non-Markovian dynamics at low temperatures, it encounters challenges with error accumulation during time propagation, highlighting an area for future refinement in applying PINNs to complex quantum dynamical settings.

Quantum gate teleportation enables the implementation of nonlocal quantum operations without direct interactions between distant nodes. We propose an efficient protocol for implementing arbitrary controlled-unitary (CU) gates acting on two spatially separated parties via indefinite causal order (ICO). By establishing a maximally entanglement between two remote nodes and coherently superposing orders of single-qubit gates, our protocol circumvents the drawback of complex local two-qubit operations. This ICO-based approach enables full programmability of CU gates by adjusting the inherent single-qubit operations, offering advantages over conventional fixed causal-order methods in terms of reduced circuit complexity and improved experimental flexibility. Furthermore, we develop an optical construction to implement the polarization CU gate using a stable and reciprocal Sagnac interferometer. Our work establishes a practical framework for scalable distributed quantum computation with flexible operations.

Quantum algorithms for electronic-structure simulations are actively being developed, yet many hybrid quantum-classical approaches are bottlenecked by the measurement overhead associated with large molecular Hamiltonians. Here we introduce a diagonalization-driven framework that progressively drives the electronic Hamiltonian toward a (block-)diagonal form in the Slater-determinant basis using sequential Givens rotations. In contrast to Schrödinger-picture methods that variationally optimize a wave function, our approach adopts a Heisenberg-picture viewpoint: the Hamiltonian is iteratively transformed, and rotation angles are determined classically from low-dimensional effective blocks, reducing the quantum workload to a small, fixed set of matrix-element measurements per iteration. Candidate generators are estimated via approximate Baker-Campbell-Hausdorff updates with truncation and cumulant-based approximations that control Hamiltonian growth, complemented by stochastic selection to avoid stagnation. We further introduce an angle-merging procedure that reduces circuit depth by consolidating repeated small-angle rotations. We benchmark the framework on N$_2$ and strongly correlated hydrogen systems, assessing convergence behavior, residual-structure diagnostics, measurement-accuracy trade-offs, circuit costs, and robustness under finite sampling.

We derive closed form expressions of weak relativistic corrections to the wave-packet dynamics of the quantum harmonic oscillator within a perturbative framework. General expressions are derived for the leading-order relativistic contributions to wave-packet parameters, such as the time-dependent widths, variances, and uncertainty relations. Specific calculations are performed for unsqueezed, minimum-uncertainty Gaussian wave packets, valid up to leading order in ($1/c^{2}$). When applied to electron wave packets, the results indicate that relativistic effects become non-negligible for keV-scale harmonic confinement energies: the deviations in variances reach $0.15\% - 1.5\%$ for an electron wave packet confined within the $1-10 \mathrm{keV}$ energy range. We also show that the standard saturation of the uncertainty relation remains unaffected by the leading-order relativistic effect.

We present Lattice (L, ticker: LAT), a peer-to-peer electronic cash system designed as a post-quantum settlement layer for the era of quantum computing. Lattice combines three independent defense vectors: hardware resilience through RandomX CPU-only proof-of-work, network resilience through LWMA-1 per-block difficulty adjustment (mitigating the Flash Hash Rate vulnerability that affects fixed-interval retarget protocols), and cryptographic resilience through ML-DSA-44 post-quantum digital signatures (NIST FIPS 204, lattice-based), enforced exclusively from the genesis block with no classical signature fallback. The protocol uses a brief warm-up period of 5,670 fast blocks (53-second target, 25 LAT reduced reward) for network bootstrap, then transitions permanently to 240-second blocks, following a 295,000-block halving schedule with a perpetual tail emission floor of 0.15 LAT per block. Block weight capacity grows in stages (11M to 28M to 56M) as the network matures. The smallest unit of LAT is the shor, named after Peter Shor, where 1 LAT = 10^8 shors.

Understanding the structure of multi-qubit quantum states is essential for both quantum information research and education, yet intuitive visualization beyond the single-qubit Bloch sphere remains challenging. In this work, we propose a unified geometric framework for visualizing two- and three-qubit pure states in which local degrees of freedom and entanglement degrees of freedom are explicitly separated. For two qubits, we combine Bloch-sphere representations of reduced density operators with a complex concurrence plotted on the complex plane, enabling simultaneous visualization of entanglement strength and phase structure. For three qubits, building on the generalized Schmidt decomposition, we introduce bipartite and GHZ-type tripartite complex concurrences, which, together with local Bloch vectors, provide a complete coordinate representation of the state. Unlike classification-based approaches, our method focuses on representing a given concrete state, revealing how local properties and nonlocal correlations coexist. The framework distinguishes states with identical entanglement magnitudes but different interference structures and provides intuitive insight into the balance between pairwise and genuinely tripartite entanglement. This approach offers both conceptual clarity and potential applications in quantum education and state analysis.

Recently, Kretschmer et al. [KGD+25] presented an experimental demonstration of a proposed quantum information advantage protocol. We present an alternate proposal based on a relation derived from parallel-repeated CHSH games. Our memory measure is based on an information measure and is different from [KGD+25], where they count the number of qubits. Our proposal has an efficient verifier and a noise-robust quantum prover which is arguably much more efficient compared to [KGD+25].

A higher-order Suzuki-Trotter decomposition or Trotterization can be exploited to mitigate the Trotter error in digital quantum simulation. This work revisits the second-order symmetric Trotterization in terms of the Trotter error, where quantum many-body spin dynamics of the transverse-field Ising model is simulated. While the work presents a pedagogical way to exploit a real quantum computer, the effectiveness of the symmetric Trotterization is evaluated in a prototype superconducting quantum device on IBM Quantum Experience. It turns out that the symmetric Trotterization does not provide higher accuracy than the first-order Trotterization in the testbed using the transverse-field Ising model. The result indicates that apart from the quantum errors, such as logical gate error and readout error, the use of a higher-order Trotterization should be circumspect, and the Trotter error would play an insignificant role in particular applications in an early stage of realized noisy intermediate-scale quantum (NISQ) devices.

The quantum mechanical description of phase remains a fundamental challenge, with theoretical efforts tracing from the early works of London and Dirac to discrete formalisms. In this work, we extend the action-angle formalism to the Helmholtz-Schrödinger equation by introducing a phase-dependent wavefunction $\phi(\theta, t)$ residing in the Hardy space $H^2(\mathbb{D})$. This mathematical structure, defined by functions analytic on the unit disk with square-integrable boundary values, naturally ensures the positivity of the energy spectrum while providing a rigorous framework for wave dynamics in photonic systems. We demonstrate that establishing a self-adjoint phase operator requires extending the Hilbert space to $L^2$, a procedure that necessitates the admission of negative energy states. We interpret these states through an analogy with the Dirac sea, where the existence of antiphase or antiphoton modes provides a conceptual framework for understanding the fundamental limits of phase localization and quantum uncertainty. This formalism is applied to light propagation in multimode waveguides characterized by anharmonic refractive index profiles. By mapping modal dispersion to our phase representation, we show that the deviation of propagation constants from linear spacing governs the spatial evolution of the optical field. This approach offers a clear mechanism for the emergence of periodic self-imaging known as the Talbot effect, the generation of fractional revivals, and the formation of complex fractal interference patterns, providing a robust toolkit for the characterization and design of multimode interference devices.

Single-electron spin qubits defined in quantum dots are used as building blocks of a semiconductor-based quantum computer. Readout in a scaled-up version of such a quantum computer is expected to rely on the Pauli Spin Blockade (PSB) mechanism. A desired functionality of PSB readout is that it reveals two bits of information on the two spin qubits that are involved in the process, such that the four computational basis states can be discriminated. In this work, we propose and quantitatively analyze an experimental procedure, based on gate reflectometry, which enables this four-state discrimination in a single measurement. We provide an intuitive recipe to maximize the contrast between the quantum capacitances of the four basis states. Focusing on silicon double quantum dots equipped with a micromagnet, we quantify how amplifier noise and phonon-mediated relaxation influence readout fidelity. Our results highlight a realistic opportunity to mitigate the overhead of readout ancilla qubits in a spin-based quantum computer.

Inferring the dynamical generator of a many-body quantum system from measurement data is essential for the verification, calibration, and control of quantum processors. When the system is open, this task becomes considerably harder than in the purely unitary case, because coherent and dissipative mechanisms can produce similar measurement statistics and long-time data can be insensitive to coherent couplings. Here we tackle this so-called Lindbladian learning problem of open-system characterisation with maximum-likelihood on Pauli measurements at multiple experimentally friendly transient times, exploiting the richer information content of transient dynamics. To navigate the resulting non-convex likelihood loss-landscape, we augment the physical model neural differential-equation term, which is progressively removed during training to distil an interpretable Lindbladian solution. Our method reliably learns open-system dynamics across neutral-atom (with 2D connectivity) and superconducting Hamiltonians, as well as the Heisenberg XYZ, and PXP models on a spin-1/2 chain. For the dissipative part, we show robustness over phase noise, thermal noise, and their combination. Our algorithm can robustly infer these dissipative systems over noise-to-signal ratios spanning four orders of magnitude, and system sizes up to $N=6$ qubits with fewer than $5 \times 10^5$ shots.

Entanglement fidelity quantifies how well a quantum channel preserves the correlations between a transmitted system and an inaccessible reference system. We derive closed-form expressions for the entanglement fidelity associated with several standard quantum noise models, including the random Pauli-X, dephasing, depolarizing, Werner-Holevo, generalized Pauli (Weyl), and amplitude-damping channels. For each model, we express the entanglement fidelity in terms of a general input density operator $\rho$, using Schumacher's Kraus-operator approach, which provides a channel-agnostic recipe applicable to any completely positive trace-preserving (CPTP) map with a finite Kraus representation. We then specialize to a communication scenario in which the source emits a two-letter parametric alphabet, thereby making explicit the dependence of entanglement preservation on both channel and source parameters. The resulting expressions enable direct comparisons of channel performance and rankings for representative families of input states, including common qubit states.

I study a promise problem for an unknown unitary operator acting on an $n$-qubit system. The operator is promised to take one of two forms: either it implements a fixed permutation of computational basis states, or it implements the same permutation together with a conditional sign change determined by a designated input qubit. I show that these two cases can be distinguished with certainty using a single query to the unknown operator and a measurement of only one qubit. The procedure requires no ancilla qubits and uses only $n+1$ Hadamard gates in addition to the oracle call. The promise is intrinsically quantum, since the two cases differ only in their relative-phase structure and therefore have no direct classical counterpart in the usual black-box model.

Gleason's theorem is often cited as establishing the Born rule from the structure of Hilbert space, yet its original proof is mathematically sophisticated and rarely accessible to physicists. In this article we present a simple route to the dimensional distinction at the heart of Gleason's result, using the generalized Bloch representation of quantum states. More precisely, we consider a restricted but instructive class of probability assignments obtained by replacing the linear dependence of the Born expression on a Bloch-space scalar product with a real function f. For qubits, infinitely many continuous non-Born assignments of this form satisfy normalization for every projective measurement. In dimension greater than 3, by contrast, the geometry of the measurement simplex imposes additional relations among the relevant scalar products. Requiring normalization for arbitrary states then leads to a Cauchy-type functional equation, which, together with boundedness, forces f to be linear. Our argument provides a complementary geometric illustration of why the freedom present in dimension two disappears in higher dimensions, reaching this conclusion directly from the geometry of the measurement simplices and normalization, without explicitly invoking the intertwining of projectors across different orthogonal resolutions of the identity.

We identify a fundamentally new class of resonances in light scattering from a pair of point-like electric dipoles. These resonances arise from multiple scattering response and correspond to poles of the two-particle Green function. The realization of exact resonances requires violation of the optical theorem, which holds in equilibrium systems but can be violated under nonequilibrium conditions, without violating causality. As a concrete example, we show that a pumped two-level atom can realize the required polarizability and access the exact resonance regime. Our results for one electric and one magnetic dipole show how resonances can amplify a weak magnetic response of a single dipole to the incident field. In equilibrium systems, only approximate resonances with finite amplification are possible. Using the Drude model for metallic nanoparticles, we show that while equilibrium resonances enhance the scattering, they never exceed the optimal single-dipole response.

Spectral control of closely spaced excitonic transitions is central to valleytronic photonics, nanoscale light sources, and wavelength-encoded sensing. In monolayer molybdenum disulfide (MoS2), the A and B excitons are separated by only tens of meV, making selective excitonic emission control both fundamentally important and technologically challenging. Here, we numerically investigate plasmon-enhanced excitonic emission from monolayer MoS2 coupled to vertically oriented hollow gold nanocylindrical cavities through a dielectric spacer. Finite-difference time-domain simulations combined with a photoluminescence-rate framework enable separate evaluation of excitation enhancement, radiative decay modification, nonradiative quenching, and excitonic charge generation. By tuning the cavity aspect ratio, the localized surface plasmon resonance is selectively aligned with either the A- or B-exciton transition, while the spacer thickness and refractive index regulate near-field coupling and the local density of optical states. Under optimized conditions, the excitation rate is enhanced by up to 4.34-fold and the radiative decay rate by more than 40-fold, yielding photoluminescence enhancements of 143.85 and 87.27 for the A and B excitons, respectively. The cavity also redistributes the relative excitonic peak intensities, producing exciton-selective peak ratios up to 2.4 times higher than those of bare MoS2. These results establish hollow plasmonic nanocavities as geometry-tunable platforms for exciton-selective emission and charge-generation control in atomically thin semiconductors.

We report the first realization of a fractional topological phase in a fully unitary, noninteracting discrete-time quantum walk implemented on finite cyclic graphs. Using a single-coin split-step cyclic quantum walk (SCSS-CQW), we uncover topological phenomena that are inaccessible within conventional cyclic quantum-walk dynamics. The protocol enables controlled engineering of quasienergy spectra, flat bands, and topological phase transitions through the step-dependency parameter and coin-rotation angle. We show that cyclic graphs with even and odd numbers of sites exhibit qualitatively different band structures, while rotational flat bands arise exclusively in $4n$-site cycles; a general analytic condition for their emergence is derived. The SCSS-CQW produces fractional winding numbers $\pm \frac{1}{2}$ (Zak phases $\pm \frac{\pi}{2}$), in sharp contrast with the integer invariants in standard cyclic quantum walks. These fractional invariants lead to an unconventional bulk-boundary correspondence and support protected {zero energy} edge states beyond the usual integer topological classification. In the step-dependent protocol, transitions between distinct fractional winding sectors generate robust edge modes pinned at zero quasienergy. Numerical simulations show that these states remain stable in the presence of both dynamic and static coin disorder as well as phase-preserving perturbations, while survival-probability analysis demonstrates their long-time persistence. Requiring only a constant number of detectors independent of the evolution time and fewer operators, the proposed scheme offers a minimal-resource and experimentally accessible platform for realizing fractional topology, flat bands, and protected zero energy edge states in small-scale synthetic quantum systems.

We give a general construction of genuinely multipartite entanglement signals from families of lower-partite symmetric local-unitary invariants satisfying a natural compatibility condition. Möbius inversion on the partition lattice plays a key role in this construction. We show that many examples of multipartite entanglement signals considered in the literature fit naturally into this framework. We also explain how the genuinely multipartite signal can be extracted from a general, not necessarily symmetric, multi-invariant.

This reply is also a friendly introduction to the impossibility of emergence of preferred structures from the Hamiltonian $\mathsf{H}$ and the unit vector $|\psi\rangle$ only. The obstructions to emergence are illustrated on the concrete construction of a tensor product structure (TPS) from Soulas et al., 2025 (arXiv:2512.07468v2). Soulas et al. offer their TPS as a counterexample to the proof from Stoica, 2022a (arXiv:2102.08620) that structures constructed only from $\mathsf{H}$ and $|\psi\rangle$ either contradict physical observations or can't describe them unambiguously. Soulas et al.'s construction of a unique TPS can't be both invariant and compatible with physical observations, so it can't be a counterexample. Its incompatibility becomes visible by examining how the relation between $|\psi(t)\rangle$ and the TPS, encoding the entanglement, changes in time. Therefore their TPS doesn't refute, but confirms (Stoica, 2022a). Besides this, since Soulas et al.'s method to construct preferred structures consists of choosing their invariants, by the same logic one could claim as well that the masses of elementary particles emerge uniquely just by fixing their values by hand. Soulas et al.'s construction is concrete and can illustrate the major obstructions for emergent structures, confirming them despite doing the best possible to avoid them. This makes it an excellent pedagogical tool to illustrate the trilemma, but also the relational and structural aspects of quantum theory and its symmetries.

Distributed quantum computing (DQC) connects many small quantum processors into a single logical machine, offering a practical route to scalable quantum computation. However, most existing DQC paradigms are structure-agnostic. Circuit cutting proposed by Peng et al. in [Phys. Rev. Lett., Oct. 2020] reduces per-device qubits at the cost of exponential classical post-processing, while search-space partitioning proposed by Avron et al. in [Phys. Rev. A., Nov. 2021] distributes the workload but weakens Grover's ideal quadratic speedup. In this paper, we introduce a structure-aware framework for distributed quantum optimization that resolves this complexity-resource trade-off. We model the objective function as a factor graph and expose its sparse interaction structure. We cut the graph along its natural “seams”, i.e., a separator of boundary variables, to obtain loosely coupled subproblems that fit on resource-constrained processors. We coordinate these subproblems with shared entanglement, so the network executes a single globally coherent search rather than independent local searches. We prove that this design preserves Grover-like scaling: for a search space of size $N$, our framework achieves $O(\sqrt{N})$ query complexity up to processors and separator dependent factors, while relaxing the qubit requirement of each processor. We extend the framework with a hierarchical divide-and-conquer strategy that scales to large-scale optimization problems and supports two operating modes: a fully coherent mode for fault-tolerant networks and a hybrid mode that inserts measurements to cap circuit depth on near-term devices. We validate the predicted query-entanglement trade-offs through simulations over diverse network topologies, and we show that structure-aware decomposition delivers a practical path to scalable distributed quantum optimization on quantum networks.

We demonstrate that the finite-temperature critical transverse-field Ising chain exhibits quantitative signatures of black-hole physics in its dual gravitational description within the AdS/CFT correspondence. Its finite-temperature dynamics and thermodynamics are consistently captured by a mixed thermal-AdS/BTZ black hole saddle, leading to three mutually compatible observations. First, antipodal excitation transport collapses onto a universal temperature-dependent curve determined by the relative AdS and BTZ contributions to the gravitational partition function, reflecting horizon absorption. Second, in the high-temperature regime, the retarded response exhibits exponential relaxation governed by the lowest quasi-normal mode of the dual black hole. Third, the temperature derivative of the von Neumann entropy develops a pronounced minimum at a temperature consistent with the Hawking-Page transition. These results identify critical quantum spin chains as minimal and experimentally accessible platforms for probing dynamical and thermodynamic aspects of quantum black holes in controllable many-body systems.

We study entanglement entropy (EE) in interacting quantum field theories (QFTs) at finite density. We argue that, in the limit of large subregions, the derivative of EE with respect to the size of the entangling region approaches the thermal entropy density, independently of microscopic details. We make this relation explicit using slab-shaped subregions, where the limiting behavior can be directly identified. At finite chemical potential, we show that EE satisfies thermodynamic response relations, including a generalized Maxwell relation linking chemical potential and charge density. We provide strong nonperturbative evidence for these statements in the three-dimensional O(4) model, and conjecture that they are generic features of continuum QFTs, establishing a two-way link between entanglement and thermodynamics that opens a route toward extracting the equation-of-state information from entanglement data.

Starting from generalized position operators, we derive complex and quaternionic angular momentum operators along with their commutation algebra as well. These algebras differ from the standard Hermitian ones, especially in terms of commutation relations involving partial and total angular momentum operators. Despite these differences, the effective quantum expectation values obtained from slightly deformed algebras align with those from the conventional Hermitian algebra. This suggests that even though the wave functions and resulting dynamics differ from standard quantum Hermitian behavior, these deformed algebras can still be effectively understood as valid angular momentum algebras.

Quadratic Unconstrained Binary Optimization (QUBO) is a standard NP-hard optimization problem. Recently, it has gained renewed interest through quantum computing, as QUBOs directly reduce to the Ising model, on which quantum annealing devices are based. We introduce a QUBO formulation for permutations using compare-exchange networks, with only $O(n \log^2 n)$ binary variables. This is a substantial improvement over the standard permutation matrix encoding, which requires $n^2$ variables and has a much denser interaction graph. A central feature of our approach is uniformity: each permutation corresponds to a unique variable assignment, enabling unbiased sampling. Our construction also allows additional constraints, including fixed points and parity. Moreover, it provides a representation of permutations that supports the operations multiplication and inversion, and also makes it possible to check the order of a permutation. This can be used to uniformly generate permutations of a given order or, for example, permutations that commute with a specified permutation. To our knowledge, this is the first result linking oblivious compare-exchange networks with QUBO encodings. While similar functionality can be achieved using permutation matrices, our method yields QUBOs that are both smaller and sparser. We expect this method to be practically useful in areas where unbiased sampling of constrained permutations is important, including cryptography and combinatorial design.

We consider an optical interferometer with coherent light in one input and a squeezed vacuum in another. Such an interferometer is known to beat the standard quantum limit of sensitivity to the difference of phase shifts in its arms. We find the ultimate limit of precision for such an interferometer by calculating the quantum Fisher information of the mixed quantum state in one of the interferometer's outputs about the difference phase. We show that, in the vicinity of the black fringe, this information is asymptotically close to the quantum Fisher information about this phase for the two-mode readout. We conclude that the single-mode readout is optimal for phase estimation in squeezing-enhanced interferometry and allows for the Heisenberg scaling of precision. We also show that the optimal local measurement in the vicinity of the black fringe consists of amplifying the output field in a phase-sensitive way and measuring its photon number.

Spectral crowding of collective motional modes limits the fidelity of entangling interactions in trapped-ion quantum processors by inducing off-resonant coupling to spectator modes. We introduce a geometric-phase entangling interaction driven by a transverse, time-dependent structured-light force. By applying the force in a plane orthogonal to the optical propagation direction, we reduce the effects of spectral crowding while preserving single-ion addressing. The scheme is compatible with arbitrary qubit encodings, provided that the qubit states experience a differential AC Stark shift. We experimentally realise high-fidelity two-qubit gates with error rates below $5\times10^{-3}$ in ion crystals containing up to 12 ions confined within a single potential well. These results establish gradient-field light-shift gates as a scalable approach to high-fidelity entangling generation in spectrally crowded trapped-ion systems.

Quantum key distribution is unbreakable in theory but may be hacked via imperfections in its hardware implementations. While many imperfections have been mitigated by countermeasures and advanced security proofs, several remain unsolved. One of these is a superlinear behaviour in single-photon detectors, when the click probability rises faster with the photon number of an incoming light pulse than expected from individual independent photon detections. Here we test an avalanche single-photon detector sinusoidally-gated at 312.5 MHz for superlinearity. Its click probability is moderately superlinear. However, we notice that the click timing depends strongly on the incoming pulse energy. The click occurs progressively earlier, shifting more than 2 ns as the energy rises over a wide 50-dB range. An attacker might use this energy-time effect to conditionally toggle the click between adjacent key bit slots, violating an implicit assumption in the security proofs and rendering them inapplicable. We propose two attacks that exploit this flaw.

We introduce the concept of quantum minimal learning machine (QMLM), a supervised similarity-based learning algorithm. The algorithm is conceptually based on a classical machine learning model and adopted to work with quantum data. We will motivate the theory and run the model as an error mitigation method for various parameters.

Gate fidelity – an average fidelity over all possible input states – is the workhorse metric for benchmarking quantum gates or circuits, yet fault-tolerant quantum computing ultimately depends on the worst-case behavior, typically quantifiable by so-called the diamond distance. In the low-error regime, the coherent errors can inflate the worst-case error even when the reported gate fidelity is high, making the gate fidelity alone an unreliable proxy for fault-tolerance readiness. To capture the missing information, we introduce a companion observable – what we dub the fidelity deviation – that quantifies how strongly the state-dependent fidelities fluctuate across input states. Adopting such fluctuations in assessing the fault-tolerance is physically natural because some input directions are nearly unaffected while others form narrow "valleys" that dominate adversarial circuit behavior. For coherent (unitary) gate errors on two or more qubits, we show that the gate fidelity together with the fidelity deviation constrains the relevant spectral moments of the error unitary, enabling an explicit and tight certificate of the worst-case error. Both quantities are estimated directly from the same randomized input-measurement experiment, without full process tomography. We show that the fidelity and its deviation can provide an economical, operationally meaningful, and accurate standard for assessing the fault tolerance of the engineered quantum gates and circuits.