14,759 Hits in 9.0 sec

Lower bounds on the communication complexity of two-party (quantum) processes [article]

Alberto Montina, Stefan Wolf
2014 arXiv   pre-print
These properties imply that, once a feasible point is found, the computation of a lower bound on the communication cost in any two-party process is linearly complex.  ...  The studied scenario goes beyond quantum processes and includes the communication complexity scenario introduced by Yao.  ...  This work is supported by the Swiss National Science Foundation, the NCCR QSIT, and the COST action on Fundamental Problems in Quantum Physics.  ... 
arXiv:1401.4126v1 fatcat:ib6c6d4igjeyhf5brwsqg2koru

Quantum Information Processing with Adversarial Devices [article]

Matthew McKague
2010 arXiv   pre-print
By examining the outcome statistics of such an experiment, and comparing them against the desired experiment, we may hope to certify that the physical experiment is implementing the desired experiment.  ...  We consider several applications in black-box quantum computation in which untrusted physical quantum devices are connected together to produce an experiment.  ...  Another fact of interest is that, if the conjectured bound on F M Y holds, and the bound on F LOCC is tight, then all three measures would have the same tight lower bound since F M Y lower bounds them  ... 
arXiv:1006.2352v1 fatcat:d4itjymsnjg2jfbjdmif32dpxa

Simple algorithm for computing the communication complexity of quantum communication processes

A. Hansen, A. Montina, S. Wolf
2016 Physical Review A  
A two-party quantum communication process with classical inputs and outcomes can be simulated by replacing the quantum channel with a classical one.  ...  Finally, using our method we obtain 1.238 bits as a lower bound on the asymptotic communication complexity of a noiseless quantum channel with the capacity of 1 qubit.  ...  This work is supported by the Swiss National Science Foundation, the NCCR QSIT, the COST action on Fundamental Problems in Quantum Physics and Hasler foundation through the project "Information-Theoretic  ... 
doi:10.1103/physreva.93.042315 fatcat:alwjommdcbbsrj5k2omkw6f6zm

Necessary and sufficient optimality conditions for classical simulations of quantum communication processes

Alberto Montina, Stefan Wolf
2014 Physical Review A. Atomic, Molecular, and Optical Physics  
The feasible points of the dual constraints, which are inequalities, give lower bounds on the communication complexity, as illustrated with an example.  ...  This lower bound can have interesting consequences in the context of the recent debate on the reality of the quantum state.  ...  This work is supported by the Swiss National Science Foundation, the NCCR QSIT, and the COST action on Fundamental Problems in Quantum Physics.  ... 
doi:10.1103/physreva.90.012309 fatcat:nptorrrvu5fppdidoewl2opgmy

Can quantum discord increase in a quantum communication task?

Shubhayan Sarkar, Chandan Datta
2018 Quantum Information Processing  
Quantum teleportation of an unknown quantum state is one of the few communication tasks which has no classical counterpart.  ...  Furthermore, we show that the fidelity of one-qubit quantum teleportation using Bob's prepared qubits as the channel is higher than using Alice's qubits.  ...  (Dated: August 13, 2018) Quantum teleportation of an unknown quantum state is one of the few communication tasks which  ... 
doi:10.1007/s11128-018-2019-2 fatcat:m6b7cscicjdifc2ovupyzbrd4i

Quantum optical implementation of quantum information processing [article]

J. I. Cirac, L. M. Duan, P. Zoller
2004 arXiv   pre-print
Zoller, in "Experimental Quantum Computation and Information" Proceedings of the International School of Physics "Enrico Fermi", Course CXLVIII, p. 263, edited by F. Di Martini and C.  ...  By popular request we post these old (from 2001) lecture notes of the Varenna Summer School Proceedings. The original was published as J. I. Cirac, L. M. Duan, and P.  ...  two places, and is able to communicate classically without errors. known) complex coefficients.  ... 
arXiv:quant-ph/0405030v1 fatcat:beur2nsmdfhhpikqeoqcnd2uue

Entanglement theory in distributed quantum information processing [article]

Hayata Yamasaki
2019 arXiv   pre-print
The first part of this thesis investigates a communication task, quantum state merging, on the small and intermediate scales.  ...  The second part of this thesis analyzes multipartite entanglement in distributed quantum information processing.  ...  scales, as well as analyzing lower bounds for minimal costs in the one-shot scenario of state merging.  ... 
arXiv:1903.09655v1 fatcat:2cklgp7im5hpldh57fe7btalfy

Quantum information processing and communication

P. Zoller, Th. Beth, D. Binosi, R. Blatt, H. Briegel, D. Bruss, T. Calarco, J. I. Cirac, D. Deutsch, J. Eisert, A. Ekert, C. Fabre (+27 others)
2005 European Physical Journal D : Atomic, Molecular and Optical Physics  
In the case of classical computing such insights include the first exponential bounds on certain locally decodable codes, classical proof systems for lattice problems, bounds on the query complexity of  ...  Multi-party entanglement & applications Research on multi-particle entanglement is on the one hand expected to be focused on novel protocols for quantum information processing in the multi-partite setting  ... 
doi:10.1140/epjd/e2005-00251-1 fatcat:efcbwd456bdndaybjwfkxo26ey

