Filters








317 Hits in 6.5 sec

An Invitation to Tensor-Triangular Geometry

Paul Balmer
2017 Notices of the American Mathematical Society  
Embark on a playful mathematical tour, aided by Lisl Gaal's illustrations of familiar scenes and whimsical triggers for the imagination.  ...  This is a book to read and revisit, gaining new insights each time. 2017; 64 pages; Softcover; ISBN: 978-1-4704-4159-  ...  Ruth Charney, Brandeis University, Searching for Hyperbolicity. C y n t h i a D w o r k , H a r v a r d U n i v e r s i t y , Privavy in the Land of Plenty (AMS Josiah Willard Gibbs Lecture).  ... 
doi:10.1090/noti1594 fatcat:ciebsoei5faltj5zoyfg3ewlfi

Quantum Information Science

Melanie Swan, Renato P. Dos Santos, Frank Witte
2021 IEEE Internet Computing  
Quantum computing is implicated as a next-generation solution to supplement traditional von Neumann architectures in an era of post-Moore's law computing.  ...  This paper discusses emerging applications in quantum cryptography, quantum machine learning, quantum finance, quantum neuroscience, quantum networks, and quantum error correction.  ...  The mainstay application for post-quantum cryptography is quantum key distribution on global networks.  ... 
doi:10.1109/mic.2021.3132591 fatcat:ll3pdgqsqrdmngegbhuon7uree

Quantum Computing: A Taxonomy, Systematic Review and Future Directions [article]

Sukhpal Singh Gill, Adarsh Kumar, Harvinder Singh, Manmeet Singh, Kamalpreet Kaur, Muhammad Usman, Rajkumar Buyya
2021 arXiv   pre-print
A detailed overview of quantum software tools and technologies, post-quantum cryptography and quantum computer hardware development to document the current state-of-the-art in the respective areas.  ...  We finish the article by highlighting various open challenges and promising future directions for research.  ...  [19] proposed a survey on post-quantum lattice-based cryptography implementations, which is just one type of post-quantum cryptography.  ... 
arXiv:2010.15559v4 fatcat:y6cuttww5fd5jdmvcer352lh4e

Quantum-Resistant Network for Classical Client Compatibility

Te-Yuan Lin, Chiou-Shann Fuh
2021 Information Technology and Control  
on top of computational security are not quantum-safe.  ...  Because the time-complexity of the exhaustive keysearch for quantum computing has not reliably exceeded the reasonable expiry of crypto key validity, it is believedthat current cryptography systems built  ...  Acknowledgement We sincerely thank National Taiwan University-IBM Q Hub, who sponsored the state-of-the-art quantum computers and application interfaces to contribute this research as a great testing platform  ... 
doi:10.5755/j01.itc.50.2.27570 fatcat:o54oxyae75cydoiuyf6kf2esua

Witworld: A generalised probabilistic theory featuring post-quantum steering [article]

Paulo J. Cavalcanti, John H. Selby, Jamie Sikora, Thomas D. Galley, Ana Belén Sainz
2021 arXiv   pre-print
We further show post-quantum steering to be the source of this advantage, and hence present the first instance where post-quantum steering is a stronger-than-quantum resource for information processing  ...  We introduce Witworld: a generalised probabilistic theory with strong post-quantum features, which subsumes Boxworld.  ...  POST-QUANTUM ADVANTAGE FOR INFORMATION PROCESSING Post-quantum resources may outperform quantum ones for information processing tasks [13, 16, 17, 43, 56, 57] .  ... 
arXiv:2102.06581v1 fatcat:rwkx5jtsi5d2ld2fbdkgya3rzu

Quantum Learning Algorithms and Post-Quantum Cryptography [article]

Alexander Poremba
2018 arXiv   pre-print
We turn to post-quantum cryptography and investigate attacks in which an adversary is given quantum access to a classical encryption scheme.  ...  In this work, we give an overview of recent quantum speed-ups, revisit the Bernstein-Vazirani algorithm in a new learning problem extension over an arbitrary cyclic group and discuss applications in cryptography  ...  Finally, for further reading on the current status of post-quantum cryptography, we refer to a recent article by Bernstein and Lange [BL17].  ... 
arXiv:1712.09289v3 fatcat:fgntrmtmjzbctj6zltsby2ye6q

Post-Quantum Cryptography [chapter]

Qijun Gu, Pascal Paillier, Tanja Lange, Edlyn Teske, Darrel Hankerson, Alfred Menezes, David Zhang, Feng Yue, Wangmeng Zuo, Jean-Jacques Quisquater, Gildas Avoine, Gerald Brose (+73 others)
2011 Encyclopedia of Cryptography and Security  
The speakers and the audience agreed that post-quantum cryptography is a fascinating research challenge and that, if large quantum computers are built, post-quantum cryptography will be critical for the  ...  The first editor would like to additionally thank Tanja Lange for many illuminating discussions regarding post-quantum cryptography and for initiating the Post-Quantum Cryptography workshop series in the  ...  Acknowledgements We thank Phong Nguyen and Markus Rückert for helpful discussions on the practical security of lattice-based cryptography.  ... 
doi:10.1007/978-1-4419-5906-5_386 fatcat:ucdkilta7zc3voq7nqctmjkcr4

Quantum Technology for Military Applications [article]

