Fetching the paper…
Reading the bibliography…
A common scenario in distributed computing involves a client who asks a server to perform a computation on a remote computer.
J. Hájek, “Local asymptotic minimax and admissibility in estimation,” in Proceedings of the sixth Berkeley symposium on mathematical statistics and probability , vol. 1, 1972, pp. 175–194
1972
Earlier work this paper cites.
M.-D. Choi, “Completely positive linear maps on complex matrices,” Linear algebra and its applications , vol. 10, no. 3, pp. 285–290, 1975
1975
Earlier work this paper cites.
C. W. Helstrom, Quantum detection and estimation theory . Academic press, 1976
1976
Earlier work this paper cites.
A. C.-C. Yao, “Some complexity questions related to distributive computing(preliminary report),” in Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing , ser. STOC ’79. New York, NY, USA: ACM, 1979, pp. 209–213. [Online]. Available: http://doi.acm.org/10.1145/800135.804414
1979
Earlier work this paper cites.
A. Holevo, Probabilistic and statistical aspects of quantum theory . North-Holland, 1982
1982
Earlier work this paper cites.
N. A. Lynch, Distributed algorithms . Elsevier, 1996
1996
Earlier work this paper cites.
A. Luis and J. Peřina, “Optimum phase-shift estimation and the quantum description of the phase difference,” Physical Review A , vol. 54, no. 5, p. 4564, 1996
1996
Earlier work this paper cites.
M. A. Nielsen and I. L. Chuang, “Programmable quantum gate arrays,” Physical Review Letters , vol. 79, no. 2, p. 321, 1997
1997
Earlier work this paper cites.
I. L. Chuang and M. A. Nielsen, “Prescription for experimental determination of the dynamics of a quantum black box,” Journal of Modern Optics , vol. 44, no. 11-12, pp. 2455–2467, 1997
1997
Earlier work this paper cites.
J. Poyatos, J. I. Cirac, and P. Zoller, “Complete characterization of a quantum process: the two-bit quantum gate,” Physical Review Letters , vol. 78, no. 2, p. 390, 1997
1997
Earlier work this paper cites.
A. Sørensen and K. Mølmer, “Error-free quantum communication through noisy channels,” Physical Review A , vol. 58, pp. 2745–2749, Oct 1998. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.58.2745
1998
Earlier work this paper cites.
D. Gottesman and I. L. Chuang, “Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations,” Nature , vol. 402, no. 6760, pp. 390–393, 1999
1999
Earlier work this paper cites.
V. Bužek, R. Derka, and S. Massar, “Optimal quantum clocks,” Physical Review Letters , vol. 82, no. 10, p. 2207, 1999
1999
Earlier work this paper cites.
J. Fiurášek, M. Dušek, and R. Filip, “Universal measurement apparatus controlled by quantum software,” Physical Review Letters , vol. 89, no. 19, p. 190401, 2002
2002
Earlier work this paper cites.
C. H. Bennett, P. W. Shor, J. A. Smolin, and A. V. Thapliyal, “Entanglement-assisted capacity of a quantum channel and the reverse shannon theorem,” IEEE Transactions on Information Theory , vol. 48, no. 10, pp. 2637–2655, 2002
2002
Earlier work this paper cites.
J. B. Altepeter, D. Branning, E. Jeffrey, T. Wei, P. G. Kwiat, R. T. Thew, J. L. O’Brien, M. A. Nielsen, and A. G. White, “Ancilla-assisted quantum process tomography,” Physical Review Letters , vol. 90, no. 19, p. 193601, 2003
2003
Earlier work this paper cites.
G. Chiribella, G. M. D’Ariano, P. Perinotti, and M. F. Sacchi, “Efficient use of quantum resources for the transmission of a reference frame,” Physical Review Letters , vol. 93, no. 18, p. 180503, 2004
2004
Earlier work this paper cites.
E. Bagan, M. Baig, and R. Munoz-Tapia, “Quantum reverse engineering and reference-frame alignment without nonlocal correlations,” Physical Review A , vol. 70, no. 3, p. 030301, 2004
2004
Earlier work this paper cites.
M. Ohya and D. Petz, Quantum entropy and its use . Springer Science & Business Media, 2004
2004
Earlier work this paper cites.
A. M. Childs, “Secure assisted quantum computation,” Quantum Information & Computation , vol. 5, no. 6, pp. 456–466, 2005
2005
Earlier work this paper cites.
J. A. Bergou and M. Hillery, “Universal programmable quantum state discriminator that is optimal for unambiguously distinguishing between unknown states,” Physical Review Letters , vol. 94, no. 16, p. 160501, 2005
2005
Earlier work this paper cites.
G. M. D’Ariano and P. Perinotti, “Efficient universal programmable quantum measurements,” Physical Review Letters , vol. 94, no. 9, p. 090401, 2005
2005
Earlier work this paper cites.
M. Hillery, M. Ziman, and V. Bužek, “Approximate programmable quantum processors,” Physical Review A , vol. 73, no. 2, p. 022345, 2006
2006
Earlier work this paper cites.
V. Giovannetti, S. Lloyd, and L. Maccone, “Quantum metrology,” Physical Review Letters , vol. 96, no. 1, p. 010401, 2006
2006
Earlier work this paper cites.
M. Hayashi, “Parallel treatment of estimation of su (2) and phase estimation,” Physics Letters A , vol. 354, no. 3, pp. 183–189, 2006
2006
Cited alongside, same era.
J. Kahn, “Fast rate estimation of a unitary operation in su (d),” Physical Review A , vol. 75, no. 2, p. 022326, 2007
2007
Cited alongside, same era.
S. Ishizaka and T. Hiroshima, “Asymptotic teleportation scheme as a universal programmable quantum processor,” Physical Review Letters , vol. 101, no. 24, p. 240501, 2008
2008
Cited alongside, same era.
G. Chiribella, G. M. D’Ariano, and P. Perinotti, “Optimal cloning of unitary transformation,” Physical Review Letters , vol. 101, no. 18, p. 180504, 2008
2008
Cited alongside, same era.
G. Chiribella, G. M. D’Ariano, and P. Perinotti, “Transforming quantum operations: Quantum supermaps,” EPL (Europhysics Letters) , vol. 83, no. 3, p. 30004, 2008
W. Dür, P. Sekatski, and M. Skotiniotis, “Deterministic superreplication of one-parameter unitary transformations,” Physical Review Letters , vol. 114, no. 12, p. 120503, 2015
2015
Later among the works it cites.
G. Chiribella, Y. Yang, and C. Huang, “Universal superreplication of unitary gates,” Physical Review Letters , vol. 114, no. 12, p. 120504, 2015
2015
Later among the works it cites.
G. Chiribella and D. Ebler, “Optimal quantum networks and one-shot entropies,” New Journal of Physics , vol. 18, no. 9, p. 093053, 2016
2016
Later among the works it cites.
2016
Later among the works it cites.
Y. Yang, G. Chiribella, and D. Ebler, “Efficient quantum compression for ensembles of identically prepared mixed states,” Physical Review Letters , vol. 116, no. 8, p. 080501, 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2008
Cited alongside, same era.
Z. Ji, G. Wang, R. Duan, Y. Feng, and M. Ying, “Parameter estimation of quantum channels,” IEEE Transactions on Information Theory , vol. 54, no. 11, pp. 5172–5185, 2008
2008
Cited alongside, same era.
A. Broadbent, J. Fitzsimons, and E. Kashefi, “Universal blind quantum computation,” in 2009 50th Annual IEEE Symposium on Foundations of Computer Science . IEEE, 2009, pp. 517–526
2009
Cited alongside, same era.
——, “Theoretical framework for quantum networks,” Physical Review A , vol. 80, no. 2, p. 022339, 2009
2009
Cited alongside, same era.
W. Dargie and C. Poellabauer, Fundamentals of wireless sensor networks: theory and practice . John Wiley & Sons, 2010
2010
Cited alongside, same era.
M. Berta, M. Christandl, and R. Renner, “A conceptually simple proof of the quantum reverse shannon theorem,” in Conference on Quantum Computation, Communication, and Cryptography . Springer, 2010, pp. 131–140
2010
Cited alongside, same era.
M. Plesch and V. Bužek, “Efficient compression of quantum information,” Physical Review A , vol. 81, no. 3, p. 032317, 2010
2010
Cited alongside, same era.
S. Pirandola, “Quantum reading of a classical digital memory,” Physical Review Letters , vol. 106, no. 9, p. 090504, 2011
2011
Cited alongside, same era.
2016
Later among the works it cites.
Y. Yang, G. Chiribella, and M. Hayashi, “Optimal compression for identically prepared qubit states,” Physical Review Letters , vol. 117, no. 9, p. 090502, 2016
2016
Later among the works it cites.
J. F. Fitzsimons and E. Kashefi, “Unconditionally verifiable blind quantum computation,” Physical Review A , vol. 96, no. 1, p. 012303, 2017
2017
Later among the works it cites.
E. Kashefi and A. Pappa, “Multiparty delegated quantum computing,” Cryptography , vol. 1, no. 2, p. 12, 2017
2017
Later among the works it cites.
2017
Later among the works it cites.
Y. Yang, G. Chiribella, and Q. Hu, “Units of rotational information,” New Journal of Physics , vol. 19, no. 12, p. 123003, 2017
2017
Later among the works it cites.
S. Pirandola, R. Laurenza, C. Ottaviani, and L. Banchi, “Fundamental limits of repeaterless quantum communications,” Nature Communications , vol. 8, p. 15043, 2017
2017
Later among the works it cites.
S. Pirandola and C. Lupo, “Ultimate precision of adaptive noise estimation,” Physical Review Letters , vol. 118, no. 10, p. 100502, 2017
2017
Later among the works it cites.
——, “Erratum: Ultimate precision of adaptive noise estimation [phys. rev. lett. 118, 100502 (2017)],” Physical Review Letters , vol. 119, no. 12, p. 129901, 2017
2017
Later among the works it cites.
M. Hassani, C. Macchiavello, and L. Maccone, “Digital quantum estimation,” Physical Review Letters , vol. 119, no. 20, p. 200502, 2017
2017
Later among the works it cites.
J. Czajkowski, M. Jarzyna, and R. Demkowicz-Dobrzański, “Super-additivity in communication of classical information through quantum channels from a quantum parameter estimation perspective,” New Journal of Physics , vol. 19, no. 7, p. 073034, 2017
2017
Later among the works it cites.
Y. Yang, G. Chiribella, and M. Hayashi, “Quantum stopwatch: how to store time in a quantum memory,” Proceedings of the Royal Society A , vol. 474, no. 2213, p. 20170773, 2018
2018
Later among the works it cites.
F. Leditzky, E. Kaur, N. Datta, and M. M. Wilde, “Approaches for approximate additivity of the Holevo information of quantum channels,” Physical Review A , vol. 97, no. 1, p. 012332, 2018
2018
Later among the works it cites.
Y. Yang, G. Bai, G. Chiribella, and M. Hayashi, “Compression for quantum population coding,” IEEE Transactions on Information Theory (Early Access) , 2018
2018
Later among the works it cites.
M. Sedlák, A. Bisio, and M. Ziman, “Optimal probabilistic storage and retrieval of unitary channels,” Physical Review Letters , vol. 122, no. 17, p. 170502, 2019
2019
Later among the works it cites.
A. M. Kubicki, C. Palazuelos, and D. Pérez-García, “Resource quantification for the no-programing theorem,” Physical Review Letters , vol. 122, no. 8, p. 080505, 2019
2019
Later among the works it cites.
S. Das and M. M. Wilde, “Quantum reading capacity: General definition and bounds,” IEEE Transactions on Information Theory , vol. 65, no. 11, pp. 7566–7583, 2019
2019
Later among the works it cites.
K. Fang, X. Wang, M. Tomamichel, and M. Berta, “Quantum channel simulation and the channel’s smooth max-information,” IEEE Transactions on Information Theory , pp. 1–1, 2019
2019
Later among the works it cites.