Classical Obfuscation of Quantum Circuits via Publicly-Verifiable QFHE

• URL: http://arxiv.org/abs/2510.08400v1
• Date: Thu, 09 Oct 2025 16:19:12 GMT
• Title: Classical Obfuscation of Quantum Circuits via Publicly-Verifiable QFHE
• Authors: James Bartusek, Aparna Gupte, Saachi Mutreja, Omri Shmueli,
• Abstract summary: A classical obfuscator for quantum circuits is a program that outputs the classical description of a quantum circuit $Q$.<n>We show that (relative to a classical oracle) there exists a classical obfuscator for all pseudo-deterministic quantum circuits.
• Score: 6.626421278252587
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: A classical obfuscator for quantum circuits is a classical program that, given the classical description of a quantum circuit $Q$, outputs the classical description of a functionally equivalent quantum circuit $\hat{Q}$ that hides as much as possible about $Q$. Previously, the only known feasibility result for classical obfuscation of quantum circuits (Bartusek and Malavolta, ITCS 2022) was limited to circuits that always reject. On the other hand, if the obfuscator is allowed to compile the quantum circuit $Q$ into a quantum state $|\hat{Q}\rangle$, there exist feasibility results for obfuscating all pseudo-deterministic quantum circuits (Bartusek, Kitagawa, Nishimaki and Yamakawa, STOC 2023, Bartusek, Brakerski and Vaikuntanathan, STOC 2024), and all unitaries (Huang and Tang, FOCS 2025). We show that (relative to a classical oracle) there exists a classical obfuscator for all pseudo-deterministic quantum circuits. We do this by giving the first construction of a compact quantum fully-homomorphic encryption (QFHE) scheme that supports public verification of (pseudo-deterministic) quantum evaluation, relative to a classical oracle. To construct our QFHE scheme, we improve on the approach of Bartusek, Kitagawa, Nishimaki and Yamakawa (STOC 2023), which required ciphertexts that are both quantum and non-compact due to the use of quantum coset states and their publicly-verifiable properties. We introduce new techniques for analyzing coset states that can be generated ''on the fly'', by proving new cryptographic properties of the one-shot signature scheme of Shmueli and Zhandry (CRYPTO 2025). Our techniques allow us to produce QFHE ciphertexts that are purely classical, compact, and publicly-verifiable. This also yields the first classical verification of quantum computation protocol for BQP that simultaneously satisfies blindness and public-verifiability.

Related papers

• Obfuscation of Arbitrary Quantum Circuits [0.5371337604556311]
  A central open problem is whether an obfuscation scheme for arbitrary quantum circuits exists.<n>We construct the first quantum ideal obfuscation scheme for arbitrary quantum circuits.<n>Our obfuscation scheme can also be realized in the quantumly accessible pseudorandom oracle model.
  arXiv  Detail & Related papers  (2026-01-13T20:28:49Z)
• Quantum-Classical Separation in Bounded-Resource Tasks Arising from Measurement Contextuality [107.84586711462556]
  We show that quantum contextuality enables certain tasks to be performed with success probabilities beyond classical limits.<n>Our work proposes novel ways to benchmark quantum processors using contextuality-based algorithms.
  arXiv  Detail & Related papers  (2025-12-01T23:54:32Z)
• Obfuscation of Unitary Quantum Programs [0.651722296019499]
  Program obfuscation aims to hide the inner workings of a program while preserving its functionality.<n>In this work, we improve upon existing results by constructing the first quantum state obfuscation scheme for unitary quantum programs.<n>At the core of our obfuscation scheme are two novel ingredients: a functional quantum authentication scheme that allows key holders to learn specific functions of the authenticated quantum state with simulation-based security, and a compiler that represents an arbitrary quantum circuit.
  arXiv  Detail & Related papers  (2025-07-16T07:07:52Z)
• Quantum State Obfuscation from Classical Oracles [18.878095837031292]
  A major unresolved question in quantum cryptography is whether it is possible to obfuscate arbitrary quantum computation. We develop a new array of techniques that we use to construct a quantum state obfuscator.
  arXiv  Detail & Related papers  (2024-01-18T18:42:28Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• 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)
• Obfuscation of Pseudo-Deterministic Quantum Circuits [14.026980555435841]
  We show how to obfuscate pseudo-deterministic quantum circuits in the classical oracle model. Our obfuscator outputs a quantum state $ketwidetildeQ$ repeatedly on arbitrary inputs.
  arXiv  Detail & Related papers  (2023-02-22T01:14:20Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)
• Quantum copy-protection of compute-and-compare programs in the quantum random oracle model [48.94443749859216]
  We introduce a quantum copy-protection scheme for a class of evasive functions known as " compute-and-compare programs" We prove that our scheme achieves non-trivial security against fully malicious adversaries in the quantum random oracle model (QROM) As a complementary result, we show that the same scheme fulfils a weaker notion of software protection, called "secure software leasing"
  arXiv  Detail & Related papers  (2020-09-29T08:41:53Z)
• Succinct Blind Quantum Computation Using a Random Oracle [0.8702432681310399]
  We give a new universal blind quantum computation protocol. The protocol's first phase is succinct, that is, its complexity is independent of circuit size.
  arXiv  Detail & Related papers  (2020-04-27T07:47:11Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.