Papers

Multipartite entanglement has a much more complex structure than bipartite entanglement. A state that lacks generic multipartite entanglement is 2-producible, i.e. it can be written as a tensor product of at most 2-partite entangled states. Recently, it has been proved that a tripartite pure state is 2-producible if and only if the gap between the entanglement of purification and its lower bound vanishes. Here, we show that the entanglement of purification gap is insufficient to detect more than tripartite entanglement in 4-partite stabilizer states. We then generalize entanglement of purification to the multipartite cases, and demonstrate that a multipartite pure state is 2-producible if and only if all the generalized entanglement of purification gaps vanish. The generalized entanglement of purification gap quantifies the quantum communication cost for redistributing one part of the system to the others, and also relates to the local recoverability of a multipartite state and the relative entropy between that state and 2-producible states. Moreover, we calculate the generalized entanglement of purification for states satisfying the general Schmidt decomposition, which implies that 4-partite stabilizer states do not necessarily have a general Schmidt decomposition. Our results provide a quantitative characterization of multipartite entanglement in multipartite system, which will promote further investigations and understanding of multipartite entanglement.

Quantum annealing provides a practical realization of adiabatic quantum computation and has emerged as a promising approach for solving large-scale combinatorial optimization problems. However, current devices remain constrained by sparse hardware connectivity, which requires embedding logical variables into chains of physical qubits. This embedding overhead limits scalability and reduces reliability as longer chains are more prone to noise-induced errors. In this work, building on the known structural result that the average chain length in clique embeddings grows linearly with the problem size, we develop a mathematical framework that connects embedding-induced overhead with hardware noise in D-Wave's Zephyr topology. Our analysis derives closed-form expressions for chain break probability and chain break fraction under a Gaussian control error model, establishing how noise scales with embedding size and how chain strength should be adjusted with chain length to maintain reliability. Experimental results from the Zephyr topology-based quantum processing unit confirm the accuracy of these predictions, demonstrating both the validity of the theoretical noise model and the practical relevance of the derived scaling rule. Beyond validating a theoretical model against hardware data, our findings establish a general embedding-aware noise framework that explains the trade-off between chain stability and logical coupler fidelity. Our framework advances the understanding of noise amplification in current devices and provides quantitative guidance for embedding-aware parameter tuning strategies.

The simplest, algebraic quantum-electrodynamical corrections, due to the double-negative energy subspace and instantaneous interactions, are computed to the no-pair energy of two-spin-1/2-fermion systems. Numerical results are reported for two-electron atoms with a clamped nucleus and positronium-like genuine two-particle systems. The Bethe-Salpeter equation provides the theoretical framework, and numerical methods have been developed for its equal-time time-slice. In practice, it requires solving a sixteen-component eigenvalue equation with a two-particle Dirac Hamiltonian, including the appropriate interaction. The double-pair corrections can either be included in the interaction part of the eigenvalue equation or treated as a perturbation to the no-pair Hamiltonian. The numerical results have an $\alpha$ fine-structure constant dependence that is in excellent agreement with the known $\alpha^3E_\mathrm{h}\$-order double-pair correction of non-relativistic quantum electrodynamics.

