Academic literature on the topic 'Quantum Zeno protocols'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Quantum Zeno protocols.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Quantum Zeno protocols"
Müller, Matthias M., Stefano Gherardini, and Filippo Caruso. "Quantum Zeno Dynamics Through Stochastic Protocols." Annalen der Physik 529, no. 9 (July 21, 2017): 1600206. http://dx.doi.org/10.1002/andp.201600206.
Full textGherardini, Stefano, Andrea Smirne, Matthias M. Müller, and Filippo Caruso. "Advances in Sequential Measurement and Control of Open Quantum Systems." Proceedings 12, no. 1 (June 24, 2019): 11. http://dx.doi.org/10.3390/proceedings2019012011.
Full textJain, R., A. Kolla, G. Midrijanis, and B. W. Reichardt. "On parallel composition of zero-knowledge proofs with black-box quantum." Quantum Information and Computation 9, no. 5&6 (May 2009): 513–32. http://dx.doi.org/10.26421/qic9.5-6-11.
Full textKerenidis, Iordanis, Mathieu Lauriere, Francois Le Gall, and Mathys Rennela. "Information cost of quantum communication protocols." Quantum Information and Computation 16, no. 3&4 (March 2016): 181–96. http://dx.doi.org/10.26421/qic16.3-4-1.
Full textWANG, XIANG-BIN. "AN EFFICIENT PROTOCOL FOR SECURE AND DETERMINISTIC QUANTUM KEY EXPANSION." International Journal of Quantum Information 04, no. 06 (December 2006): 955–63. http://dx.doi.org/10.1142/s021974990600233x.
Full textBOUDA, J., P. MATEUS, N. PAUNKOVIC, and J. RASGA. "ON THE POWER OF QUANTUM TAMPER-PROOF DEVICES." International Journal of Quantum Information 06, no. 02 (April 2008): 281–302. http://dx.doi.org/10.1142/s0219749908003542.
Full textBellini, Emanuele, Chiara Marcolla, and Nadir Murru. "An Application of p-Fibonacci Error-Correcting Codes to Cryptography." Mathematics 9, no. 7 (April 6, 2021): 789. http://dx.doi.org/10.3390/math9070789.
Full textdo Nascimento, José Cláudio, and Rubens Viana Ramos. "Quantum protocols for zero-knowledge systems." Quantum Information Processing 9, no. 1 (August 11, 2009): 37–46. http://dx.doi.org/10.1007/s11128-009-0127-8.
Full textOLIVEIRA, J. G., R. ROSSI, and M. C. NEMES. "MULTIPARTITE ENTANGLEMENT CONTROL VIA THE QUANTUM ZENO EFFECT." International Journal of Quantum Information 08, no. 06 (September 2010): 961–67. http://dx.doi.org/10.1142/s0219749910006204.
Full textVidick, Thomas, and Tina Zhang. "Classical zero-knowledge arguments for quantum computations." Quantum 4 (May 14, 2020): 266. http://dx.doi.org/10.22331/q-2020-05-14-266.
Full textDissertations / Theses on the topic "Quantum Zeno protocols"
MEDEIROS, Rex Antonio da Costa. "Zero-Error capacity of quantum channels." Universidade Federal de Campina Grande, 2008. http://dspace.sti.ufcg.edu.br:8080/jspui/handle/riufcg/1320.
Full textMade available in DSpace on 2018-08-01T21:11:37Z (GMT). No. of bitstreams: 1 REX ANTONIO DA COSTA MEDEIROS - TESE PPGEE 2008..pdf: 1089371 bytes, checksum: ea0c95501b938e0d466779a06faaa4f6 (MD5) Previous issue date: 2008-05-09
Nesta tese, a capacidade erro-zero de canais discretos sem memória é generalizada para canais quânticos. Uma nova capacidade para a transmissão de informação clássica através de canais quânticos é proposta. A capacidade erro-zero de canais quânticos (CEZQ) é definida como sendo a máxima quantidade de informação por uso do canal que pode ser enviada através de um canal quântico ruidoso, considerando uma probabilidade de erro igual a zero. O protocolo de comunicação restringe palavras-código a produtos tensoriais de estados quânticos de entrada, enquanto que medições coletivas entre várias saídas do canal são permitidas. Portanto, o protocolo empregado é similar ao protocolo de Holevo-Schumacher-Westmoreland. O problema de encontrar a CEZQ é reformulado usando elementos da teoria de grafos. Esta definição equivalente é usada para demonstrar propriedades de famílias de estados quânticos e medições que atingem a CEZQ. É mostrado que a capacidade de um canal quântico num espaço de Hilbert de dimensão d pode sempre ser alcançada usando famílias compostas de, no máximo,d estados puros. Com relação às medições, demonstra-se que medições coletivas de von Neumann são necessárias e suficientes para alcançar a capacidade. É discutido se a CEZQ é uma generalização não trivial da capacidade erro-zero clássica. O termo não trivial refere-se a existência de canais quânticos para os quais a CEZQ só pode ser alcançada através de famílias de estados quânticos não-ortogonais e usando códigos de comprimento maior ou igual a dois. É investigada a CEZQ de alguns canais quânticos. É mostrado que o problema de calcular a CEZQ de canais clássicos-quânticos é puramente clássico. Em particular, é exibido um canal quântico para o qual conjectura-se que a CEZQ só pode ser alcançada usando uma família de estados quânticos não-ortogonais. Se a conjectura é verdadeira, é possível calcular o valor exato da capacidade e construir um código de bloco quântico que alcança a capacidade. Finalmente, é demonstrado que a CEZQ é limitada superiormente pela capacidade de Holevo-Schumacher-Westmoreland.
Monteiro, Fabio de Salles. "Protocolo de Identificação baseado em Polinômios Multivariáveis Quadráticos." Universidade de São Paulo, 2012. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-19032013-104154/.
Full textThe public-key cryptography widely used nowadays have their security based on the assumption of the intractability of the problems of integer factorization and discrete logarithm, both of which were proven unsafe in the advent of quantum computers. Cryptographic systems based on Multivariate Quadratic polynomials (MQ) are based on the MQ problem, which consists in solve a system of multivariate quadratic polynomials over a finite field. The MQ problem has been proven NP-complete and so far no polynomial time algorithm is known, not even quantum, which would resolve this problem, making worthwhile to be investigated and developed as a real candidate to provide post-quantum cryptography. In CRYPTO\'2011 Sakumoto, Shirai and Hiwatari introduced two new identification protocols based on multivariate quadratic polynomials, which we call MQID-3 and MQID-5, in particular, for the first time, their security is based only on the MQ problem. Using these proposals, we will present an improved version of the protocol MQID-3 that reduces communication by approximately 9%.
Chailloux, André. "Quantum coin flipping and bit commitment : optimal bounds, pratical constructions and computational security." Thesis, Paris 11, 2011. http://www.theses.fr/2011PA112121/document.
Full textQuantum computing allows us to revisit the study of quantum cryptographic primitives with information theoretic security. In 1984, Bennett and Brassard presented a protocol of quantum key distribution. In this protocol, Alice and Bob cooperate in order to share a common secret key k, which has to be unknown for a third party that has access to the communication channel. They showed how to perform this task quantumly with an information theoretic security; which is impossible classically.In my thesis, I study cryptographic primitives with two players that do not trust each other. I study mainly coin flipping and bit commitment. Classically, both these primitives are impossible classically with information theoretic security. Quantum protocols for these primitives where constructed where cheating players could cheat with probability stricly smaller than 1. However, Lo, Chau and Mayers showed that these primitives are impossible to achieve perfectly even quantumly if one requires information theoretic security. I study to what extent imperfect protocols can be done in this setting.In the first part, I construct a quantum coin flipping protocol with cheating probabitlity of 1/root(2) + eps for any eps > 0. This completes a result by Kitaev who showed that in any quantum coin flipping protocol, one of the players can cheat with probability at least 1/root(2). I also constructed a quantum bit commitment protocol with cheating probability 0.739 + eps for any eps > 0 and showed that this protocol is essentially optimal. I also derived some upper and lower bounds for quantum oblivious transfer, which is a universal cryptographic primitive.In the second part, I study some practical aspects related to these primitives. I take into account losses than can occur when measuring a quantum state. I construct a Quantum Coin Flipping and Quantum Bit Commitment protocols which are loss-tolerant and have cheating probabilities of 0.859. I also construct these primitives in the device independent model, where the players do not trust their quantum device. Finally, in the third part, I study these cryptographic primitives with information theoretic security. More precisely, I study the relationship between computational quantum bit commitment and quantum zero-knowledge protocols
Chailloux, Andre. "Quantum coin flipping and bit commitment : optimal bounds, pratical constructions and computational security." Phd thesis, Université Paris Sud - Paris XI, 2011. http://tel.archives-ouvertes.fr/tel-00607890.
Full textGherardini, Stefano. "Noise as a resource - Probing and manipulating classical and quantum dynamical systems via stochastic measurements." Doctoral thesis, 2018. http://hdl.handle.net/2158/1120060.
Full textBook chapters on the topic "Quantum Zeno protocols"
Chailloux, André, and Anthony Leverrier. "Relativistic (or 2-Prover 1-Round) Zero-Knowledge Protocol for $$\mathsf {NP}$$ Secure Against Quantum Adversaries." In Lecture Notes in Computer Science, 369–96. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-56617-7_13.
Full textChander, Bhanu. "The State-of-the-Art Cryptography Techniques for Secure Data Transmission." In Handbook of Research on Intrusion Detection Systems, 284–305. IGI Global, 2020. http://dx.doi.org/10.4018/978-1-7998-2242-4.ch014.
Full textZheng, Huijie, Arne Wickenbrock, Georgios Chatzidrosos, Lykourgos Bougas, Nathan Leefer, Samer Afach, Andrey Jarmola, et al. "Novel Magnetic-Sensing Modalities with Nitrogen-Vacancy Centers in Diamond." In Engineering Applications of Diamond. IntechOpen, 2021. http://dx.doi.org/10.5772/intechopen.95267.
Full textConference papers on the topic "Quantum Zeno protocols"
Monteiro, Fábio S., Denise Goya, and Routo Terada. "Aprimoramento de Protocolo de Identificação Baseado no Problema MQ." In Simpósio Brasileiro de Segurança da Informação e de Sistemas Computacionais. Sociedade Brasileira de Computação - SBC, 2012. http://dx.doi.org/10.5753/sbseg.2012.20537.
Full textNascimento, José, and Rubens Viana. "Quantum protocols for transference of proof of zero-knowledge systems." In XXV Simpósio Brasileiro de Telecomunicações. Sociedade Brasileira de Telecomunicações, 2007. http://dx.doi.org/10.14209/sbrt.2007.31231.
Full text