Characterizing the relation between entanglement and Bell nonlocality is a long-standing open problem, notably challenging in the multipartite case. Here we investigate the effect of superactivation of genuine multipartite nonlocality. Specifically, we show that starting from multipartite states that feature only two-party entanglement (hence almost fully separable), it is possible to obtain GMNL in the many-copy regime. This represents the weakest possible resource for GMNL superactivation. On the technical side, we develop an efficient and practical criterion for certifying GMNL superactivation based on network entangled states, as well as a perfect parallel repetition result for the Khot-Vishnoi Bell game, which are of independent interest. less

We propose a general method for preparing stabilizer states with reduced two-qubit gate count and depth compared to the state of the art. The method starts from a graph state representation of the stabilizer state and iteratively reduces the number of edges in the graph using two-qubit Clifford gates to produce a unitary preparation circuit. We explore various heuristic search and AI-based approaches to optimally choose Clifford gates at each step, the most sophisticated of which is a combination of reinforcement learning and Monte Carlo tree search that we call QuSynth. We apply our method to synthesize code states of various quantum error correcting codes including the 23-qubit Golay code and the 144-qubit gross code, the latter of which is significantly beyond the qubit number that is accessible to prior optimal circuit synthesis methods. We demonstrate that our techniques are capable of reducing the required two-qubit gates by up to a factor of 2.5 compared to previous approaches while retaining low circuit depth. less

This paper introduces Witnessed Quantum Time Evolution (WQTE), a novel quantum algorithm for efficiently computing the eigen-energy spectra of arbitrary quantum systems without requiring eigenstate preparation-a key limitation of conventional approaches. By leveraging a single ancillary qubit to control real-time evolution operators and employing Fourier analysis, WQTE enables parallel resolution of multiple eigen-energies. Theoretical analysis demonstrates that the algorithm achieves Heisenberg-limited precision and operates with only a non-zero wavefunction overlap between the reference state and target eigenstates, significantly reducing initialization complexity. Numerical simulations validate the algorithm's effectiveness in molecular systems (e.g., H4 chains) and lattice models (e.g., Heisenberg spin systems), confirming that computational error scales inversely with maximum evolution time while maintaining robustness against sampling errors and quantum noise. Experimental implementation on an NMR quantum processor further verifies its feasibility in real-world noisy environments. Compared to existing quantum algorithms (e.g., VQE, QPE and their variants), WQTE exhibits superior circuit depth efficiency, resource economy, and noise resilience, making it a promising solution for eigen-energy computation on noisy intermediate-scale quantum (NISQ) devices. less

Extracting energy spectra from quantum Hamiltonians is a fundamental task for quantum simulation, yet remains challenging on noisy intermediate-scale quantum (NISQ) devices. We propose Measured Quantum Time Evolution (MQTE), an ancilla-free algorithm that estimates energy gaps by applying real-time evolution to a reference state and measuring time-resolved probabilities via repeated projective measurements. Spectral analysis of these signals reveals oscillation frequencies corresponding to eigenvalue differences. Crucially, MQTE exhibits inherent robustness to quantum hardware noise and sampling errors: these disturbances manifest as a white-noise background, which does not distort the underlying spectral structure but rather obscures the frequency information. By increasing the number of measurement samples, the intensity of the background white noise can be suppressed, thereby recovering the original spectral content. We validate the algorithm's performance via numerical simulations on one- and two-dimensional Heisenberg models, demonstrating accurate extraction of energy gaps and resilience against both sampling and circuit-level noise. Experimental implementation on the superconducting quantum processor Tianyan-176-II further confirms the practical feasibility and noise tolerance of MQTE under real hardware conditions. This work provides a robust and scalable framework for quantum spectral estimation in the NISQ era. less

The most widely used approach for simulating the dynamics of time-dependent Hamiltonians via quantum computation depends on the quantum-classical hybrid variational quantum time evolution algorithm, in which ordinary differential equations of the variational coefficients for determining time evolution are solved via classical simulations with a time discretization method. We here present a full-quantum approach, in which ordinary differential equations of the variational coefficients are transformed into static linear equations via the Chebyshev spectral discretization method and then solved via the quantum singular value transformation algorithm. Our full quantum algorithm avoids classical feedback, achieves exponential convergence for smooth Hamiltonians, and yields a quantum circuit depth that is independent of the number of time steps. We demonstrate two implementation strategies, with a global formulation designed for fault-tolerant architectures and a sequential formulation tailored to near-term devices, and validate the approach through numerical simulations of proton-hydrogen charge-transfer dynamics, a prototypical time-dependent quantum chemistry problem. This work establishes a systematic pathway from quantum-classical hybrid variational quantum algorithms to full-quantum solvers for general time-dependent Hamiltonians, particularly those whose dynamics admit compact variational descriptions, opening a route toward full quantum computational advantages in time-dependent simulations. less

