Thermodynamic Limits of Quantum Search

• URL: http://arxiv.org/abs/2603.13654v1
• Date: Fri, 13 Mar 2026 23:30:35 GMT
• Title: Thermodynamic Limits of Quantum Search
• Abstract summary: We find that a secret key of 831 bit length cannot be reconstructed deterministically in an expanding, dark-energy-dominated universe until star formation is expected to cease.<n>Applying this limit, we find that a secret key of 831 bit length cannot be reconstructed deterministically in an expanding, dark-energy-dominated universe until star formation is expected to cease.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Modern cryptography relies on keyed symmetric ciphers to ensure the secrecy and authenticity of high bandwidth data transfer. While the advent of quantum computers poses a challenge for public key cryptography, unbroken ciphers are considered safe against quantum attacks if their key is sufficiently long. However, concrete bounds on the required key length thus far remain elusive: Despite the well known asymptotic complexity of Grover's quantum search, the optimal algorithm to recover a secret key, no implementation-agnostic tight bounds were established. Here, we discuss the quantum thermodynamic limits of generic search algorithms, and find a work-runtime trade-off for autonomous computers with a fundamental lower bound. By devising an application-specific quantum protocol, which outperforms circuit and adiabatic implementations, and saturates this bound, we demonstrate that it is tight. Applying this limit, we find that a secret key of 831 bit length cannot be reconstructed deterministically in an expanding, dark-energy-dominated universe until star formation is expected to cease. Implications for post quantum cryptography, and quantum key distribution are discussed.

Related papers

• Quantum Homomorphic Encryption: Towards Practical and Private Computation on Untrusted Quantum Hardware [0.0]
  We propose a universal quantum homomorphic encryption framework developed from the Quantum One-Time Pad scheme.<n>Our approach maintains information-theoretic security and supports a broad class of quantum operations on encrypted quantum states.<n>This work takes a step toward bridging the gap between theoretical quantum homomorphic encryption and practical realization on near-term quantum hardware.
  arXiv  Detail & Related papers  (2026-04-21T09:20:08Z)
• Post-Quantum Cryptography from Quantum Stabilizer Decoding [40.84312119358882]
  Post-quantum cryptography currently rests on a small number of hardness assumptions.<n>We argue that decoding random quantum stabilizer codes is an excellent candidate.<n>We prove that the average-case hardness of quantum stabilizer decoding implies the core primitives of classical Cryptomania.
  arXiv  Detail & Related papers  (2026-03-19T16:35:31Z)
• The Hardness of Learning Quantum Circuits and its Cryptographic Applications [1.2116854758481395]
  We show that concrete hardness assumptions about learning or cloning the output state of a random quantum circuit can be used as the foundation for secure quantum cryptography.<n>We construct secure one-way state generators (OWSGs), digital signature schemes, quantum bit commitments, and private key encryption schemes.
  arXiv  Detail & Related papers  (2025-04-21T18:00:03Z)
• On the practicality of quantum sieving algorithms for the shortest vector problem [42.70026220176376]
  lattice-based cryptography is one of the main candidates of post-quantum cryptography.<n> cryptographic security against quantum attackers is based on lattice problems like the shortest vector problem (SVP)<n>Asymptotic quantum speedups for solving SVP are known and rely on Grover's search.
  arXiv  Detail & Related papers  (2024-10-17T16:54:41Z)
• Revocable Encryption, Programs, and More: The Case of Multi-Copy Security [48.53070281993869]
  We show the feasibility of revocable primitives, such as revocable encryption and revocable programs.<n>This suggests that the stronger notion of multi-copy security is within reach in unclonable cryptography.
  arXiv  Detail & Related papers  (2024-10-17T02:37:40Z)
• Efficient Quantum Pseudorandomness from Hamiltonian Phase States [41.94295877935867]
  We introduce a quantum hardness assumption called the Hamiltonian Phase State (HPS) problem.<n>We show that our assumption is plausibly fully quantum; meaning, it cannot be used to construct one-way functions.<n>We show that our assumption and its variants allow us to efficiently construct many pseudorandom quantum primitives.
  arXiv  Detail & Related papers  (2024-10-10T16:10:10Z)
• Quantum Query Lower Bounds for Key Recovery Attacks on the Even-Mansour Cipher [0.0]
  Even-Mansour (EM) cipher is one of the famous constructions for a block cipher. Kuwakado and Morii demonstrated that a quantum adversary can recover its $n$-bit secret keys only with $O(n)$ nonadaptive quantum queries.
  arXiv  Detail & Related papers  (2023-08-21T02:01:30Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Revocable Cryptography from Learning with Errors [61.470151825577034]
  We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities. We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
  arXiv  Detail & Related papers  (2023-02-28T18:58:11Z)
• Quantum Cryptography: Quantum Key Distribution, a Non-technical Approach [0.0]
  Quantum mechanics provides means to create an inherently secure communication channel that is protected by the laws of physics. This paper is a non-technical overview of quantum key distribution, a type of cryptography poised to exploit the laws of quantum mechanics directly.
  arXiv  Detail & Related papers  (2022-11-09T15:30:23Z)
• A quantum encryption design featuring confusion, diffusion, and mode of operation [0.0]
  We propose a non-OTP quantum encryption scheme utilizing a quantum state creation process to encrypt messages. As essentially a non-OTP quantum block cipher the method stands out against existing methods with the following features.
  arXiv  Detail & Related papers  (2020-10-06T22:23:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.