REVIEW 1 major objections 5 minor 63 references
In situ characterization of linear-optical networks in randomized boson sampling
T0 review · 1 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash
Pith's one-line read Randomized boson sampling can be turned into an efficient in situ characterization of lossy linear-optical networks by switching Alice's measurements to heterodyne detection.
desk verdict A genuinely new in situ characterization protocol for lossy LONs in randomized boson sampling, but the headline resource claim T ~ M/delta^2 is off by a factor of M because the estimator divides by small Haar-random diagonal elements. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The argument is carried by the two-mode squeezed-vacuum state shared between Alice and Bob, plus Alice's ability to choose, run by run, between photon counting and heterodyne detection. A heterodyne outcome $\alpha$ prepares Bob's input in a coherent state $\chi\alpha^*$, and conditioning on no counts in Bob's output mode $i$ leaves Alice's heterodyne statistics in a zero-mean Gaussian whose covariance ellipse has a special axis determined by the outer product $L_iL_i^\dagger$ of the $i$th column of the lossy transfer matrix; measuring the ellipse's orientation and radii recovers that column. The companion object is the entanglement fidelity $F(\rho_{AB|U},\rho_{AB|L})=(1-\chi^2)^M/|\det(I-\chi^2 LU^\dagger)|$, obtained from a Gaussian coherent-state integral over the thermal input state, which converts the whole network comparison into a scalar and then, via standard fidelity–trace-distance inequalities, into a bound on total variation distance between output distributions.
What would settle it
Construct a LON with known engineered losses and add a controllable dark-count rate to Bob's detectors, then run the heterodyne characterization: if the claim is right, the no-count-conditioned outcomes remain a zero-mean Gaussian with covariance $S_i^{-1}$ and the recovered $L$ matches the engineered network; systematic bias or non-Gaussianity that grows with the dark-count rate would falsify the loss-only assumption and identify the protocol's boundary.
Extended reading notes
Core claim
The central discovery is that the full lossy transfer matrix $L$ of Bob's network can be recovered from first-order coherence in Alice's conditioned heterodyne statistics. Given heterodyne outcome vector $\alpha$ and no photocount in Bob's output mode $i$, Alice's outcomes are drawn from the zero-mean Gaussian distribution $P(\alpha|0_i,L)\propto e^{-\alpha^* S_i \alpha^T}$ with $S_i=(1-\chi^2)I+\chi^2 L_i L_i^\dagger$, so the covariance matrix $S_i^{-1}$ determines the column $L_i$ of $L$. Estimating these covariances for each output mode yields all of $L$, up to output-phase conventions, with uncertainty $\delta\sim \sqrt{M/T}$. The paper further shows that the quantum fidelity between the joint states after the ideal and lossy networks, $F(\rho_{AB|U},\rho_{AB|L})=(1-\chi^2)^M/|\det(I-\chi^2 LU^\dagger)|$, is a computable process-level comparison, and that the total variation distance between the ideal and lossy RBS photocount distributions is bounded by $\sqrt{1-F^2}$.
Load-bearing premise
The entire protocol presumes that every imperfection at Bob's end can be absorbed into a subunitary transfer matrix $L$—pure loss at the input, inside the network, or in the detectors—so that dark counts, mode-mismatched photons that still reach the detectors, and excess Gaussian noise lie outside the model and break both the covariance-based reconstruction and the fidelity bound.
Editorial extensions
If this is right
- Alice can intersperse characterization runs with RBS sampling runs without changing Bob's apparatus or telling him which is which, so the same experimental session yields both samples and a live estimate of the LON.
- The required number of characterization runs grows only linearly in the number of modes, $T\sim M/\delta^2$, for a target per-element uncertainty $\delta$ in the transfer matrix.
- From the characterized $L$, the entanglement fidelity $F=(1-\chi^2)^M/|\det(I-\chi^2 LU^\dagger)|$ gives a computable sufficient condition: if $F\ge\sqrt{1-\epsilon^2}$, then the total variation distance between the ideal and actual RBS photocount distributions is at most $\epsilon$.
- Bob's unconditional output statistics determine only the output loss matrix $L^\dagger L$, not the lossless part $V$; Alice's conditional heterodyne statistics are the ones that determine the full transfer matrix.
- Under uniform loss $L=tU$, the fidelity is $((1-\chi^2)/(1-\chi^2 t))^M$, so the bound degrades exponentially in $M$ as the transmissivity $t$ drops below one.
Reading between the lines
- Because the whole characterization rests on first-order coherence, the entanglement of the shared squeezed vacuum is doing identifiable work: with a phase-randomized 'classical-classical' input the same moments only recover $L$ up to complex conjugation and require $T\sim M^2/\delta^2$ runs, so the linear-versus-quadratic scaling is a quantitative measure of what the entanglement buys.
- The fidelity $F(\rho_{AB|U},\rho_{AB|L})$ is defined for any two linear-optical processes, so a natural extension is to use it as a standard acceptance metric in generalized photonic circuit debugging, not just in boson sampling, whenever both networks are pure-loss.
- A direct experimental test of the protocol's boundary would be to add a controlled dark-count rate to Bob's detectors: the no-count-conditioned heterodyne distribution should cease to be the predicted zero-mean Gaussian, and the estimated $L$ should show systematic bias that grows with the dark-count rate.
- The paper leaves non-transfer-matrix noise (mode mismatch, excess Gaussian noise) as an open problem; a parameterized extension that adds such noise to the conditional covariance would let one probe whether the model remains identifiable from heterodyne data alone.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. This paper proposes and analyzes a protocol for characterizing a lossy linear-optical network (LON) in the setting of randomized boson sampling (RBS). Alice and Bob share M two-mode squeezed-vacuum states. In RBS runs Alice uses photon counting; in characterization runs she performs heterodyne detection on her modes. Conditioned on Bob reporting no counts in a given output mode, Alice's heterodyne outcomes are Gaussian, with a covariance matrix that encodes the corresponding column of the lossy transfer matrix L. The paper derives estimators for diagonal and off-diagonal elements of L (Eqs. (3.53)–(3.54)), states a sample-complexity bound T∼M/δ^2 (Eq. (3.55)), and derives a fidelity between the ideal and lossy joint states that bounds the total variation distance between the ideal and lossy RBS probability distributions (Eqs. (3.69)–(3.70)). It also discusses limitations (dark counts, mode mismatch, excess noise) and provides appendices with a Kraus-operator description of lossy LONs and an analysis of characterization with classical-classical correlations.
Significance. The basic idea is attractive and the core derivations are explicit: the conditioned heterodyne distribution is Gaussian, the covariance is a rank-one perturbation of the identity, and the fidelity bound is obtained by a clean Gaussian integral. The paper is honest about the scope of the pure-loss model. The fidelity measure (entanglement fidelity) and the bound on total variation distance are useful contributions in their own right. The derivations are explicit and checkable, which is a strength. However, the advertised efficiency scaling T∼M/δ^2 is the central quantitative claim, and as written it does not follow from the estimators; this requires a nontrivial revision of either the estimation procedure or the scaling claim.
major comments (1)
- [Sec. III B 3, Eqs. (3.53)–(3.55)] The key scaling claim T∼M/δ^2 is not supported by the estimators presented. From Eq. (3.54), L_ji = −⟨α_j α_i^*⟩_i/(χ^2 L_ii), so the standard error in L_ji is ∼1/(χ^2 |L_ii| sqrt(T)), not the stated ∼1/(χ^2 sqrt(T)). For a Haar-random U, |U_ii|^2 has a Beta(1, M−1) distribution, so |L_ii| is typically O(M^{−1/2}); with χ^2 ≃ 1/√M this gives per-element uncertainty ∼M/√T and hence T ∼ M^2/δ^2. The paper explicitly uses only the M moments with k = i (Eq. (3.50)) and does not exploit the full covariance matrix, so the linear scaling does not follow. Note that this quadratic scaling is the same as the paper finds for the classical-classical-state protocol in Appendix B (end of B.3), which undercuts the stated advantage of the TMSV-based method. The claim can likely be repaired by estimating the special eigenvector of the full covariance matrix S_i^{-1} (the eigenvalue gap is O(χ^2), so the eigenvector error is O(1/(χ^2√T))), but as written the protocol and its complexity claim are internally inconsistent.
minor comments (5)
- [After Eq. (3.36)] The word "Husismi" should be "Husimi".
- [Sec. III B 3] The step from the outer products L_i L_i† to a complete reconstruction of L is asserted with "A little thought shows that..." but is not demonstrated; a short explicit reconstruction algorithm would help the reader verify the uniqueness claim.
- [Sec. IV] The Nobel Prize narrative is stylistically unusual for a research paper; it could be shortened or moved to a more informal venue.
- [Abstract] The phrase "without Bob's knowing" is colloquial; "without Bob's knowledge" would be more standard.
- [Eq. (3.75)] The approximation for the fidelity in the uniform-loss case is written with "≃" but the two exponents are of different order in χ^2; clarifying the regime of validity would be helpful.
Circularity Check
No significant circularity: the covariance-to-L inversion and fidelity bound are explicit and self-contained.
full rationale
The paper's central derivation is self-contained. The conditional heterodyne distribution given no counts in output mode i is derived directly from the two-mode squeezed-vacuum state and the coherent-state action of the lossy LON (Eqs. 3.15-3.44). The covariance S_i^{-1} is then inverted in Eqs. (3.50)-(3.54) to express the column L_i in terms of measured second moments; this is an explicit parameter inversion from a well-defined likelihood, not a fitted parameter relabeled as a prediction. The fidelity bound in Eq. (3.70) uses the characterized L and the requested U as arguments; the inequality D ≤ sqrt(1-F^2) is a standard result, and F(ρ_AB|U, ρ_AB|L) is a definitional function of the same L used in the characterization, so no circularity arises. Self-citations to prior coherent-state characterization [34,35], randomized boson sampling [15], and SU(1,1) interferometry [32] are motivational or contextual; the main inversion and fidelity calculation do not depend on these citations as load-bearing premises. The admitted limitations in Sec. IV (dark counts, mode-mismatched photons, and excess Gaussian noise) delimit the model but do not make the derivation circular. The possible T-scaling issue raised by the skeptic is an accuracy concern about the estimator variance and Haar-random typical column magnitudes, not a reduction of the result to its own inputs.
Assumptions & free parameters
assumptions (5)
- domain assumption The lossy LON is fully characterized by a subunitary M×M transfer matrix L acting on coherent states as |β⟩ → |βL⟩.
- domain assumption The M SPDC sources produce identical two-mode squeezed-vacuum states with known squeezing parameter χ, with relative phases set so χ is real.
- domain assumption Bob is honest and implements the requested LON; Alice can interleave characterization runs without changing anything at Bob's end.
- domain assumption Weak squeezing, χ^2 ≲ 1/√M, holds for the efficiency estimates and simplified reconstructions.
- standard math Standard properties of Gaussian states, coherent-state transformations, and fidelity inequalities used in derivations.
Cite this review
Pith. "Pith review of In situ characterization of linear-optical networks in randomized boson sampling." pith.science (2026). https://pith.science/paper/KJYXWMCY
@misc{pith2026190900827,
author = {Pith},
title = {Pith review of: In situ characterization of linear-optical networks in randomized boson sampling},
year = {2026},
howpublished = {\url{https://pith.science/paper/KJYXWMCY}},
note = {Machine review of arXiv:1909.00827}
}
read the original abstract
We introduce a method for efficient, in situ characterization of linear-optical networks (LONs) in randomized boson-sampling (RBS) experiments. We formulate RBS as a distributed task between two parties, Alice and Bob, who share two-mode squeezed-vacuum states. In this protocol, Alice performs local measurements on her modes, either photon counting or heterodyne. Bob implements and applies to his modes the LON requested by Alice; at the output of the LON, Bob performs photon counting, the results of which he sends to Alice via classical channels. In the ideal situation, when Alice does photon counting, she obtains from Bob samples from the probability distribution of the RBS problem, a task that is believed to be classically hard to simulate. When Alice performs heterodyne measurements, she converts the experiment to a problem that is classically efficiently simulable, but more importantly, enables her to characterize a lossy LON on the fly, without Bob's knowing and without changing anything at Bob's end (this is what we mean by in situ). We introduce and calculate the fidelity between the joint states shared by Alice and Bob after the ideal and lossy LONs as a measure of distance between the two LONs. Using this measure, we obtain an upper bound on the total variation distance between the ideal probability distribution for the RBS problem and the probability distribution achieved by a lossy LON. Our method displays the power of the entanglement of the two-mode squeezed-vacuum states: the entanglement allows Alice to choose for each run of the experiment between RBS and a simple characterization protocol based on first-order coherence between complex amplitudes.
Figures
Reference graph
Works this paper leans on
-
[1]
Lossy networks using auxiliary loss modes To make progress, we need to do some preliminary work by developing the description of the lossy network as part of a larger, lossless network that has ˜M auxiliary modes; the auxiliary modes are initialized in vacuum and receive the photons lost from Bob’s original network. This larger network is characterized by...
-
[2]
Fidelity bound (3.69) We turn now to the fidelity bound (3.69) and start with the fidelity (3.63) between the ideal and lossy RBS distributions, F ( PBS|nA,U,P BS|nA,L ) = ∑ nB √ PBS(nB|nA,U)PBS(nB|nA,L) = ∑ nB |nB|=|nA| |⟨nA|U†|nB⟩| √ ⟨nB|EL (|nA⟩⟨nA|)|nB⟩. (A23) The factor ⏐⏐⟨nB|U| nA⟩ ⏐⏐ is zero unless|nB| =|nA|, so it gives the indicated restriction on ...
-
[3]
A 2 we formulate bounds on the classical fidelity between the joint distributionsPQ|U andPQ|L of Eqs
Fidelity bounds in fixed photon-number sectors In App. A 2 we formulate bounds on the classical fidelity between the joint distributionsPQ|U andPQ|L of Eqs. (2.6) and (3.7). At Eq. (A27), this involved averaging the fidelity between the ideal and lossy boson-sampling distributions over all input photo- count recordsnA. In this section, we formulate fidelity b...
-
[4]
Conditional heterodyne statistics Starting with a joint probability distribution P (α,nB|L), we want to condition the heterodyne outcomes on photocount records at Bob’s end. The only conditioning we use below is on a fixed set of modes having no counts, but for generality here, we introduce a set ∆ of photocount records and the projector onto the subset sp...
-
[5]
Conditional heterodyne moments Our characterization procedure runs on conditional heterodyne moments. The moment-generating characteristic function, Φ(ξ,ξ†|∆,L) = ⟨ eξα†−αξ†⟩ = ∫ d2MαP (α|∆,L)eξα†−αξ† , (B19) is the Fourier transform of the relevant distribution and corresponds to F (α,α†) = eξα†−αξ† . The characteristic function generates moments via its...
-
[6]
Characterization using CC state The classical-classical (CC) state (4.1) has perfect, but purely classical photon-number correlations between theA modes and theB modes; thus it can be used for randomized boson sampling in exactly the same way as the two-mode squeezed-vacuum 27 input|ΨAB⟩ of Eq. (2.2). For both these states, the marginal state of either th...
-
[7]
RBS-only characterization A reward—really quite a considerable reward—for having done the analysis of heterodyne statistics and the CC state is that we can now address and answer the question of what kind of characterization can be done with Alice’s conditional photostatistics in the RBS runs of our protocol. If we are interested only in photocounting at ...
-
[8]
Preskill, Quantum computing and the entanglement frontier, 2012, arXiv:1203.5813
J. Preskill, Quantum computing and the entanglement frontier, 2012, arXiv:1203.5813
arXiv 2012
Show all 63 references
-
[9]
A. W. Harrow and A. Montanaro, Quantum computational supremacy, Nature 549, 203 (2017)
2017
-
[10]
Aaronson and A
S. Aaronson and A. Arkhipov, The computational complexity of linear optics, Theory of Computing 9(4), 143 (2013)
2013
-
[11]
M. J. Bremner, A. Montanaro, and D. J. Shepherd, Average-case complexity versus approximate simulation of commuting quantum computations, Phys. Rev. Lett. 117, 080501 (2016)
2016
-
[12]
Gao, S.-T
X. Gao, S.-T. Wang, and L.-M. Duan, Quantum supremacy for simulating a translation-invariant Ising spin model, Phys. Rev. Lett. 118, 040502 (2017). 31
2017
-
[13]
Boixo, S
S. Boixo, S. V . Isakov, V . N. Smelyanskiy, R. Babbush, N. Ding, Z. Jiang, M. J. Bremner, J. M. Martinis, and H. Neven,Characterizing quantum supremacy in near-term devices, Nat. Phys. 14, 595 (2018)
2018
-
[14]
M. A. Broome, A. Fedrizzi, S. Rahimi-Keshari, J. Dove, S. Aaronson, T. C. Ralph, and A. G. White, Photonic boson sampling in a tunable circuit, Science 339, 794 (2013)
2013
-
[15]
J. B. Spring, B. J. Metcalf, P. C. Humphreys, W. S. Kolthammer, X. Jin, M. Barbieri, A. Datta, N. Thomas-Peter, N. K. Langford, D. Kundys, J. C. Gates, B. J. Smith, P. G. R. Smith, and I. A. Walmsley,Boson sampling on a photonic chip, Science 339, 798 (2013)
2013
-
[16]
Tillmann, B
M. Tillmann, B. Daki ´c, R. Heilmann, S. Nolte, A. Szameit, and P. Walther,Experimental boson sampling, Nat. Photon. 7, 540 (2013)
2013
-
[17]
Spagnolo, C
N. Spagnolo, C. Vitelli, M. Bentivegna, D. J. Brod, A. Crespi, F. Flamini, S. Giacomini, G. Milani, R. Ramponi, P. Mataloni, R. Osellame, E. F. Galvao, and F. Sciarrino,Experimental validation of photonic boson sampling, Nat. Photon. 8, 615 (2014)
2014
-
[18]
Carolan, C
J. Carolan, C. Harrold, C. Sparrow, E. Mart ´ın-L´opez, N. J. Russell, J. W. Silverstone, P. J. Shadbolt, N. Matsuda, M. Oguma, M. Itoh, G. D. Marshall, M. G. Thompson, J. C. F. Matthews, T. Hashimoto, J. L. OBrien, and A. Laing,Universal linear optics, Science 349, 711 (2015)
2015
-
[19]
H. Wang, Y . He, Y .-H. Li, Z.-E. Su, B. Li, H.-L. Huang, X. Ding, M.-C. Chen, C. Liu, J. Qin, J.-P. Li, Y .-M. He, C. Schneider, M. Kamp, C.-Z. Peng, S. H¨ofling, C.-Y . Lu, and J.-W. Pan,High-efficiency multiphoton boson sampling, Nat. Photon. 11, 361 (2017)
2017
-
[20]
J. C. Loredo, M. A. Broome, P. Hilaire, O. Gazzano, I. Sagnes, A. Lemaitre, M. P. Almeida, P. Senellart, and A. G. White,Boson sampling with single-photon Fock states from a bright solid-state source, Phys. Rev. Lett. 118, 130503 (2017)
2017
-
[21]
Y . He, X. Ding, Z. E. Su, H.-L. Huang, J. Qin, C. Wang, S. Unsleber, C. Chen, H. Wang, Y .-M. He, X.-L. Wang, W.-J. Zhang, S.-J. Chen, C. Schneider, M. Kamp, L.-X. You, Z. Wang, S. H¨ofling, C.-Y . Lu, and J.-W. Pan,Time-bin-encoded boson sampling with a single-photon device, ...
2017
-
[22]
A. P. Lund, A. Laing, S. Rahimi-Keshari, T. Rudolph, J. L. O’Brien, and T. C. Ralph, Boson sampling from a Gaussian state , Phys. Rev. Lett.113, 100502 (2014). This paper proposed randomized boson sampling (RBS) using two-mode squeezed-vacuum states emitted by SPDC sources. At...
2014
-
[23]
Bentivegna, N
M. Bentivegna, N. Spagnolo, C. Vitelli, F. Flamini, N. Viggianiello, L. Latmiral, P. Mataloni, D. J. Brod, E. F. Galv ˜ao, A. Crespi, R. Ramponi, R. Osellame, and F. Sciarrino, Experimental scattershot boson sampling, Sci. Adv. 1, e1400255 (2015)
2015
-
[24]
Zhong, Y
H.-S. Zhong, Y . Li, W. Li, L.-C. Peng, Z.-E. Su, Y . Hu, Y .-M. He, X. Ding, W. Zhang, H. Li, L. Zhang, Z. Wang, L. You, X.-L. Wang, X. Jiang, L. Li, Y .-A. Chen, N.-L. Liu, C.-Y . Lu, and J.-W. Pan,12-photon entanglement and scalable scattershot boson sampling with optimal e...
2018
-
[25]
Aaronson and L
S. Aaronson and L. Chen, Complexity-theoretic foundations of quantum supremacy experiments, 2016, arXiv:1612.05903
2016 arXiv
-
[26]
quantum supremacy
D. Hangleiter, M. Kliesch, J. Eisert, and C. Gogolin, Sample complexity of device-independently certified “quantum supremacy” , Phys. Rev. Lett. 122, 210502 (2019)
2019
-
[27]
Broadbent, J
A. Broadbent, J. Fitzsimons, and E. Kashefi, Universal blind quantum computation, in Proceedings of 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2009), Atlanta, GA, October 25–27, 2009 (IEEE Xplore, 2010); doi: 10.1109/FOCS.2009.36
2009 doi
-
[28]
Aharonov, M
D. Aharonov, M. Ben-Or, E. Eban, and U. Mahadev, Interactive proofs for quantum computations, 2017, arXiv:1704.04487
2017 arXiv
-
[29]
Aolita, C
L. Aolita, C. Gogolin, M. Kliesch, and J. Eisert, Reliable quantum certification of photonic state preparations , Nat. Commun. 6, 8498 (2015)
2015
-
[30]
Miller, S
J. Miller, S. Sanders, and A. Miyake, Quantum supremacy in constant-time measurement-based computation: A unified architecture for sampling and verification, Phys. Rev. A 96, 062320 (2017)
2017
-
[31]
Hangleiter, M
D. Hangleiter, M. Kliesch, M. Schwarz, and J. Eisert, Direct certification of a class of quantum simulations , Quantum Sci. Technol. 2, 015004 (2017)
2017
-
[32]
Broadbent, How to verify a quantum computation, Theory of Computing 14, 11 (2018)
A. Broadbent, How to verify a quantum computation, Theory of Computing 14, 11 (2018)
2018
-
[33]
J. F. Fitzsimons, M. Hajdu ˇsek, and T. Morimae, Post hoc verification of quantum computation, Phys. Rev. Lett. 120, 040501 (2018)
2018
-
[34]
Takeuchi and T
Y . Takeuchi and T. Morimae,Verification of many-qubit states, Phys. Rev. X 8, 021060 (2018)
2018
-
[35]
Ferracin, T
S. Ferracin, T. Kapourniotis, and A. Datta,Reducing resources for verification of quantum computations, Phys. Rev. A98, 022323 (2018)
2018
-
[36]
Hayashi and Y
M. Hayashi and Y . Takeuchi, Verifying commuting quantum computation via fidelity estimation of weighted graph states , 2019, arXiv:1902.03369
2019 arXiv
-
[37]
Ferracin, T
S. Ferracin, T. Kapourniotis, and A. Datta, Accrediting outputs of noisy intermediate-scale quantum computing devices , 2018, arXiv:1811.09709
2018 arXiv
-
[38]
Yurke, S
B. Yurke, S. L. McCall, and J. R. Klauder, SU(2) and SU(1,1) interferometers, Phys. Rev. A 33, 4033–4054 (1986)
1986
-
[39]
C. M. Caves, Reframing SU(1,1) interferometry, submitted to Advanced Quantum Technologies, 2019, arXiv:1912.12530
2019 arXiv
-
[40]
R. J. Glauber, Optical coherence and photon statistics , in Quantum Optics and Electronics, edited by C. DeWitt, A. Blandin, and C. Cohen-Tannoudji (Gordon and Breach, New York, 1965), pp. 65–85
1965
-
[41]
Rahimi-Keshari, A
S. Rahimi-Keshari, A. Scherer, A. Mann, A. T. Rezakhani, A. I. Lvovsky, and Barry C. Sanders, Quantum process tomography with coherent states, New J. Phys. 13, 013006 (2011)
2011
-
[42]
Rahimi-Keshari, M
S. Rahimi-Keshari, M. A. Broome, R. Fickler, A. Fedrizzi, T. C. Ralph, and A. G. White, Direct characterization of linear-optical networks, Optics Express 21, 013450 (2013)
2013
-
[43]
Husimi, Some formal properties of the density matrix, Proc
K. Husimi, Some formal properties of the density matrix, Proc. Phys.-Math. Soc. Japan 22, 264 (1940)
1940
-
[44]
R. J. Glauber, Photon correlations, Phys. Rev. Lett. 10, 84 (1963)
1963
-
[45]
E. C. G. Sudarshan, Equivalence of semiclassical and quantum mechanical descriptions of statistical light beams , Phys. Rev. Lett. 10, 277 (1963)
1963
-
[46]
Rahimi-Keshari, A
S. Rahimi-Keshari, A. P. Lund, and T. C. Ralph, What can quantum optics say about computational complexity theory?, Phys. Rev. Lett. 114, 060501 (2015)
2015
-
[47]
Grier and L
D. Grier and L. Schaeffer, New hardness results for the permanent using linear optics , in 33rd Computational Complexity Conference (CCC 2018), edited by R. A. Servedio, Leibniz International Proceedings in Informatics, Art. No. 19, p. 19:1. 32
2018
-
[48]
C. A. Fuchs and J. van de Graaf, Cryptographic distinguishability measures for quantum mechanical states, IEEE Trans. Inf. Theory 45, 1216 (1999)
1999
-
[49]
C. W. Helstrom, Quantum Detection and Estimation Theory, Mathematics in Science and Engineering 123 (Academic Press, New York, 1976), pp. 106
1976
-
[50]
Aharonov, A
D. Aharonov, A. Kitaev, and N. Nisan, Quantum circuits with mixed states , in Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC ’98) (ACM Press, New York, 1998), p. 20
1998
-
[51]
M. E. Shirokov, On the energy-constrained diamond norm and its application in quantum information theory , Prob. Inf. Trans. 54, 20 (2018) [Original Russian text: Problemy Peredachi Informatsii 54(1), 24 (2018)]
2018
-
[52]
Winter, Energy-constrained diamond norm with applications to the uniform continuity of continuous variable channel capacities , 2017, arXiv:1712.10267
A. Winter, Energy-constrained diamond norm with applications to the uniform continuity of continuous variable channel capacities , 2017, arXiv:1712.10267
2017 arXiv
-
[53]
Pirandola, R
S. Pirandola, R. Laurenza, C. Ottaviani, and L. Banchi, Fundamental limits of repeaterless quantum communications , Nat. Comm. 8, 15043 (2017)
2017
-
[54]
Schumacher, Sending entanglement through noisy quantum channels, Phys
B. Schumacher, Sending entanglement through noisy quantum channels, Phys. Rev. A 54, 2614 (1996)
1996
-
[55]
R. A. Abrahao and A. P. Lund, Continuous-variables boson sampling: Scaling and verification, 2018, arXiv:1812.08978
2018 arXiv
-
[56]
Rahimi-Keshari, T
S. Rahimi-Keshari, T. C. Ralph, and C. M. Caves, Sufficient conditions for efficient classical simulation of quantum optics, Phys. Rev. X 6, 021039 (2016)
2016
-
[57]
Shahandeh, A
F. Shahandeh, A. P. Lund, and T. C. Ralph, Quantum correlations in nonlocal boson sampling, Phys. Rev. Lett. 119, 120502 (2017)
2017
-
[58]
Agudelo, J
E. Agudelo, J. Sperling, and W. V ogel,Quasiprobabilities for multipartite quantum correlations of light, Phys. Rev. A87, 033811 (2013)
2013
-
[59]
W. H. Zurek, Einselection and decoherence from an information theory perspective, Ann. Physik (Leipzig) 9, 855–864 (2000)
2000
-
[60]
Ollivier and W
H. Ollivier and W. H. Zurek, Quantum discord: A measure of the quantumness of correlations, Phys. Rev. Lett. 88, 017901 (2001)
2001
-
[61]
M. D. Lang, C. M. Caves, and A. Shaji, Entropic measures of non-classical correlations, Int. J. Quant. Info. 9, 1553–1586 (2011)
2011
-
[62]
H. M. Wiseman and G. J. Milburn, Quantum Measurement and Control (Cambridge University, Cambridge, England, 2009), Chap. 3
2009
-
[63]
Pandey, Z
S. Pandey, Z. Jiang, J. Combes, and C. M. Caves, Quantum limits on probabilistic amplifiers, Phys. Rev. A 88, 033852 (2013)
2013
Reviewed August 14, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.