Michal Krelina
2021 arXiv   pre-print
This report provides a basic overview of quantum technologies under development, also estimating the expected time scale of delivery or the utilisation impact.  ...  Quantum technologies for military applications introduce new capabilities, improving effectiveness and increasing precision, thus leading to 'quantum warfare', wherein new military strategies, doctrines  ...  Acknowledgement The author is very grateful for several comments and feedback on the draft, especially by Dr Katarzyna Kubiak, Dr Jürgen Altmann and others.  ... 
arXiv:2103.12548v2 fatcat:wfoyemxkvzgg5pbt6btzkl4jjy

The Hidden Subgroup Problem for Generalized Quaternions

Julia T. Upton
2010 2010 Fourth International Conference on Quantum, Nano and Micro Technologies  
In this dissertation, a quantum algorithm that solves the hidden subgroup problem over the generalized quaternion group is developed.  ...  The hidden subgroup problem is a pivotal problem in quantum computation since it reflects the structure of tasks for which quantum algorithms significantly outperform classical algorithms.  ...  It follows from linearity that the action of a gate is completely specified by its action on the computational basis {|0 , |1 }.  ... 
doi:10.1109/icqnm.2010.23 fatcat:myllmmjfm5gcfcqe6wlfrn6gh4

Quantum communication using a bounded-size quantum reference frame

Stephen D Bartlett, Terry Rudolph, Robert W Spekkens, Peter S Turner
2009 New Journal of Physics  
We assume that the token is prepared in a special state that has particularly nice group-theoretic properties and that is near-optimal for transmitting information about the sender's frame.  ...  Indeed, if the receiver only possesses a bounded-size quantum token of the sender's reference frame, then the decoding is imperfect, and we can describe this effect as a noisy quantum channel.  ...  Boileau, Matthias Christandl and Renato Renner for helpful discussions. SDB acknowledges the support of the Australian Research Council. PST acknowledges the support of the AIF, iCORE, and MITACS.  ... 
doi:10.1088/1367-2630/11/6/063013 fatcat:bpiesf75cvcuzigzjgu43djoqq

Predicting Many Properties of a Quantum System from Very Few Measurements [article]

Hsin-Yuan Huang, Richard Kueng, John Preskill
2020 arXiv   pre-print
We present an efficient method for constructing an approximate classical description of a quantum state using very few measurements of the state.  ...  Predicting properties of complex, large-scale quantum systems is essential for developing quantum technologies.  ...  The Institute for Quantum Information and Matter is an NSF Physics Frontiers Center.  ... 
arXiv:2002.08953v2 fatcat:qkay6ocfdrcdflohkb4kw362kq

Quantum technology for military applications

Michal Krelina
2021 EPJ Quantum Technology  
This report provides a basic overview of quantum technologies under development, also estimating the expected time scale of delivery or the utilisation impact.  ...  Quantum technologies for military applications introduce new capabilities, improving effectiveness and increasing precision, thus leading to 'quantum warfare', wherein new military strategies, doctrines  ...  Acknowledgements The author is very grateful for several comments and feedback on the draft, especially by Dr Katarzyna Kubiak, Dr Jürgen Altmann and others.  ... 
doi:10.1140/epjqt/s40507-021-00113-y fatcat:3nuu3r5jwjaade4ck2srxjaahm

Conical Designs and Categorical Jordan Algebraic Post-Quantum Theories [article]

Matthew A. Graydon
2017 arXiv   pre-print
In posting this thesis on the arXiv, we hope that it might serve as a useful resource for those interested in its subjects.  ...  of positive semi-definite linear endomorphisms on finite dimensional complex Hilbert spaces.  ...  The tensor product of linear functions f : V −→ V and g : W −→ W , denoted f ⊗ g, is defined via the linear extension of its action on pure tensors, i.e. f ⊗ g : V ⊗ W −→ V ⊗ W :: v ⊗ w −→ f (v) ⊗ g(w)  ... 
arXiv:1703.06800v1 fatcat:k6v2ium6sfgjng5zdafgfbjgjq

From Information Theory Puzzles in Deletion Channels to Deniability in Quantum Cryptography [article]

Arash Atashpendar
2020 arXiv   pre-print
We relate deniability to fundamental concepts in quantum information theory and suggest a generic approach based on entanglement distillation for achieving information-theoretic deniability, followed by  ...  From the output produced by a memoryless deletion channel with a uniformly random input of known length n, one obtains a posterior distribution on the channel input.  ...  Wilde and Ignatius William Primaatmaja for their comments. Further Applications of Covert Communication for Deniability  ... 
arXiv:2003.11663v1 fatcat:7ul4q6mupjcyzfyspus6xwh2ai

Inaccessible entanglement in symmetry protected topological phases [article]

Caroline de Groot, David T. Stephen, Andras Molnar, Norbert Schuch
2020 arXiv   pre-print
We derive a tight bound on E_inacc which demonstrates a direct relation between inaccessible entanglement and the SPT phase, namely log(D_ω^2) ≤ E_inacc≤log(|G|), where D_ω is the topologically protected  ...  More precisely, we consider the setting of local operations and classical communication (LOCC) where the local operations commute with a global onsite symmetry group G, which we call G-LOCC, and we define  ...  We would like to thank Nick Bultinck, David Sauerwein, and Frank Verstraete for insightful discussions and  ... 
arXiv:2003.06830v1 fatcat:ocblsrfpwzdrbikwdy22fpceki
« Previous Showing results 1 — 15 out of 317 results