Academic literature on the topic 'Quantum money'
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 money.'
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 money"
Aaronson, Scott, Edward Farhi, David Gosset, Avinatan Hassidim, Jonathan Kelner, and Andrew Lutomirski. "Quantum money." Communications of the ACM 55, no. 8 (August 2012): 84–92. http://dx.doi.org/10.1145/2240236.2240258.
Full textMullins, Justin. "Quantum money: note perfect." New Scientist 206, no. 2756 (April 2010): 40–43. http://dx.doi.org/10.1016/s0262-4079(10)60953-0.
Full textHorodecki, Karol, and Maciej Stankiewicz. "Semi-device-independent quantum money." New Journal of Physics 22, no. 2 (February 5, 2020): 023007. http://dx.doi.org/10.1088/1367-2630/ab6872.
Full textNagaj, Daniel, Or Sattath, Aharon Brodutch, and Dominique Unruh. "An adaptive attack on Wiesner's quantum money." Quantum Information and Computation 16, no. 11&12 (September 2016): 1048–70. http://dx.doi.org/10.26421/qic16.11-12-7.
Full textCrease, Robert P. "Quantum investment." Physics World 36, no. 10 (October 1, 2023): 21–22. http://dx.doi.org/10.1088/2058-7058/36/10/22.
Full textOrrell, David. "The value of value: A quantum approach to economics, security and international relations." Security Dialogue 51, no. 5 (February 27, 2020): 482–98. http://dx.doi.org/10.1177/0967010620901910.
Full textColadangelo, Andrea, and Or Sattath. "A Quantum Money Solution to the Blockchain Scalability Problem." Quantum 4 (July 16, 2020): 297. http://dx.doi.org/10.22331/q-2020-07-16-297.
Full textHayes, J. "Quantum on the money [quantum computing in financial services sector]." Engineering & Technology 14, no. 4 (May 1, 2019): 34–37. http://dx.doi.org/10.1049/et.2019.0401.
Full textSelby, John H., and Jamie Sikora. "How to make unforgeable money in generalised probabilistic theories." Quantum 2 (November 2, 2018): 103. http://dx.doi.org/10.22331/q-2018-11-02-103.
Full textHirawan, Fajar Bambang. "EFEKTIVITAS QUANTUM CHANNEL DALAM MEKANISME TRANSMIS! KEBIJAKAN MONETER: STUDI KASUS INDONESIA TAHUN 1993 -2005." Jurnal Ekonomi dan Pembangunan Indonesia 7, no. 2 (January 1, 2007): 179–98. http://dx.doi.org/10.21002/jepi.v7i2.162.
Full textDissertations / Theses on the topic "Quantum money"
Lutomirski, Andrew (Andrew Michael). "Quantum money and scalable 21-cm cosmology." Thesis, Massachusetts Institute of Technology, 2011. http://hdl.handle.net/1721.1/77251.
Full textThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (p. 165-170).
This thesis covers two unrelated topics. The first part of my thesis is about quantum money, a cryptographic protocol in which a mint can generate a quantum state that no one can copy. In public-key quantum money, anyone can verify that a given quantum state came from the mint, and in collision-free quantum money, even the mint cannot generate two valid quantum bills with the same serial number. I present quantum state restoration, a new quantum computing technique that can be used to counterfeit several designs for quantum money. I describe a few other approaches to quantum money, one of which is published, that do not work. I then present a technique that seems to be secure based on a new mathematical object called a component mixer, and I give evidence money using this technique is hard to counterfeit. I describe a way to implement a component mixer and the corresponding quantum money using techniques from knot theory. The second part of my thesis is about 21-cm cosmology and the Fast Fourier transform telescope. With the FFT telescope group at MIT, I worked on a design for a radio telescope that operates between 120 and 200 MHz and will scale to an extremely large number of antennas N. We use an aperture synthesis technique based on Fast Fourier transforms with computational costs proportional toN logN instead of N2. This eliminates the cost of computers as the main limit on the size of a radio interferometer. In this type of telescope, the cost of each antenna matters regardless of how large the telescope becomes, so we focus on reducing the cost of each antenna as much as possible. I discuss the FFT aperture synthesis technique and its equivalence to standard techniques on an evenly spaced grid. I describe analog designs that can reduce the cost per antenna. I give algorithms to analyze raw data from our telescope to help debug and calibrate its components, with particular emphasis on cross-talk between channels and I/Q imbalance. Finally, I present a scalable design for a computer network that can solve the corner-turning problem.
by Andrew Lutomirski.
Ph.D.
Bozzio, Mathieu. "Security and implementation of advanced quantum cryptography : quantum money and quantum weak coin flipping." Electronic Thesis or Diss., Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLT045.
Full textHarnessing the laws of quantum theory can drastically boost the security of modern communication networks, from public key encryption to electronic voting and online banking. In this thesis, we bridge the gap between theory and experiment regarding two quantum-cryptographic tasks: quantum money and quantum weak coin flipping. Quantum money exploits the no-cloning property of quantum physics to generate unforgeable tokens, banknotes, and credit cards. We provide the first proof-of-principle implementation of this task, using photonic systems at telecom wavelengths. We then develop a practical security proof for quantum credit card schemes, in which the bank can remotely verify a card even in the presence of a malicious payment terminal. We finally propose a setup for secure quantum storage of the credit card, using electromagnetically-induced transparency in a cloud of cold cesium atoms. Quantum weak coin flipping is a fundamental cryptographic primitive, which helps construct more complex tasks such as bit commitment and multiparty computation. It allows two distant parties to flip a coin when they both desire opposite outcomes. Using quantum entanglement then prevents any party from biasing the outcome of the flip beyond a certain probability. We propose the first implementation for quantum weak coin flipping, which requires a single photon and linear optics only. We provide the complete security analysis in the presence of noise and losses, and show that the protocol is implementable on the scale of a small city with current technology. We finally propose a linear-optical extension of the protocol to lower the coin bias
Lin, Han-Hsuan. "Topics in quantum algorithms : adiabatic algorithm, quantum money, and bomb query complexity." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/99300.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (pages 111-115).
In this thesis, I present three results on quantum algorithms and their complexity. The first one is a numerical study on the quantum adiabatic algorithm( QAA) . We tested the performance of the QAA on random instances of MAX 2-SAT on 20 qubits and showed 3 strategics that improved QAA's performance, including a counter intuitive strategy of decreasing the overall evolution time. The second result is a security proof for the quantum money by knots proposed by Farhi et. al. We proved that quantum money by knots can not be cloned in a black box way unless graph isomorphism is efficiently solvable by a quantum computer. Lastly we defined a modified quantum query model, which we called bomb query complexity B(J), inspired by the Elitzur-Vaidman bomb-testing problem. We completely characterized bomb query complexity be showing that B(f) = [Theta](Q(f)2 ). This result implies a new method to find upper bounds on quantum query complexity, which we applied on the maximum bipartite matching problem to get an algorithm with O(n1.75) quantum query complexity, improving from the best known trivial O(n2 ) upper bound.
by Han-Hsuan Lin.
Ph. D.
Ghorai, Shouvik. "Continuous-variable quantum cryptographic protocols." Electronic Thesis or Diss., Sorbonne université, 2021. https://accesdistant.sorbonne-universite.fr/login?url=https://theses-intra.sorbonne-universite.fr/2021SORUS007.pdf.
Full textThis thesis is concerned with the study and analysis of two quantum cryptographic protocols: quantum key distribution (QKD) and unforgeable quantum money in the continuous-variable (CV) framework. The main advantage of CV protocols is that their implementation only requires standard telecom components. QKD allows two distant parties, Alice and Bob, to establish a secure key, even in the presence of an eavesdropper, Eve. The remarkable property of QKD is that its security can be established in the information-theoretic setting, without appealing to any computational assumptions. Proving the security of CV-QKD protocols is challenging since the protocols are described in an infinite-dimensional Fock space. One of the open questions in CV-QKD was establishing security for two-way QKD protocols against general attacks. We exploit the invariance of Unitary group U(n) of the protocol to establish composable security against general attacks. We answer another pressing question in the field of CV-QKD with a discrete modulation by establishing the asymptotic security of such protocols against collective attacks. We provide a general technique to derive a lower bound on the secret key rate by formulating the problem as a semidefinite program. Quantum money exploits the no-cloning property of quantum mechanics to generate unforgeable tokens, banknotes, and credit cards. We propose a CV private-key quantum money scheme with classical verification. The motivation behind this protocol is to facilitate the process of practical implementation. Previous classical verification money schemes use single-photon detectors for verification, while our protocols use coherent detection
Mamann, Hadriel. "Cold-atomic ensemble implemented as an efficient optical quantum memory layer in a cryptographic protocol." Electronic Thesis or Diss., Sorbonne université, 2024. https://accesdistant.sorbonne-universite.fr/login?url=https://theses-intra.sorbonne-universite.fr/2024SORUS120.pdf.
Full textCombining cryptographic protocols with quantum memories is an important step for quantum network development in order to establish secure communications where information can be stored and retrieved on demand. One possible use case of these networks is to perform authenticated transactions synchronized by the use of memories. However, the losses and noise added by storage devices can be exploited by dishonest agents to hide their cheating attempts. The constraints to operate in a secure regime are thus very demanding in terms of memory efficiency and fidelity. This thesis focuses on the implementation of a cold-atomic ensemble used as an EIT-based quantum memory in a cryptographic protocol. The key ingredients to optimize the storage-and-retrieval efficiency and the method employed to mitigate the decoherence sources are detailed. This work reports the first demonstration of the unforgeable quantum money including an intermediate quantum memory layer, taking advantage of our highly-efficient and low-noise storage platform. The next step would be to spatially multiplex the atomic cloud in order to store the whole sequence of random qubits at once. In this scenario, the multimode capacity of our memory has been numerically simulated using two different spatial multiplexing techniques
Cantoario, Diego Martinez Fervenza. "A execução por quantia certa em face dos entes públicos: um estudo sob a perspectiva do direito a execução das decisões judiciais." Universidade do Estado do Rio de Janeiro, 2011. http://www.bdtd.uerj.br/tde_busca/arquivo.php?codArquivo=3352.
Full textEste estudo tem como objetivo analisar a disciplina da execução por quantia certa contra os entes públicos no Direito brasileiro e sua compatibilidade com o direito à execução das decisões judiciais. Inicialmente, buscou-se definir o conteúdo do direito à execução das decisões judiciais. Posteriormente, foi analisado o direito francês, com o escopo de comparar esse sistema com o vigente no Brasil. Também foram objeto de nossa análise os fundamentos da execução contra os entes públicos, como a igualdade, separação de poderes, impenhorabilidade dos bens públicos e interesse público, tendo concluído que apenas o primeiro é idôneo à justificar a ausência de poderes sub-rogatórios do juiz sobre o patrimônio estatal. Por fim, analisamos as regras que compõem a execução contra os entes públicos no Brasil, em especial aquelas introduzidas pela Emenda Constitucional n. 62 de 2009. Estes dispositivos, em sua maioria, são violadores do direito à execução das decisões judiciais, na medida em que não permitem o cumprimento das sentenças em um tempo razoável, como ocorre com o art. 97, 1, do ADCT.
This study aims to provide the introduction of the execution of money judgments against the government in Brazil and its compatibility with the right of enforcement. At first, the paper focus on the content of the right of enforcement. Then, was analyzed the french law, with the target to compare this system with the effective one in Brazil. Also the theorical background of the enforcement of judicial sentences against the government through precatórios had been object of our analysis, as the equality, separation of powers, immunities and public interest, having concluded that only the first one is idoneous to justifying the absence of direct means of enforcement against public property. Finally, we analyze the rules of the execution against the government in Brazil, in special those introduced by the constitutional amendment n. 62 of 2009. These devices, in its majority, violate the right of enforcement, because they do not allow the fulfillment of the judgments in a reasonable time, as it occurs with art. 97, 1, of the ADCT.
Bradley, Michelle. "What does it mean to be a “monkey-bird"?: mixed-race students’ educational experiences in the Manitoban K-12 public education system and their sense of identity." 2017. http://hdl.handle.net/1993/32031.
Full textFebruary 2017
Books on the topic "Quantum money"
Smith, Fred J., and Nicola Penchev. Quantum Money: A web-based system of money and credit. CreateSpace Independent Publishing Platform, 2015.
Find full textOrrell, David. Quantum Economics: The New Science of Money. Icon Books, Limited, 2018.
Find full textOrrell, David. Quantum Economics: The new science of money. 2018.
Find full textPrinciple, Carnegie. Quantum Field Millionaire: The Energy of Money. Independent Publisher, 2018.
Find full textQuantum Economics: The New Science of Money. Icon Books, Limited, 2019.
Find full textCencini, Alvaro, Sergio Rossi, and Jean-Luc Bailly. Quantum Macroeconomics. Taylor & Francis Group, 2018.
Find full textCencini, Alvaro, Sergio Rossi, and Jean-Luc Bailly. Quantum Macroeconomics: The Legacy of Bernard Schmitt. Taylor & Francis Group, 2016.
Find full textCencini, Alvaro, Sergio Rossi, and Jean-Luc Bailly. Quantum Macroeconomics: The Legacy of Bernard Schmitt. Taylor & Francis Group, 2016.
Find full textMoney, Income and Time: A Quantum-Theoretical Approach. Bloomsbury Publishing Plc, 2013.
Find full textCencini, Alvaro. Money, Income and Time: A Quantum-Theoretical Approach. Bloomsbury Publishing Plc, 2013.
Find full textBook chapters on the topic "Quantum money"
Roberts, Bhaskar, and Mark Zhandry. "Franchised Quantum Money." In Lecture Notes in Computer Science, 549–74. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-92062-3_19.
Full textHughes, Ciaran, Joshua Isaacson, Anastasia Perry, Ranbel F. Sun, and Jessica Turner. "Quantum Cryptography." In Quantum Computing for the Quantum Curious, 41–48. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-61601-4_5.
Full textCencini, Alvaro. "The building blocks of a theory of national money." In Bernard Schmitt's Quantum Macroeconomic Analysis, 50–70. London: Routledge, 2022. http://dx.doi.org/10.4324/9781351271325-5.
Full textLiu, Jiahui, Hart Montgomery, and Mark Zhandry. "Another Round of Breaking and Making Quantum Money:." In Advances in Cryptology – EUROCRYPT 2023, 611–38. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30545-0_21.
Full textMolina, Abel, Thomas Vidick, and John Watrous. "Optimal Counterfeiting Attacks and Generalizations for Wiesner’s Quantum Money." In Theory of Quantum Computation, Communication, and Cryptography, 45–64. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-35656-8_4.
Full textCencini, Alvaro. "The discovery of the true nature of money and the origin of its purchasing power." In Bernard Schmitt's Quantum Macroeconomic Analysis, 27–49. London: Routledge, 2022. http://dx.doi.org/10.4324/9781351271325-4.
Full textPena, Marta Conde, Jean-Charles Faugère, and Ludovic Perret. "Algebraic Cryptanalysis of a Quantum Money Scheme The Noise-Free Case." In Lecture Notes in Computer Science, 194–213. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-46447-2_9.
Full textAnanth, Prabhanjan, Zihan Hu, and Henry Yuen. "On the (Im)plausibility of Public-Key Quantum Money from Collision-Resistant Hash Functions." In Advances in Cryptology – ASIACRYPT 2023, 39–72. Singapore: Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-99-8742-9_2.
Full textBitzinger, Richard A., and Michael Raska. "Chinese and Russian Military Modernization and the Fourth Industrial Revolution." In Russia-China Relations, 121–40. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-97012-3_7.
Full text"Quantum Money." In Introduction to Quantum Cryptography, 78–98. Cambridge University Press, 2023. http://dx.doi.org/10.1017/9781009026208.003.
Full textConference papers on the topic "Quantum money"
Radian, Roy, and Sattath. "Semi-Quantum Money." In AFT '19: 1st ACM Conference on Advances in Financial Technologies. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3318041.3355462.
Full textHorgan, Jerry, Hazel Murray, David Malone, and Deirdre Kilbane. "Quantum Money Scheme." In NANOCOM '21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3477206.3477475.
Full textAaronson, Scott. "Quantum Copy-Protection and Quantum Money." In 2009 24th Annual IEEE Conference on Computational Complexity (CCC). IEEE, 2009. http://dx.doi.org/10.1109/ccc.2009.42.
Full textFarhi, Edward, David Gosset, Avinatan Hassidim, Andrew Lutomirski, and Peter Shor. "Quantum money from knots." In the 3rd Innovations in Theoretical Computer Science Conference. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2090236.2090260.
Full textGavinsky, Dmitry. "Quantum money with classical verification." In INTERNATIONAL CONFERENCE ON QUANTITATIVE SCIENCES AND ITS APPLICATIONS (ICOQSIA 2014): Proceedings of the 3rd International Conference on Quantitative Sciences and Its Applications. AIP Publishing LLC, 2014. http://dx.doi.org/10.1063/1.4903116.
Full textGavinsky, Dmitry. "Quantum Money with Classical Verification." In 2012 IEEE Conference on Computational Complexity (CCC). IEEE, 2012. http://dx.doi.org/10.1109/ccc.2012.10.
Full textAaronson, Scott, and Paul Christiano. "Quantum money from hidden subspaces." In the 44th symposium. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2213977.2213983.
Full textMishra, Shashank, Akshat Ojha, Archit Aggarwal, and Pawan Singh Mehra. "Quantum Money : Opportunities, Challenges and Open Issues." In 2023 8th International Conference on Communication and Electronics Systems (ICCES). IEEE, 2023. http://dx.doi.org/10.1109/icces57224.2023.10192676.
Full textMamann, Hadriel, Thomas Nieddu, Mathieu Bozzio, Félix Hoffet, Félix Garreau de Loubresse, Eleni Diamanti, Alban Urvoy, and Julien Laurat. "Quantum cryptographic protocol implementation using a highly-efficient cold-atom-based quantum memory." In CLEO: Fundamental Science. Washington, D.C.: Optica Publishing Group, 2023. http://dx.doi.org/10.1364/cleo_fs.2023.ff2a.3.
Full textTsiatsios, Georgios Alkis, Evangelos Melas, Costas Poulios, and John Leventides. "Understanding Money Distribution in Closed Economic Systems: A Graph Theoretical Approach with Quantum Random Walks." In 2023 5th International Conference on Industrial Artificial Intelligence (IAI). IEEE, 2023. http://dx.doi.org/10.1109/iai59504.2023.10327576.
Full text