One-Way Functions Imply Secure Computation in a Quantum World

• URL: http://arxiv.org/abs/2011.13486v3
• Date: Sat, 3 Aug 2024 01:06:03 GMT
• Title: One-Way Functions Imply Secure Computation in a Quantum World
• Authors: James Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi Ma,
• Abstract summary: We prove that quantum-hard one-way functions imply simulation-secure quantum oblivious transfer (QOT) Our construction only makes black-box use of the quantum-hard one-way function.
• Score: 14.766536501669389
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We prove that quantum-hard one-way functions imply simulation-secure quantum oblivious transfer (QOT), which is known to suffice for secure computation of arbitrary quantum functionalities. Furthermore, our construction only makes black-box use of the quantum-hard one-way function. Our primary technical contribution is a construction of extractable and equivocal quantum bit commitments based on the black-box use of quantum-hard one-way functions in the standard model. Instantiating the Cr\'epeau-Kilian (FOCS 1988) framework with these commitments yields simulation-secure QOT.

Related papers

• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [60.996803677584424]
  Variational Quantum Circuits (VQCs) offer a novel pathway for quantum machine learning.<n>Their practical application is hindered by inherent limitations such as constrained linear expressivity, optimization challenges, and acute sensitivity to quantum hardware noise.<n>This work introduces VQC-MLPNet, a scalable and robust hybrid quantum-classical architecture designed to overcome these obstacles.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• Nonlinear functions of quantum states [5.641998714611475]
  We introduce the quantum state function (QSF) framework by extending the SWAP test via linear combination of unitaries and parameterized quantum circuits. We develop quantum algorithms of fundamental tasks, achieving a sample complexity of $tildemathcalO (1/(varepsilon2kappa)$ for both von Neumann entropy estimation and quantum state fidelity calculations.
  arXiv  Detail & Related papers  (2024-12-02T16:40:17Z)
• Quantum Wasserstein Compilation: Unitary Compilation using the Quantum Earth Mover's Distance [2.502222151305252]
  We present a quantum Wasserstein compilation (QWC) cost function based on the quantum Wasserstein distance of order 1. An estimation method based on measurements of local Pauli-observable is utilized in a generative adversarial network to learn a given quantum circuit.
  arXiv  Detail & Related papers  (2024-09-09T17:46:40Z)
• Quantum decoherence from complex saddle points [0.0]
  Quantum decoherence is the effect that bridges quantum physics to classical physics.<n>We present some first-principle calculations in the Caldeira-Leggett model.<n>We also discuss how to extend our approach to general models by Monte Carlo calculations.
  arXiv  Detail & Related papers  (2024-08-29T15:35:25Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• Existential Unforgeability in Quantum Authentication From Quantum Physical Unclonable Functions Based on Random von Neumann Measurement [45.386403865847235]
  Physical Unclonable Functions (PUFs) leverage inherent, non-clonable physical randomness to generate unique input-output pairs.<n>Quantum PUFs (QPUFs) extend this concept by using quantum states as input-output pairs.<n>We show that random unitary QPUFs cannot achieve existential unforgeability against Quantum Polynomial Time adversaries.<n>We introduce a second model where the QPUF functions as a nonunitary quantum channel, which guarantees existential unforgeability.
  arXiv  Detail & Related papers  (2024-04-17T12:16:41Z)
• Building Trust in the Quantum Cloud with Physical Unclonable Functions [1.9903304028630213]
  We present an authentication protocol that leverages quantum device properties to construct Quantum Physical Unclonable Functions (Q-PUFs)<n>We prototype our approach on IBM quantum devices with both real and simulated data.<n>Our work lays the groundwork for secure, hardware-rooted authentication in hybrid quantum-classical systems.
  arXiv  Detail & Related papers  (2023-11-13T05:47:33Z)
• Learning Quantum Processes with Quantum Statistical Queries [0.0]
  This paper introduces the first learning framework for studying quantum process learning within the Quantum Statistical Query model. We propose an efficient QPSQ learner for arbitrary quantum processes accompanied by a provable performance guarantee. This work marks a significant step towards understanding the learnability of quantum processes and shedding light on their security implications.
  arXiv  Detail & Related papers  (2023-10-03T14:15:20Z)
• Quantum Computing Quantum Monte Carlo [8.69884453265578]
  We propose a hybrid quantum-classical algorithm that integrates quantum computing and quantum Monte Carlo. Our work paves the way to solving practical problems with intermediatescale and early-fault tolerant quantum computers.
  arXiv  Detail & Related papers  (2022-06-21T14:26:24Z)
• An Amplitude-Based Implementation of the Unit Step Function on a Quantum Computer [0.0]
  We introduce an amplitude-based implementation for approximating non-linearity in the form of the unit step function on a quantum computer. We describe two distinct circuit types which receive their input either directly from a classical computer, or as a quantum state when embedded in a more advanced quantum algorithm.
  arXiv  Detail & Related papers  (2022-06-07T07:14:12Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• 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)
• On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
  We devise three effective QAE-based learning protocols to address three classically computational hard learning problems. Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
  arXiv  Detail & Related papers  (2021-06-29T14:01:40Z)
• Quantum Federated Learning with Quantum Data [87.49715898878858]
  Quantum machine learning (QML) has emerged as a promising field that leans on the developments in quantum computing to explore large complex machine learning problems. This paper proposes the first fully quantum federated learning framework that can operate over quantum data and, thus, share the learning of quantum circuit parameters in a decentralized manner.
  arXiv  Detail & Related papers  (2021-05-30T12:19:27Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds [12.525959293825318]
  We construct a constant round interactive proof for NP that satisfies statistical soundness and black-box $epsilon$-zero-knowledge against quantum attacks. At the heart of our results is a new quantum rewinding technique that enables a simulator to extract a committed message of a malicious verifier.
  arXiv  Detail & Related papers  (2020-11-05T05:40:05Z)

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.