Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Princeton University Press eBooks

3. Enter the quantum

A. Zee

Published Oct 11, 2022• 0 citations
Publisher
DOI
10.1515/9780691239279-012

Related papers

Enter the quantum

Princeton University Press eBooks•Jan 17, 2023•0 citations

Macroscopic Quantum States: When Macroscopic Objects Enter Quantum Superposition

Runbiao Fang

Macroscopic Quantum States: When Macroscopic Objects Enter Quantum Superposition

•Jan 1, 2026•0 citations

Creating the Quantum

Michael Hartley Freedman

•Jan 1, 2009•0 citations

XIX INTERNATIONAL FALL WORKSHOP ON GEOMETRY AND PHYSICS

Carlos Herdeiro, Roger Picken

I review how geometry enters probability theory, and how it enters quantum mechanics. The logic is similar in both cases, but the latter case is richer and more interesting.

•Jul 1, 2011•0 citations

Scheme for Entering Binary Data Into a Quantum Computer

Colin P. Williams

A quantum algorithm provides for the encoding of an exponentially large number of classical data bits by use of a smaller (polynomially large) number of quantum bits (qubits). The development of this algorithm was prompted by the need, heretofore not satisfied, for a means of entering real-world binary data into a quantum computer. The data format provided by this algorithm is suitable for subsequent ultrafast quantum processing of the entered data. Potential applications lie in disciplines (e.g., genomics) in which one needs to search for matches between parts of very long sequences of data. For example, the algorithm could be used to encode the N-bit-long human genome in only log2N qubits. The resulting log2N-qubit state could then be used for subsequent quantum data processing - for example, to perform rapid comparisons of sequences.

•Mar 1, 2005•0 citations

The Quantum Conundrum

The MIT Press eBooks•Nov 18, 2025•0 citations
A quantum algorithm provides for the encoding of an exponentially large number of classical data bits by use of a smaller (polynomially large) number of quantum bits (qubits). The development of this algorithm was prompted by the need, heretofore not satisfied, for a means of entering real-world binary data into a quantum computer. The data format provided by this algorithm is suitable for subsequent ultrafast quantum processing of the entered data. Potential applications lie in disciplines (e.g., genomics) in which one needs to search for matches between parts of very long sequences of data. For example, the algorithm could be used to encode the N-bit-long human genome in only log2N qubits. The resulting log2N-qubit state could then be used for subsequent quantum data processing - for example, to perform rapid comparisons of sequences.