Continuous Variable Quantum Information Processing [article]

Ulrik L. Andersen, Gerd Leuchs, Christine Silberhorn
2010 arXiv   pre-print
If one uses the continuous degree of freedom of a quantum system either for encoding, processing or detecting information, one enters the field of continuous variable (CV) quantum information processing  ...  In this paper we review the basic principles of CV quantum information processing with main focus on recent developments in the field.  ...  Acknowledgments We gratefully acknowledge support from the EU (project COMPAS), the Danish Research Council and the Deutsche Forschungsgemeinschaft.  ... 
arXiv:1008.3468v1 fatcat:hfk5zfbgxbdh3a4ekaneuoik5q

Provable quantum advantage in randomness processing

Howard Dale, David Jennings, Terry Rudolph
2015 Nature Communications  
Here we address a computational scenario of "randomness processing" in which quantum theory provably yields, not only resource reduction over classical stochastic physics, but a strictly larger class of  ...  For example the class of functions computable with classical physics actually exactly coincides with the class computable quantum-mechanically.  ...  Paradigmatic examples have already appeared in single-party cryptography [19] , twoparty cryptography, and communication complexity [20] .  ... 
doi:10.1038/ncomms9203 pmid:26381816 fatcat:zb2mo3pepvgkhgw3smicfznpuy

Quantum symmetrically-private information retrieval

Iordanis Kerenidis, Ronald de Wolf
2004 Information Processing Letters  
We exhibit quantum k-server symmetrically-private information retrieval systems (QSPIRs) that use sublinear communication, do not use shared randomness among the servers, and preserve privacy against honest  ...  For k ≥ 2, no good lower bounds on the required communication are known for this setting.  ...  Table 1 : 1 Best known bounds on the communication complexity of classical and quantum PIR very sensitive information.  ... 
doi:10.1016/j.ipl.2004.02.003 fatcat:krubdy2gx5etfgqomqv2ochl5u

Semi-loss-tolerant strong quantum coin-flipping protocol using quantum non-demolition measurement

Qian Yang, Jia-Jun Ma, Fen-Zhuo Guo, Qiao-Yan Wen
2014 Quantum Information Processing  
A semi-loss-tolerant Quantum Dice Rolling (QDR) protocol is first proposed, and the security of corresponding three-party QDR is analyzed to better demonstrate the security of our QCF.  ...  In this paper, we present a semi-loss-tolerant strong quantum coin-flipping (QCF) protocol with the best bias of 0.3536.  ...  Serial four-party DR protocol showed in Fig 2 has the time complexity 3t while parallel one in Fig 3 has the time complexity 2t because two rounds of DR are executed simultaneously in the parallel  ... 
doi:10.1007/s11128-014-0747-5 fatcat:jr275hawlvbbdcezeq3fzrql3q

Quantum optical systems for the implementation of quantum information processing

T C Ralph
2006 Reports on progress in physics (Print)  
We illustrate our discussion with descriptions of experimental demonstrations of key communication and processing tasks from the last decade and also look forward to the key results likely in the next  ...  We review the field of Quantum Optical Information from elementary considerations through to quantum computation schemes.  ...  For example if two distant parties share entanglement then they can communicate classical information at twice the classical rate through the technique of quantum dense coding [6] .  ... 
doi:10.1088/0034-4885/69/4/r01 fatcat:6om3rbxx6rfl7owwsrvutuvt3u

Quantum hyperentanglement and its applications in quantum information processing [article]

Fu-Guo Deng, Bao-Cang Ren, Xi-Han Li
2017 arXiv   pre-print
Also, a scheme for hyper-controlled-not gate is introduced for hyperparallel photonic quantum computation, which can perform two controlled-not gate operations on both the polarization and spatial-mode  ...  Hyperentanglement is a promising resource in quantum information processing with its high capacity character, defined as the entanglement in multiple degrees of freedom (DOFs) of a quantum system, such  ...  Acknowledgment This work was supported by the National Natural Science Foundation of China (11474026, 11574038, 11547106, 11604226, and 11674033).  ... 
arXiv:1610.09896v5 fatcat:3wz2poj2yngn5dydqbroaiybk4

Photonic quantum information processing: a review

Fulvio Flamini, Nicolò Spagnolo, Fabio Sciarrino
2018 Reports on progress in physics (Print)  
Photonic quantum technologies represent a promising platform for several applications, ranging from long-distance communications to the simulation of complex phenomena.  ...  Furthermore, recent technological advances are now enabling first concrete applications of photonic quantum information processing.  ...  QUCHIP (Quantum Simulation on a Photonic Chip; grant agreement no.641039;  ... 
doi:10.1088/1361-6633/aad5b2 pmid:30421725 fatcat:e22m5n6ejnc4vbyyn66iakhh2a
« Previous Showing results 1 — 15 out of 14,759 results