Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.40141

Distributed Inner-Product Estimation for Continuous-Variable Quantum States

Jun Tang, Congcong Zheng, Xutao Yu, Zaichen Zhang

quant-phSubmitted Oct 29, 2026• Announced Oct 30, 2026• 0 citations
arXivHTMLPDF

Abstract

Distributed inner product estimation (DIPE) is a fundamental task in quantum information, aiming to estimate the inner product between two unknown quantum states prepared on distributed quantum platforms. For multimode continuous-variable (CV) systems, the infinite-dimensional Hilbert space poses an additional challenge. In this work, we develop a CV-DIPE protocol using only local homodyne measurements at shared phase settings and classical communication. Under a known bound on the mean energy per mode, we derive explicit finite-sample guarantees and sufficient copy counts for estimating the full inner product to prescribed accuracy and confidence. The energy constraint yields an inverse-square truncation-bias bound, while Gaussian structure strengthens the tail control to exponential decay and improves the resulting accuracy scaling. Numerical simulations with Gaussian and non-Gaussian states illustrate the balance between truncation bias and statistical error and its dependence on mode number and energy. Our results enable independent CV platforms to benchmark their state preparations against one another, even when neither state admits a tractable classical description.

AI Summary

The paper studies estimation of $\operatorname{Tr}(\rho\sigma)$ for unknown multimode continuous-variable states prepared on separate platforms, using local homodyne measurements and classical communication rather than joint measurements or state reconstruction. It assumes a common calibrated phase reference and a known bound $E$ on each state’s mean photon number per mode. The protocol samples shared random homodyne phases, takes $n$ shots per state at each setting, and combines all cross-platform outcome pairs through an explicit product kernel. The kernel analytically averages radial Fourier variables over a product of phase-space disks of radius $R$. The resulting estimator is unbiased for the truncated overlap. For $M$ modes, defining $c_R=(R^2/2)^M$, its variance is bounded by $[c_R^2/n^2+c_R(1-n^{-2})]/N_\theta$. An energy-controlled weighted second moment of the characteristic functions gives truncation bias at most $(4ME+2M)/R^2$. For Gaussian states, covariance bounds and Gaussian tail estimates improve this to $M\exp[-R^2/(2(4ME+2M))]$. Combining these certificates with Hoeffding concentration gives sufficient total-copy scaling, at fixed $M,E,n$, of $O(\epsilon^{-2M-2}\log(2/\delta))$ generally and $O(\epsilon^{-2}[\log(2M/\epsilon)]^{2M}\log(2/\delta))$ for Gaussian states. Bernstein bounds additionally expose the shots-versus-settings tradeoff. Simulations of coherent, squeezed, Fock, and cat-state benchmarks illustrate truncation bias versus statistical variance. The stated limitations include conservative uniform bounds, substantial mode-number dependence, and empirically optimized cutoffs that do not provide reliable data-driven selection for unknown states. Experimental noise and drift remain untreated.

Some signs of AI-generated textIncrementalUnclear noveltyMissing comparison

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
21 pages, 4 figures

Related papers

Cross-Platform Verification of Continuous-Variable Quantum Systems

Kun Wang

Cross-platform verification compares output states of independently operated bosonic and quantum optical systems when classical predictions and joint measurements are unavailable. Continuous-variable distributed inner product estimation (CV-DIPE) provides a local measurement approach, but infinite-dimensional state spaces require rigorous control of truncation error. We develop three CV-DIPE protocols for the natural class of energy-constrained continuous-variable quantum states. One uses coordinated displaced parity, another coordinated Haar measurements, and the third independent homodyne shadows. For arbitrary multimode inputs in this class, including entangled and non-Gaussian states, we establish truncation error bounds and worst-case sample complexity guarantees for the exact inner product. The leading terms of these bounds favor coordinated Haar measurements, whose global implementation is experimentally challenging. These protocols provide certified strategies for cross-platform verification of continuous-variable systems using only local measurement data.

quant-pharXiv:2610.39912•Oct 30, 2026•0 citations

Distributed quantum inner product estimation with structured random circuits

Congcong Zheng, Kun Wang, Xutao Yu +2 more

