Corpus ID: 237941131

Quantum Money from Quaternion Algebras

@article{Kane2021QuantumMF,
  title={Quantum Money from Quaternion Algebras},
  author={Daniel M. Kane and Shahed Sharif and Alice Silverberg},
  journal={ArXiv},
  year={2021},
  volume={abs/2109.12643}
}
We propose a new idea for public key quantum money. In the abstract sense, our bills are encoded as a joint eigenstate of a fixed system of commuting unitary operators. We perform some basic analysis of this black box system and show that it is resistant to black box attacks. In order to instantiate this protocol, one needs to find a cryptographically complicated system of computable, commuting, unitary operators. To fill this need, we propose using Brandt operators acting on the Brandt modules… Expand

Tables from this paper

References

SHOWING 1-10 OF 39 REFERENCES
Quantum money from hidden subspaces
TLDR
The first quantum money scheme that is (1) public-key---meaning that anyone can verify a banknote as genuine, not only the bank that printed it, and (2) cryptographically secure, under a "classical" hardness assumption that has nothing to do with quantum money is proposed. Expand
Quantum money from knots
TLDR
This work presents a concrete quantum money scheme based on superpositions of diagrams that encode oriented links with the same Alexander polynomial and expects the scheme to be secure against computationally bounded adversaries. Expand
Quantum cryptanalysis of hash and claw-free functions
TLDR
A quantum algorithm that finds collisions in arbitrary functions after only O(3√N/τ) expected evaluations of the function, more efficient than the best possible classical algorithm, even allowing probabilism. Expand
Quantum lower bounds by polynomials
TLDR
This work examines the number of queries to input variables that a quantum algorithm requires to compute Boolean functions on {0,1}N in the black-box model and gives asymptotically tight characterizations of T for all symmetric f in the exact, zero-error, and bounded-error settings. Expand
Quantum Lightning Never Strikes the Same State Twice
  • Mark Zhandry
  • Computer Science, Physics
  • IACR Cryptol. ePrint Arch.
  • 2017
TLDR
This work investigates quantum lightning, a formalization of "collision-free quantum money" defined by Lutomirski et al, and shows that instantiating the quantum money scheme of Aaronson and Christiano with indistinguishability obfuscation that is secure against quantum computers yields a secure quantumMoney scheme. Expand
Quantum state restoration and single-copy tomography for ground states of Hamiltonians.
TLDR
It is shown that if you know the Hamiltonian of a system and have a single copy of its ground state, you can use a quantum computer to efficiently compute its local properties. Expand
On maximal orders of division quaternion algebras over the rational number field with certain optimal embeddings
In this paper, we shall give explicit Z-basis of certain maximal orders of definite quaternion algebras over the rational number field Q (See Theorems below). We shall also give some remarks onExpand
Identifying the Matrix Ring: Algorithms for Quaternion Algebras and Quadratic Forms
We discuss the relationship between quaternion algebras and quadratic forms with a focus on computational aspects. Our basic motivating problem is to determine if a given algebra of rank 4 over aExpand
Quantum algorithm for linear systems of equations.
TLDR
This work exhibits a quantum algorithm for estimating x(-->)(dagger) Mx(-->) whose runtime is a polynomial of log(N) and kappa, and proves that any classical algorithm for this problem generically requires exponentially more time than this quantum algorithm. Expand
of quaternion algebras
The additive identity is (0, 0), the multiplicative identity is (1, 0), and from addition and scalar multiplication of real vectors we have (a, b) = (a, 0) + (0, b) = a(1, 0) + b(0, 1), which looksExpand
...
1
2
3
4
...