Fault-tolerance using constant space-overhead against long-range correlated errors is an important practical question. In the pioneering works [Terhal and Burkard, PRA 2005], [Aliferis et al, PRA 2005], [Aharonov et al, PRL 2006], fault-tolerance using poly-logarithmic overhead against long-range correlation modeled by pairwise joint Hamiltonian was proven when the total correlation of an error at a qubit location with errors at other locations was $O(1)$, i.e., the total correlation at a location did not scale with the number of qubits. This condition, under spatial symmetry, can simply be stated as the correlation between locations decaying faster than $\frac{1}{\text{dist}^{\text{dim}}}$. However, the pairwise Hamiltonian model remained intractable for constant overhead codes. Recently, [Bagewadi and Chatterjee, PRA 2025] introduced and analyzed the generalized hidden Markov random field (MRF) model, which provably captures all stationary distributions, including long-range correlations [Kunsch et al, Ann. App. Prob. 1995]. It resulted in a noise threshold in the case of long-range correlation, for memory corrected by the linear-distance Tanner codes [Leverrier and Zemor, FOCS 2022] for super-polynomial time. In this paper, we prove a similar result for square-root distance qLDPC codes and provide an explicit expression for the noise threshold in terms of the code rate, for up to $o(\sqrt{\text{\#qubits}})$ scaling of the total correlation of error at a location with errors at other locations.

We revisit the quantum reverse Shannon theorem, a central result in quantum information theory that characterizes the resources needed to simulate quantum channels when entanglement is freely available. We derive a universal additive upper bound on the smoothed max-information in terms of the sandwiched Rényi mutual information. This bound yields tighter single-shot results, eliminates the need for the post-selection technique, and leads to a conceptually simpler proof of the quantum reverse Shannon theorem. By consolidating and streamlining earlier approaches, our result provides a clearer and more direct understanding of the resource costs of simulating quantum channels.

Three-qubit gates are highly beneficial operations in quantum computing, enabling compact implementations of quantum algorithms and efficient generation of multipartite entangled states. However, realizing such gates with high fidelity remains challenging due to crosstalk, complex control requirements, and the overhead of parametric or tunable couplers. In this work, we propose and analyze the implementation of fast, high-fidelity three-qubit gates using giant atoms – artificial atoms coupled to a waveguide at multiple spatially separated points. By leveraging interference effects intrinsic to the giant-atom architecture, we demonstrate that native three-qubit gates, such as the controlled-CZ-SWAP (CCZS) and the dual-iSWAP (DIV), can be realized through simple frequency tuning, without the need for complex pulse shaping or additional hardware. We evaluate gate performance under realistic decoherence and show that fidelities exceeding 99.5% are achievable with current experimental parameters in superconducting circuits. As an application, we present a scalable protocol for preparing three- and five-qubit GHZ states using minimal gate depth, achieving high state fidelity within sub-300ns timescales. Our results position giant-atom systems as a promising platform for entangled-state preparation and low-depth quantum circuit design in near-term quantum computers and quantum simulators.

High-speed generation and efficient entanglement detection on a photonic chip are essential for quantum information applications but hard to achieve due to common photonic chips' material properties and limited component performance. In this work, we experimentally demonstrate entanglement witness on a silicon photonic chip, with multi-rail single-photon entanglement generation based on decoy-state techniques. The detection is based on balanced homodyne detectors on the same photonic chip with a bandwidth of up to 12.5 GHz, which allows room-temperature operation. A loss-equivalent analysis method compensates for optical losses and system noises. Experimental results quantify an entangled state fidelity of 92% in quantum state tomography and a Clauser-Horne-Shimony-Holt (CHSH) violation lower bound of 2.59. These results establish a viable path toward fully integrated, high-bandwidth, room-temperature quantum photonic systems, with potential applications in on-chip quantum optics and quantum random number generation.

We present the first construction of a computational Certified Deletion Property (CDP) achievable with classical communication, derived from the compilation of the non-local Magic Square Game (MSG). We leverage the KLVY compiler to transform the non-local MSG into a 2-round interactive protocol, rigorously demonstrating that this compilation preserves the game-specific CDP. Previously, the quantum value and rigidity of the compiled game were investigated. We emphasize that we are the first to investigate CDP (local randomness in [Fu and Miller, Phys. Rev. A 97, 032324 (2018)]) for the compiled game. Then, we combine this CDP with the framework [Kitagawa, Morimae, and Yamakawa, Eurocrypt 2025] to construct Secure Key Leasing with classical Lessor (cSKL). SKL enables the Lessor to lease the secret key to the Lessee and verify that a quantum Lessee has indeed deleted the key. In this paper, we realize cSKL for PKE, PRF, and digital signature. Compared to prior works for cSKL, we realize cSKL for PRF and digital signature for the first time. In addition, we succeed in weakening the assumption needed to construct cSKL.

We investigate superadditivity of quantum capacity through private channels whose Choi-Jamiolkowski operators are private states. This perspective links the security structure of private states to quantum capacity and clarifies the role of the shield system: information encoded in the shield system that would otherwise leak to the environment can be recycled when paired with an assisting channel, thereby boosting capacity. Our main contributions are threefold: Firstly, we develop a general framework that provides a sufficient condition for capacity amplification, which is formulated in terms of the assisting channel's Holevo information. As examples, we give explicit, dimension and parameter dependent amplification thresholds for erasure and depolarizing channels. Secondly, assuming the Spin alignment conjecture, we derive a single-letter expression for the quantum capacity of a family of private channels that are neither degradable, anti-degradable, nor PPT; as an application, we construct channels with vanishing quantum capacity yet unbounded private capacity. Thirdly, we further analyze approximate private channels: we give an alternative proof of superactivation that extends its validity to a broader parameter regime, and, by combining amplification bounds with continuity estimates, we establish a metric separation showing that channels exhibiting capacity amplification have nonzero diamond distance from the set of anti-degradable channels, indicating that existing approximate (anti-)degradability bounds are not tight. We also revisit the computability of the regularized quantum capacity and modestly suggest that this fundamental question still remains open.

Quantum error-correcting codes (QECCs) require high encoding rate in addition to high threshold unless a sufficiently large number of physical qubits are available. The many-hypercube (MHC) codes defined as the concatenation of the [[6,4,2]] quantum error-detecting code have been proposed as high-performance and high-encoding-rate QECCs. However, the concatenated codes have a disadvantage that the syndrome weight grows exponentially with respect to the concatenation level. To address this issue, here we propose subsystem quantum codes based on the MHC codes. In particular, we study the smallest subsystem MHC codes, namely, subsystem codes derived from the concatenated [[4,2,2]] error-detecting codes. The resulting codes have a constant syndrome-measurement weight of 4, while keeping high encoding rates. We build the block-MAP and neural-network decoders and show that they demonstrate superior performance to the bounded-distance decoder.

Quantum LDPC codes promise significant reductions in physical qubit overhead compared with topological codes. However, many existing constructions for performing logical operations come with distance-dependent temporal overheads. We introduce a scheme for performing generalized surgery on quantum LDPC codes using a constant number of rounds of syndrome measurement. The merged code in our scheme is constructed by taking the total complex of the base code and a suitably chosen homomorphic chain complex. We demonstrate the applicability of our scheme on an example multi-cycle code and assess the performance under a phenomenological noise model, showing that fast surgery performs comparably to standard generalized surgery with multiple rounds. Our results pave the way towards fault-tolerant quantum computing with LDPC codes with both low spatial and temporal overheads.

Isospectrally patterned lattices (IPL) have recently been shown to exhibit a rich band structure comprising both regimes of localized as well as extended states. The localized states show a single center localization behaviour with a characteristic localization length. We derive a continuum analogue of the IPL which allows us to determine analytically its eigenvalue spectrum and eigenstates thereby obtaining an expression for the localization length which involves the ratio of the coupling among the cells of the lattice and the phase gradient across the lattice. This continuum model breaks chiral symmetry but still shows a pairing of partner states with positive and negative energies except for the ground state. We perform a corresponding symmetry analysis which illuminates the continuum models structure as compared to a corresponding chirally symmetric Hamiltonian.

Recently, bicycle-sharing systems have been implemented in numerous cities, becoming integral to daily life. However, a prevalent issue arises when intensive commuting demand leads to bicycle shortages in specific areas and at particular times. To address this challenge, we employ a novel quantum machine learning model that analyzes time series data by fitting quantum time evolution to observed sequences. This model enables us to capture actual trends in bicycle counts at individual ports and identify correlations between different ports. Utilizing the trained model, we simulate the impact of proactively adding bicycles to high-demand ports on the overall rental number across the system. Given that the core of this method lies in a Monte Carlo simulation, it is anticipated to have a wide range of industrial applications.

As of now, an optimal quantum algorithm solving partial differential equations eludes us. There are several different methods, each with their own strengths and weaknesses. In past years comparisons of these existing methods have been made, but new work has emerged since then. Therefore, we conducted a survey on quantum methods developed post-2020, applying two such solvers to the heat equation in one spatial dimension. By analyzing their performance (including the cost of classical extraction), we explore their precision and runtime efficiency advancements between the two, identifying advantages and considerations.

Pseudorandom functions (PRFs) are one of the most fundamental primitives in classical cryptography. On the other hand, in quantum cryptography, it is possible that PRFs do not exist but their quantum analogues could exist, and still enabling many applications including SKE, MACs, commitments, multiparty computations, and more. Pseudorandom unitaries (PRUs) [Ji, Liu, Song, Crypto 2018], pseudorandom isometries (PRIs) [Ananth, Gulati, Kaleoglu, Lin, Eurocrypt 2024], and pseudorandom function-like state generators (PRFSGs) [Ananth, Qian, Yuen, Crypto 2022] are major quantum analogs of PRFs. PRUs imply PRIs, and PRIs imply PRFSGs, but the converse implications remain unknown. An important open question is whether these natural quantum analogues of PRFs are equivalent. In this paper, we partially resolve this question by ruling out black-box constructions of them: 1. There are no black-box constructions of $O(\log\lambda)$-ancilla PRUs from PRFSGs. 2. There are no black-box constructions of $O(\log\lambda)$-ancilla PRIs with $O(\log\lambda)$ stretch from PRFSGs. 3. There are no black-box constructions of $O(\log\lambda)$-ancilla PRIs with $O(\log\lambda)$ stretch from PRIs with $\Omega(\lambda)$ stretch. Here, $O(\log\lambda)$-ancilla means that the generation algorithm uses at most $O(\log\lambda)$ ancilla qubits. PRIs with $s(\lambda)$ stretch is PRIs mapping $\lambda$ qubits to $\lambda+s(\lambda)$ qubits. To rule out the above black-box constructions, we construct a unitary oracle that separates them. For the separations, we construct an adversary based on the quantum singular value transformation, which would be independent of interest and should be useful for other oracle separations in quantum cryptography.

Scalable quantum computation demands high-fidelity two-qubit gates. However, decoherence and control errors are inevitable, which can decrease the quality of implemented quantum operations. We propose a robust iSWAP gate protocol for semiconductor spin qubits, which is a promising platform for scalable quantum computing. Our scheme uses only local microwave drives on conventional exchange-coupled spin qubits. This approach simultaneously addresses two critical challenges on semiconductor quantum computing: it suppresses low-frequency noise via continuous dynamical decoupling, and it circumvents the control difficulties associated with the ac modulation of the exchange interaction. We further develop a composite pulse sequence to remove drive-strength constraints and a dynamically corrected method to provide first-order immunity to microwave amplitude errors.Numerical simulations confirm that our scheme can achieve fidelity above the fault-tolerance threshold under current experimental conditions, offering a building block for practical quantum processors.

Approximate quantum error correction (AQEC) provides a versatile framework for both quantum information processing and probing many-body entanglement. We reveal a fundamental tension between the error-correcting power of an AQEC and the hardness of code state preparation. More precisely, through a novel application of the Lovász local lemma, we establish a fundamental trade-off between local indistinguishability and circuit complexity, showing that orthogonal short-range entangled states must be distinguishable via a local operator. These results offer a powerful tool for exploring quantum circuit complexity across diverse settings. As applications, we derive stronger constraints on the complexity of AQEC codes with transversal logical gates and establish strong complexity lower bounds for W state preparation. Our framework also provides a novel perspective for systems with Lieb-Schultz-Mattis type constraints.

In this paper, we propose the average determinant of reduced density matrices for each qubit as a global entanglement measure. By means of the properties of reduced density matrices, we can investigate the present measure. We propose a decomposition law for the present measure, demonstrate that the present measure just measures the average mixedness for each qubit and the average 1-tangle, and indicate that for n-qubit W state and Dicke states, the average mixedness for each qubit and 1-tangle almost vanish for the large number of qubits. We also point out that for two qubits, the present measure is just the square of the concurrence while for three qubits, the present measure is the sum of the 3-tangle and the twice the average 2-tangle.

One-way puzzles (OWPuzzs) introduced by Khurana and Tomer [STOC 2024] are a natural quantum analogue of one-way functions (OWFs), and one of the most fundamental primitives in ”Microcrypt” where OWFs do not exist but quantum cryptography is possible. OWPuzzs are implied by almost all quantum cryptographic primitives, and imply several important applications such as non-interactive commitments and multi-party computations. A significant goal in the field of quantum cryptography is to base OWPuzzs on plausible assumptions that will not imply OWFs. In this paper, we base OWPuzzs on hardness of non-collapsing measurements. To that end, we introduce a new complexity class, $\mathbf{SampPDQP}$, which is a sampling version of the decision class $\mathbf{PDQP}$ introduced in [Aaronson, Bouland, Fitzsimons, and Lee, ITCS 2016]. We show that if $\mathbf{SampPDQP}$ is hard on average for quantum polynomial time, then OWPuzzs exist. $\mathbf{SampPDQP}$ is the class of sampling problems that can be solved by a classical polynomial-time algorithm that can make a single query to a non-collapsing measurement oracle, which is a ”magical” oracle that can sample measurement results on quantum states without collapsing the states. Such non-collapsing measurements are highly unphysical operations that should be hard to realize in quantum polynomial-time. We also study upperbounds of the hardness of $\mathbf{SampPDQP}$. We introduce a new primitive, distributional collision-resistant puzzles (dCRPuzzs), which are a natural quantum analogue of distributional collision-resistant hashing [Dubrov and Ishai, STOC 2006]. We show that dCRPuzzs imply average-case hardness of $\mathbf{SampPDQP}$ (and therefore OWPuzzs as well). We also show that two-message honest-statistically-hiding commitments with classical communication and one-shot signatures [Amos, Georgiou, Kiayias, Zhandry, STOC 2020] imply dCRPuzzs.

Few-body physics explores quantum systems of a small number of particles, bridging the gap between single-particle and many-body regimes. To provide an accessible tool for such studies, we present FewBodyToolkit.jl, a Julia package for quantum few-body simulations. The package supports general two- and three-body systems in various spatial dimensions with arbitrary pair-interactions, and allows to calculate bound and resonant states. The implementation is based on the well-established Gaussian expansion method and we illustrate the package's capabilities through benchmarks and research examples. The package comes with documentation and examples, making it useful for research, teaching, benchmarking, and method development.

The discrete-time quantum walk on the Johnson graph $J(n,k)$ is a useful tool for performing target vertex searches with high success probability. This graph is defined by $n$ distinct elements, with vertices being all the \(\binom{n}{k}\) $k$-element subsets and two vertices are connected by an edge if they differ exactly by one element. However, most works in the literature focus solely on the search for a single target vertex on the Johnson graph. In this article, we utilize lackadaisical quantum walk–a form of discrete-time coined quantum walk with a wighted self-loop at each vertex of the graph–along with our recently proposed modified coin operator, $\mathcal{C}_g$, to find multiple target vertices on the Johnson graph $J(n,k)$ for various values of $k$. Additionally, a comparison based on the numerical analysis of the performance of the $\mathcal{C}_g$ coin operator in searching for multiple target vertices on the Johnson graph, against various other frequently used coin operators by the discrete-time quantum walk search algorithms, shows that only $\mathcal{C}_g$ coin can search for multiple target vertices with a very high success probability in all the scenarios discussed in this article, outperforming other widely used coin operators in the literature.

Quantum walk has emerged as an essential tool for searching marked vertices on various graphs. Recent advances in the discrete-time quantum walk search algorithm have enabled it to effectively handle multiple marked vertices, expanding its range of applications further. In this article, we propose a novel application of this advanced quantum walk search algorithm for the edge detection of images\textemdash a critical task in digital image processing. Given the probabilistic nature of quantum computing, obtaining measurement result with a high success probability is essential alongside faster computation time. Our quantum walk search algorithm demonstrates a high success probability in detecting the image edges compared to the existing quantum edge detection methods and outperforms classical edge detection methods with a quadratically faster speed. A small Qiskit circuit implementation of our method using a one-dimensional quantum walk search has been executed in Qiskit's $qasm\_simulator$ and $ibm\_sydney(fake)$ device.

Parallelization is a major challenge in quantum algorithms due to physical constraints like no-cloning. This is vividly illustrated by the conjecture of Moore and Nilsson from their seminal work on quantum circuit complexity [MN01, announced 1998]: unitaries of a deceptively simple form–controlled-unitary "staircases"–require circuits of minimum depth $\Omega(n)$. If true, this lower bound would represent a major break from classical parallelism and prove a quantum-native analogue of the famous NC $\neq$ P conjecture. In this work we settle the Moore-Nilsson conjecture in the negative by compressing all circuits in the class to depth $O(\log n)$, which is the best possible. The parallelizations are exact, ancilla-free, and can be computed in poly($n$) time. We also consider circuits restricted to 2D connectivity, for which we derive compressions of optimal depth $O(\sqrt{n})$. More generally, we make progress on the project of quantum parallelization by introducing a quantum blockwise precomputation technique somewhat analogous to the method of Arlazarov, Dinič, Kronrod, and Faradžev [Arl+70] in classical dynamic programming, often called the "Four-Russians method." We apply this technique to more-general "cascade" circuits as well, obtaining for example polynomial depth reductions for staircases of controlled $\log(n)$-qubit unitaries.

Quantum error correction (QEC) is essential for scalable quantum computing, yet decoding errors via conventional algorithms result in limited accuracy (i.e., suppression of logical errors) and high overheads, both of which can be alleviated by inference-based decoders. To date, such machine-learning (ML) decoders lack two key properties crucial for practical fault tolerance: reliable uncertainty quantification and robust generalization to previously unseen QEC codes. To address this gap, we propose a Quantum Bayesian graph Attention decoder (QuBA) that enables expressive error-pattern recognition alongside calibrated uncertainty estimates. Building on QuBA, we further develop a multi-phase training framework with enhanced cross-domain robustness enabling decoding beyond the training set called Sequential Aggregate Generalization under Uncertainty (SAGU). Experiments on bivariate bicycle (BB) codes and their coprime variants demonstrate that (i)QuBA consistently outperforms the classical baseline belief propagation (BP), achieving up to a two orders of magnitude reduction in logical error rate (LER) under confident-decision bounds on the coprime BB code $[[154,6,16]]$; (ii) SAGU achieves decoding performance comparable to or even outperforming QuBA's domain-specific training approach.

The ability to precisely control and predict the evolution of quantum states is a fundamental requirement for advancing quantum technologies. Here, we develop tunable atomic routing protocols based on an integrable model of dipolar bosons confined in a four-well potential with a star-shaped configuration. By adjusting the system parameters, we identify a harmonic dynamical regime of the atomic population that can be treated analytically, providing a complete description of the system's behaviour for precise manipulation. We demonstrate three independent modes of control over the atomic population dynamics under the action of an external field: frequency tuning via variation in the field intensity, directional switching via spatial displacement of the field, and amplitude modulation by varying its duration. These modes operate under two distinct configurations: one source and two drains, and, in reverse order, two sources and one drain. These cases emulate an atomic 1:2 demultiplexer and 2:1 multiplexer, respectively. Our results may contribute to the development of control mechanisms in the design of quantum devices.

Using the gauge-gravity duality, we study the electromagnetic instability of vacuum with instantons in holographic plasma. The model we employ is the D(-1)-D3 brane system in which the D(-1)-branes correspond to the instantons in holography. To take into account the flavored quarks, the coincident probe D7-branes as flavors are embedded into the bulk geometry so that the effective electromagnetic Lagrangian with flavors corresponds to the action of the D7-branes according to gauge-gravity duality. We numerically evaluate the vacuum decay rate, the critical electric field and the V-A curve of the vacuum by using the D7-brane action with various values of the electromagnetic field. It implies the particles in the plasma acquire an effective mass in the presence of instantons as it is expected in the quantum field theory, and the plasma trends to become insulating when the electric field is small. This work reveals the relation between electromagnetic and instantonic properties of the vacuum in the plasma.

We demonstrate the realization of a Discrete Time-Crystal (DTC) phase in a family of periodically driven, one-dimensional quadratic lattice Hamiltonians that can be obtained using spin chains. These interactions preserve integrability while opening controllable gaps at resonant quasienergies and pinning the emergent quasienergy modes that are responsible for subharmonics. We demonstrate that the DTC phase is rigid in the parameter space of transverse field and an additional interaction like Next-Nearest-Neighbor (NNN) coupling strength, with the drive frequency optimized to produce the strongest subharmonic response. We also provide a detailed phase diagram of the model, exhibiting a Floquet Paramagnet (FPM) phase, as well as sharp quantum phase transitions between the FPM and the DTC. Finite-size scaling of the Floquet quasienergy splitting between the emergent subharmonic mode and its conjugate shows that the DTC lifetime diverges exponentially with system size. Thus, our work establishes a novel mechanism for achieving robust long-lived DTCs in one dimension. Motivation for this work stems from the limitations of disorder-based stabilization schemes that rely on many-body localization and exhibit only prethermal or finite-lived plateaus, eventually restoring ergodicity. Disorder-free routes are therefore highly desirable. Integrable (or Floquet-integrable) systems provide an attractive alternative because their extensive set of conserved quantities and constrained scattering strongly restrict thermalization channels. Our construction exploits these integrable restrictions together with longer-range NNN engineering to produce a clean, robust DTC that avoids the prethermal fragility of disordered realizations.

Silicon nitride microresonators driven by strong pump pulses can generate squeezed light in a dominant spectral-temporal mode, a central resource for continuous-variable quantum computation. In the high parametric gain regime, several effects, including self- and cross-phase modulation as well as time-ordering corrections, become significant and can degrade source performance. In this work, we comprehensively investigate the generation of squeezed light from a silicon nitride resonator under pulsed pumping, spanning from low to high parametric gain up to 16 photons/pulse. We experimentally study how the average photon number and the first- and second- order correlations of the squeezed marginal modes evolve with increasing pulse energy, across various frequency detunings and pulse durations. Furthermore, we analyze the errors introduced by multi-pair emissions in estimating the joint temporal intensity via time-resolved coincidence measurements. We propose and demonstrate an error-correction strategy based on the marginal distributions of time-resolved multi-photon events. Our results provide a practical strategy for optimizing the gain and the temporal mode structure of pulsed squeezed light sources in microresonators, elucidating the physical mechanisms and limitations that govern source performance in the high gain regime.

Accurate state preparation is a critical bottleneck in many quantum algorithms, particularly those for ground-state energy estimation. Even in fault-tolerant quantum computing, preparing a quantum state with sufficient overlap with the desired eigenstate remains a major challenge. To address this, we develop a unified cost-aware framework for filtered-state preparation that enhances the overlap of a given input state through spectral filtering. The framework covers polynomial and trigonometric realizations of filters and makes explicit the trade-off among overlap amplification, preparation success probability, and filter-implementation cost. As representative examples, we analyze Gaussian filters and introduce a modified Krylov-subspace-based filter that improves the success-probability/overlap trade-off relevant to filtered state preparation. Within this framework, we study a filtered variant of quantum phase estimation (FQPE) that mitigates the unfavorable dependence on the initial overlap present in standard QPE. Numerical experiments on Fermi-Hubbard models show that FQPE reduces the total runtime by more than two orders of magnitude in the high-precision regime, with overlap amplification exceeding a factor of one hundred.

A special class of states of 2-qubits which are simultaneously separable and have positive semidefinite Wigner functions is described.