Tarun Chitra: Quantum Money Is The Next Frontier For Digital Assets (Full Interview)
Monday, 26 October 2026 · 2 min read · Listen to the episode ↗
Tarun Chitra explores quantum money as a potential frontier for digital assets, using uncopyable quantum states to create private, single-use identity keys—a proposal that depends on quantum computers and remains prospective. He also argues that in an AI-heavy world, blockchains may matter more as a hard-to-forge safety net for identity and asset transfers than as a “world computer,” with computation happening off-chain when its results can be verified.
Tarun Chitra sees blockchains as potentially more valuable in an AI-heavy world as a public, hard-to-forge safety net for identity and asset transfers than as a “world computer.” Computation need not happen on-chain if its results can be verified, he argues; security may matter more than maximizing throughput. A shared computing environment can also create permission and context problems, so placing every application’s computation on one public system is not necessarily an advantage.
Agentic coding could change how applications use roll-ups, Chitra says. Software agents might create a roll-up when an application needs one and discard it afterward, rather than maintaining persistent state indefinitely. That flexibility comes with a cost: shutting down a roll-up can be expensive when demand is too low to support it. The benefit therefore depends on whether temporary, application-specific infrastructure is worth those costs.
Chitra identifies quantum money as a possible next frontier for digital assets. The idea, described by Stephen Wiesner in 1974 and revisited in later decades, uses a quantum state as a secret key. In a smart-contract setting, private information—likened to an analog state such as biometric information—could generate a single-use key for identity. Chitra argues that this approach could provide more inherent privacy than a blockchain-based identity system.
The proposed security advantage rests on the no-cloning theorem: a quantum state cannot be copied exactly. Chitra says that could offer stronger cryptographic guarantees than systems that depend on hash functions. But the idea has demanding requirements. It needs both a quantum computer and a quantum state that can be measured and accessed; in his account, the computer is necessary to prevent the relevant state from being manipulated. Those requirements make quantum money a prospective technology, not a ready replacement for current digital assets.
Chitra expects quantum money to matter more once quantum computers exist, particularly if AI or quantum computing weakens the assumptions behind classical cryptography. He says AI has helped break post-quantum cryptosystems, including McEliece, but distinguishes that claim from evidence that major cryptographic problems have been solved. OpenAI’s released math problems, he says, had not solved major cryptography problems, though one smaller problem might affect an older system. His point is that the risk deserves attention, not that established cryptography has already been broadly defeated.
A vanity-address generator illustrates how security can fail when the space of possible keys is too small. Chitra cited one that used about 20 bits of entropy—roughly a million possible combinations—rather than around 128 bits normally. If an address is drawn from such a limited set, searching the possibilities could recover its private key. The example reinforces his broader emphasis: digital-asset security depends not only on where computation happens, but on whether the underlying keys and identity mechanisms can withstand attempts to copy, guess, or manipulate them.
This summary was generated from the episode transcript and can contain mistakes.