Distributed inner product estimation (DIPE) is a fundamental task in quantum information, aiming to estimate the inner product between two unknown quantum states prepared on distributed quantum platforms. Existing rigorous sample complexity analyses are limited to unitary 4-designs, which pose significant practical challenges for near-term quantum devices. This work addresses this challenge by exploring DIPE with structured random circuits. We first establish that DIPE with an arbitrary unitary 2-design ensemble achieves an average sample complexity of \({\mathcal{O}}(\sqrt{{2}^{n}})\) , where n is the number of qubits. We then analyze ensembles below unitary 2-designs—specifically, the brickwork and local unitary 2-design ensembles—demonstrating average sample complexities of \({\mathcal{O}}(\sqrt{2.1{8}^{n}})\) and \({\mathcal{O}}(\sqrt{2.{5}^{n}})\) , respectively. Furthermore, we analyze the state-dependent sample complexity. For brickwork ensembles, we develop a tensor network approach to compute the asymptotic state-dependent sample complexity, showing that it converges to \({\mathcal{O}}(\sqrt{2.1{8}^{n}})\) as the circuit depth increases. Remarkably, we find that DIPE with the global Clifford ensemble requires \(\Theta (\sqrt{{2}^{n}})\) copies, matching the performance of unitary 4-designs. For both local and global Clifford ensembles, we find that the efficiency can be further enhanced by the nonstabilizerness of states. Additionally, for approximate unitary 4-designs, the performance exponentially approaches that of exact unitary 4-designs as the circuit depth increases. Our results provide theoretically guaranteed methods for implementing DIPE with experimentally feasible unitary ensembles.

arXiv:2506.19574•npj Quantum Information•Apr 21, 2026•0 citations

Practical Homodyne Shadow Estimation

Ruyu Yang, Xiaoming Sun, Hongyi Zhou

Shadow estimation provides an efficient framework for estimating observable expectation values using randomized measurements. While originally developed for discrete-variable systems, its recent extensions to continuous-variable (CV) quantum systems face practical limitations due to idealized assumptions of continuous phase modulation and infinite measurement resolution. In this work, we develop a practical shadow estimation protocol for CV systems using discretized homodyne detection with a finite number of phase settings and quadrature bins. We construct an unbiased estimator for the quantum state and establish both sufficient conditions and necessary conditions for informational completeness within a truncated Fock space up to $n_{\mathrm{max}}$ photons. We further provide a comprehensive variance analysis, showing that the shadow norm scales as $\mathcal{O}(n_{\mathrm{max}}^4)$, improving upon previous $\mathcal{O}(n_{\mathrm{max}}^{13/3})$ bounds. Our work bridges the gap between theoretical shadow estimation and experimental implementations, enabling robust and scalable quantum state characterization in realistic CV systems.

quant-pharXiv:2512.13146•Dec 16, 2025•0 citations

Distributed Quantum inner product estimation

Anurag Anshu, Zeph A. Landau, Yunchao Liu

As small quantum computers are becoming available on different physical platforms, a benchmarking task known as cross-platform verification has been proposed that aims to estimate the fidelity of states prepared on two quantum computers. This task is fundamentally distributed, as no quantum communication can be performed between the two physical platforms due to hardware constraints, which prohibits a joint SWAP test. In this paper we settle the sample complexity of this task across all measurement and communication settings. The essence of the task, which we call distributed quantum inner product estimation, involves two players Alice and Bob who have k copies of unknown states ρ,σ (acting on ℂd) respectively. Their goal is to estimate Tr(ρσ) up to additive error ε∈(0,1), using local quantum operations and classical communication. In the weakest setting where only non-adaptive single-copy measurements and simultaneous message passing are allowed, we show that k=O(max{1/ε2,√d/ε}) copies suffice. This achieves a savings compared to full tomography which takes Ω(d3) copies with single-copy measurements. Surprisingly, we also show that the sample complexity must be at least Ω(max{1/ε2,√d/ε}), even in the strongest setting where adaptive multi-copy measurements and arbitrary rounds of communication are allowed. This shows that the success achieved by shadow tomography, for sample-efficiently learning the properties of a single system, cannot be generalized to the distributed setting. Furthermore, the fact that the sample complexity remains the same with single and multi-copy measurements contrasts with single system quantum property testing, which often demonstrate exponential separations in sample complexity with single and multi-copy measurements.

arXiv:2111.03273•ACM Symposium on Theory of Computing (STOC)•Jun 9, 2022•27 citations

Continuous-variable state moments from randomized homodyne and heterodyne measurements

Michael Tsesmelis, Moritz Straeter, Leong-Chuan Kwek