For the version of the EPRL model based on the original vertex amplitude and the face amplitude selected by its gluing properties, we prove that the EPRL amplitude of any region with the topology of a 4-ball is supported on flat connections. We state immediate consequences of this result, comment on some applications, and discuss physical implications. The results hold in general; they do not rely on a semiclassical analysis. less

Early demonstrations of fault tolerant quantum systems have paved the way for logical-level compilation. For fault-tolerant applications to succeed, execution must finish with a low total program error rate (i.e., a low program failure rate). In this work, we study a promising candidate for future fault-tolerant architectures with low spatial overhead: the Gross code. Compilation for the Gross code entails compiling to Pauli Based Computation and then reducing the rotations and measurements to the Bicycle ISA. Depending on the configuration of modules and the placement of code modules on hardware, one can reduce the amount of resulting Bicycle instructions to produce a lower overall error rate. We find that NISQ-based, and existing FTQC mappers are insufficient for mapping logical qubits on Gross code architectures because 1. they do not account for the two-level nature of the logical qubit mapping problem, which separates into code modules with distinct measurements, and 2. they naively account only for length two interactions, whereas Pauli-Products are up to length $n$, where $n$ is the number of logical qubits in the circuit. For these reasons, we introduce a two-stage pipeline that first uses hypergraph partitioning to create in-module clusters, and then executes a priority-based algorithm to efficiently assign clusters onto hardware. We find that our mapping policy reduces the error contribution from inter-module measurements, the largest source of error in the Gross Code, by up to $\sim36\%$ in the best case, with an average reduction of $\sim13\%$. On average, we reduce the failure rates from inter-module measurements by $\sim22\%$ with localized factory availability, and by $\sim17\%$ on grid architectures, allowing hardware developers to be less constrained in developing scalable fault tolerant systems due to software driven reductions in program failure rates. less

As we are entering an early-FTQC era, circuit execution protocols with logical qubits and certain error-correcting codes are being discussed. Here, we propose a circuit execution protocol for the space-time efficient analog rotation (STAR) architecture. Gate operations within the STAR architecture is based on lattice surgery with surface codes, but it allows direct execution of continuous gates $Rz(θ)$ as non-Clifford gates instead of $T = Rz(π/4)$. $Rz(θ)$ operations involve creation of resource states $|m_θ\rangle = \frac{1}{\sqrt{2}} (|0 \rangle + e^{iθ} |1\rangle ) $ followed by ZZ joint measurements with target logical qubits. While employing $Rz(θ)$ enables more efficient circuit execution, both their creations and joint measurements are probabilistic processes and adopt repeat-until-success (RUS) protocols which are likely to result in considerable time overhead. Our circuit execution protocol aims to reduce such time overhead by parallel trials of resource state creations and more frequent trials of joint measurements. By employing quadratic unconstrained binary optimization (QUBO) in determining resource state allocations within the space, we successfully make our protocol efficient. Furthermore, we proposed performance estimators given the target circuit and qubit topology. It successfully predicts the time performance within less time than actual simulations do, and helps find the optimal qubit topology to run the target circuits efficiently. less

We derive general formulas for quasi-normal mode (QNM) frequencies of hairy black holes by exploiting the QNM--geodesic correspondence. The black hole hair is treated as an anisotropic fluid perturbatively added to the vacuum black holes (Schwarzschild and Kerr black holes). Under this setting, independent of energy conditions, our formulas offer a systematic method to compute quasi-normal mode frequencies for a broad class of hairy black holes. less

Quantum state preparation and block encoding are versatile and practical input models for quantum algorithms in scientific computing. The circuit complexity of state preparation and block encoding frequently dominates the end-to-end gate complexity of quantum algorithms. We give algorithms with lower C-NOT counts for both the state preparation and block encoding. For a general $n$-qubit state, we improve the C-NOT count from Plesch-Brukner algorithm, proposed in 2011, from $(23/24)2^n$ to $(11/12)2^n$. For block encoding, our single-ancilla protocol for $2^{n-1}\times 2^{n-1}$ matrices uses the spectral norm as subnormalization and achieves a C-NOT count leading term $(11/48)4^n$. This result even exceeds the lower bound of $(1/4)4^n$ for $n$-qubit unitary synthesis. Further optimization is performed for low-rank matrices, which frequently arise in practical applications. Specifically, we achieve the C-NOT count leading term $(K+(11/12))2^n$ for a rank-$K$ matrix. Our approach builds upon the recursive block-ZXZ decomposition from Krol et al. and introduces a diagonal matrix migration technique based on the commutativity of the diagonal matrix and the uniformly controlled rotation about the $z$-axis to minimize the use of C-NOT gates. less