Block encodings are a basic interface between quantum algorithms and linear algebra. Standard LCU constructions achieve optimal circuit depth but typically require logarithmically many ancilla qubits. We ask how much quantum workspace can be reduced without sacrificing circuit depth, and study this tradeoff from both algorithmic and lower-bound perspectives.
For a Hermitian decomposition A=∑j=1LαjHj, with ∥Hj∥=1 and α=∑j∣αj∣, we give two coherent ε-approximate block-encoding constructions. The first uses one ancilla qubit and has depth O(L(α/ε)o(1)), while the second uses O(loglog(α/ε)) ancillas and achieves depth O(L).
For a broad Suzuki-based coherent simulation architecture, we prove an ancilla-depth tradeoff. In the polynomial-resource regime and for a constant number of coherent rounds, log(1/ε)≤O((logQ)2+2alogQ), where Q is depth normalized by the number of Hamiltonian terms and a is the ancilla count. Thus polylogarithmic dependence on 1/ε requires more than constantly many ancillas within this architecture. In a separate repeated-query LCU model, for balanced coefficients 1/L and error ε=η/L with fixed 0<η<1, we prove 2a=Ωη(L2/(T+L)), where T is the number of oracle queries. Hence a=Ω(logL) when T=O(Lα) for some α<2. Moreover, in the exact case, a≥logL regardless of T. We also extend this tradeoff to arbitrary nonnegative coefficients.
Finally, we apply our low-ancilla constructions to normalized trace estimation in DQC1, obtaining an optimal algorithm linear in the approximate degree together with a matching query lower bound. Together, these results establish quantitative space-depth and space-query tradeoffs in two natural circuit models.
Abstract Satellite-to-ground continuous variable quantum key distribution (CV-QKD) is constrained by rapidly varying free-space channels and short transmission windows, which limit the amount of data available for parameter estimation within each channel interval. Under finite-sample conditions, parameter point estimates are subject to statistical uncertainty and may even yield an overly favorable description of the true channel state, while errors in the estimated transmission coefficient directly affect the covariance matrix used in the security analysis. In this work, we investigate the finite-sample effects of transmission coefficient estimation in dynamic free-space CV-QKD. A neural network is introduced to estimate the transmission coefficient, and the Delta method is used to quantify the uncertainty in its predictions. The proposed method is compared with the standard maximum likelihood estimation method. Confidence intervals for the transmission coefficient are constructed for different sample sizes, and the effects of the statistical uncertainties on the secret key rate are analysed. Under the considered Gaussian-channel simulation conditions, the neural network can provide a more favorable nominal lower bound on the transmission coefficient than MLE in certain sample-limited regimes, leading to a higher parameter-estimation-limited key-rate metric. This work establishes a statistical framework that connects neural network-based transmission coefficient estimation and predictive uncertainty quantification with covariance matrix construction and secret key rate analysis. It provides a basis for machine learning-assisted parameter estimation in free-space CV-QKD systems operating with finite samples.
In this paper, we recall Richardson's solution of the reduced BCS model, its relationship with the Gaudin model, and the known implementation of these models in conformal field theory. The CFT techniques applied here are based on the use of the free field realization, or more precisely, on the calculation of saddle-point values of Coulomb gas integrals representing certain (perturbed) WZW conformal blocks. We identify the saddle-point limit as the classical limit of conformal blocks. We show that this observation implies a new method for calculating classical conformal blocks and can be further used in the study of quantum integrable models.