Continuous-variable (CV) quantum states are naturally characterized by their moments, defined as expectation values of products of single- or multimode ladder operators. Many CV Hamiltonians and quantum algorithms are formulated directly in terms of these moments, and therefore an efficient procedure to estimate moments with limited state measurements is necessary. In this paper, we present a protocol for shadow tomography of moment-generating functions (MGFs) of CV states based on randomized homodyne and heterodyne measurements. The resulting shadows enable an efficient and concurrent estimation of many multimode moments. Our complexity analysis shows that the number of measurements required to estimate a certain moment to a given precision grows exponentially in the order of the moments. Finally, we assess the precision of these moment estimators by applying them to two tasks: detecting entanglement in both Gaussian and non-Gaussian states via the Shchukin-Vogel protocol, and characterizing optical loss in a photonic chip. We demonstrate that both tasks can be accomplished with only a few thousand randomized measurements. The small number of required measurements, combined with efficient sample processing, makes our protocol applicable to a wide range of CV simulation tasks.

quant-pharXiv:2608.11811•Aug 13, 2026•0 citations

Classical Shadow Tomography for Continuous Variables Quantum Systems

Simon Becker, Nilanjana Datta, Ludovico Lami +1 more

In this article we develop a continuous variable (CV) shadow tomography scheme with wide ranging applications in quantum optics. Our work is motivated by the increasing experimental and technological relevance of CV systems in quantum information, quantum communication, quantum sensing, quantum simulations, quantum computing and error correction. We introduce two experimentally realisable schemes for obtaining classical shadows of CV (possibly non-Gaussian) quantum states using only randomised Gaussian unitaries and easily implementable Gaussian measurements such as homodyne and heterodyne detection. For both schemes, we show thatN=O(poly (1 /ϵ, log (1/δ),Mr+αn, log(m) )) samples of an unknownm-mode state ρ suffice to learn the expected value of anyr-local polynomial in the canonical observables of degree α, both with high probability 1 - δ and accuracy ϵ, as long as the state ρ has moments of ordern> α bounded byMn. By simultaneously truncating states and operators in energy and phase space, we are able to overcome new mathematical challenges that arise due to the infinite-dimensionality of CV systems. We also provide a scheme to learn nonlinear functionals of the state, such as entropies over any small number of modes, by leveraging recent energy-constrained entropic continuity bounds. Finally, we provide numerical evidence of the efficiency of our protocols in the case of CV states of relevance in quantum information theory, including ground states of quadratic Hamiltonians of many-body systems and cat qubit states. We expect our scheme to provide good recovery in learning relevant states of 2D materials and photonic crystals.

arXiv:2211.07578•IEEE Transactions on Information Theory•Jan 26, 2024•32 citations
Distributed inner product estimation (DIPE) is a fundamental task in quantum information, aiming to estimate the inner product between two unknown quantum states prepared on distributed quantum platforms. For multimode continuous-variable (CV) systems, the infinite-dimensional Hilbert space poses an additional challenge. In this work, we develop a CV-DIPE protocol using only local homodyne measurements at shared phase settings and classical communication. Under a known bound on the mean energy per mode, we derive explicit finite-sample guarantees and sufficient copy counts for estimating the full inner product to prescribed accuracy and confidence. The energy constraint yields an inverse-square truncation-bias bound, while Gaussian structure strengthens the tail control to exponential decay and improves the resulting accuracy scaling. Numerical simulations with Gaussian and non-Gaussian states illustrate the balance between truncation bias and statistical error and its dependence on mode number and energy. Our results enable independent CV platforms to benchmark their state preparations against one another, even when neither state admits a tractable classical description.
The paper studies estimation of Tr⁡(ρσ)\operatorname{Tr}(\rho\sigma)Tr(ρσ) for unknown multimode continuous-variable states prepared on separate platforms, using local homodyne measurements and classical communication rather than joint measurements or state reconstruction. It assumes a common calibrated phase reference and a known bound EEE on each state’s mean photon number per mode.
The protocol samples shared random homodyne phases, takes nnn shots per state at each setting, and combines all cross-platform outcome pairs through an explicit product kernel. The kernel analytically averages radial Fourier variables over a product of phase-space disks of radius RRR. The resulting estimator is unbiased for the truncated overlap. For MMM modes, defining cR=(R2/2)Mc_R=(R^2/2)^McR​=(R2/2)M, its variance is bounded by [cR2/n2+cR(1−n−2)]/Nθ[c_R^2/n^2+c_R(1-n^{-2})]/N_\theta[cR2​/n2+cR​(1−n−2)]/Nθ​.
An energy-controlled weighted second moment of the characteristic functions gives truncation bias at most (4ME+2M)/R2(4ME+2M)/R^2(4ME+2M)/R2. For Gaussian states, covariance bounds and Gaussian tail estimates improve this to Mexp⁡[−R2/(2(4ME+2M))]M\exp[-R^2/(2(4ME+2M))]Mexp[−R2/(2(4ME+2M))]. Combining these certificates with Hoeffding concentration gives sufficient total-copy scaling, at fixed M,E,nM,E,nM,E,n, of O(ϵ−2M−2log⁡(2/δ))O(\epsilon^{-2M-2}\log(2/\delta))O(ϵ−2M−2log(2/δ)) generally and O(ϵ−2[log⁡(2M/ϵ)]2Mlog⁡(2/δ))O(\epsilon^{-2}[\log(2M/\epsilon)]^{2M}\log(2/\delta))O(ϵ−2[log(2M/ϵ)]2Mlog(2/δ)) for Gaussian states. Bernstein bounds additionally expose the shots-versus-settings tradeoff.
Simulations of coherent, squeezed, Fock, and cat-state benchmarks illustrate truncation bias versus statistical variance. The stated limitations include conservative uniform bounds, substantial mode-number dependence, and empirically optimized cutoffs that do not provide reliable data-driven selection for unknown states. Experimental noise and drift remain untreated.
Cross-platform verification compares output states of independently operated bosonic and quantum optical systems when classical predictions and joint measurements are unavailable. Continuous-variable distributed inner product estimation (CV-DIPE) provides a local measurement approach, but infinite-dimensional state spaces require rigorous control of truncation error. We develop three CV-DIPE protocols for the natural class of energy-constrained continuous-variable quantum states. One uses coordinated displaced parity, another coordinated Haar measurements, and the third independent homodyne shadows. For arbitrary multimode inputs in this class, including entangled and non-Gaussian states, we establish truncation error bounds and worst-case sample complexity guarantees for the exact inner product. The leading terms of these bounds favor coordinated Haar measurements, whose global implementation is experimentally challenging. These protocols provide certified strategies for cross-platform verification of continuous-variable systems using only local measurement data.
Distributed inner product estimation (DIPE) is a fundamental task in quantum information, aiming to estimate the inner product between two unknown quantum states prepared on distributed quantum platforms. Existing rigorous sample complexity analyses are limited to unitary 4-designs, which pose significant practical challenges for near-term quantum devices. This work addresses this challenge by exploring DIPE with structured random circuits. We first establish that DIPE with an arbitrary unitary 2-design ensemble achieves an average sample complexity of O(2n){\mathcal{O}}(\sqrt{{2}^{n}})O(2n​) , where n is the number of qubits. We then analyze ensembles below unitary 2-designs—specifically, the brickwork and local unitary 2-design ensembles—demonstrating average sample complexities of O(2.18n){\mathcal{O}}(\sqrt{2.1{8}^{n}})O(2.18n​) and O(2.5n){\mathcal{O}}(\sqrt{2.{5}^{n}})O(2.5n​) , respectively. Furthermore, we analyze the state-dependent sample complexity. For brickwork ensembles, we develop a tensor network approach to compute the asymptotic state-dependent sample complexity, showing that it converges to O(2.18n){\mathcal{O}}(\sqrt{2.1{8}^{n}})O(2.18n​) as the circuit depth increases. Remarkably, we find that DIPE with the global Clifford ensemble requires Θ(2n)\Theta (\sqrt{{2}^{n}})Θ(2n​) copies, matching the performance of unitary 4-designs. For both local and global Clifford ensembles, we find that the efficiency can be further enhanced by the nonstabilizerness of states. Additionally, for approximate unitary 4-designs, the performance exponentially approaches that of exact unitary 4-designs as the circuit depth increases. Our results provide theoretically guaranteed methods for implementing DIPE with experimentally feasible unitary ensembles.
Shadow estimation provides an efficient framework for estimating observable expectation values using randomized measurements. While originally developed for discrete-variable systems, its recent extensions to continuous-variable (CV) quantum systems face practical limitations due to idealized assumptions of continuous phase modulation and infinite measurement resolution. In this work, we develop a practical shadow estimation protocol for CV systems using discretized homodyne detection with a finite number of phase settings and quadrature bins. We construct an unbiased estimator for the quantum state and establish both sufficient conditions and necessary conditions for informational completeness within a truncated Fock space up to nmaxn_{\mathrm{max}}nmax​ photons. We further provide a comprehensive variance analysis, showing that the shadow norm scales as O(nmax4)\mathcal{O}(n_{\mathrm{max}}^4)O(nmax4​), improving upon previous O(nmax13/3)\mathcal{O}(n_{\mathrm{max}}^{13/3})O(nmax13/3​) bounds. Our work bridges the gap between theoretical shadow estimation and experimental implementations, enabling robust and scalable quantum state characterization in realistic CV systems.
As small quantum computers are becoming available on different physical platforms, a benchmarking task known as cross-platform verification has been proposed that aims to estimate the fidelity of states prepared on two quantum computers. This task is fundamentally distributed, as no quantum communication can be performed between the two physical platforms due to hardware constraints, which prohibits a joint SWAP test. In this paper we settle the sample complexity of this task across all measurement and communication settings. The essence of the task, which we call distributed quantum inner product estimation, involves two players Alice and Bob who have k copies of unknown states ρ,σ (acting on ℂd) respectively. Their goal is to estimate Tr(ρσ) up to additive error ε∈(0,1), using local quantum operations and classical communication. In the weakest setting where only non-adaptive single-copy measurements and simultaneous message passing are allowed, we show that k=O(max{1/ε2,√d/ε}) copies suffice. This achieves a savings compared to full tomography which takes Ω(d3) copies with single-copy measurements. Surprisingly, we also show that the sample complexity must be at least Ω(max{1/ε2,√d/ε}), even in the strongest setting where adaptive multi-copy measurements and arbitrary rounds of communication are allowed. This shows that the success achieved by shadow tomography, for sample-efficiently learning the properties of a single system, cannot be generalized to the distributed setting. Furthermore, the fact that the sample complexity remains the same with single and multi-copy measurements contrasts with single system quantum property testing, which often demonstrate exponential separations in sample complexity with single and multi-copy measurements.
Continuous-variable (CV) quantum states are naturally characterized by their moments, defined as expectation values of products of single- or multimode ladder operators. Many CV Hamiltonians and quantum algorithms are formulated directly in terms of these moments, and therefore an efficient procedure to estimate moments with limited state measurements is necessary. In this paper, we present a protocol for shadow tomography of moment-generating functions (MGFs) of CV states based on randomized homodyne and heterodyne measurements. The resulting shadows enable an efficient and concurrent estimation of many multimode moments. Our complexity analysis shows that the number of measurements required to estimate a certain moment to a given precision grows exponentially in the order of the moments. Finally, we assess the precision of these moment estimators by applying them to two tasks: detecting entanglement in both Gaussian and non-Gaussian states via the Shchukin-Vogel protocol, and characterizing optical loss in a photonic chip. We demonstrate that both tasks can be accomplished with only a few thousand randomized measurements. The small number of required measurements, combined with efficient sample processing, makes our protocol applicable to a wide range of CV simulation tasks.
In this article we develop a continuous variable (CV) shadow tomography scheme with wide ranging applications in quantum optics. Our work is motivated by the increasing experimental and technological relevance of CV systems in quantum information, quantum communication, quantum sensing, quantum simulations, quantum computing and error correction. We introduce two experimentally realisable schemes for obtaining classical shadows of CV (possibly non-Gaussian) quantum states using only randomised Gaussian unitaries and easily implementable Gaussian measurements such as homodyne and heterodyne detection. For both schemes, we show thatN=O(poly (1 /ϵ, log (1/δ),Mr+αn, log(m) )) samples of an unknownm-mode state ρ suffice to learn the expected value of anyr-local polynomial in the canonical observables of degree α, both with high probability 1 - δ and accuracy ϵ, as long as the state ρ has moments of ordern> α bounded byMn. By simultaneously truncating states and operators in energy and phase space, we are able to overcome new mathematical challenges that arise due to the infinite-dimensionality of CV systems. We also provide a scheme to learn nonlinear functionals of the state, such as entropies over any small number of modes, by leveraging recent energy-constrained entropic continuity bounds. Finally, we provide numerical evidence of the efficiency of our protocols in the case of CV states of relevance in quantum information theory, including ground states of quadratic Hamiltonians of many-body systems and cat qubit states. We expect our scheme to provide good recovery in learning relevant states of 2D materials and photonic crystals.