Urmila Mahadev: Classical homomorphic encryption for quantum circuits

Channel:
United States QuICS
Subscribers:
2,450
Published on ● Video Link: https://www.youtube.com/watch?v=1oOMO8JajTs


Duration: 57:34
883 views
0

We present the first leveled fully homomorphic encryption scheme for quantum circuits with classical keys. The scheme allows a classical client to blindly delegate a quantum computation to a quantum server: an honest server is able to run the computation while a malicious server is unable to learn any information about the computation. We show that it is possible to construct such a scheme directly from a quantum secure classical homomorphic encryption scheme with certain properties. Finally, we show that a classical homomorphic encryption scheme with the required properties can be constructed from the learning with errors problem.



Other Videos By QuICS


2021-10-06Victor Albert: Overview of quantum research at UMD
2021-09-30Nicolas Delfosse: Improved quantum error correction using soft information
2021-05-05Tamara Kohler and Emilio Onorati: Fitting quantum noise models to tomography data
2021-04-14Sisi Zhou: Error-corrected quantum metrology
2021-03-28Martin Fraas: Quantized quantum transport in interacting systems
2021-03-12Michael DeMarco: A Commuting Projector Model for Hall Conductance
2021-03-09Daniel Stilck França: Limitations of optimization algorithms on noisy quantum devices
2021-03-09Robert Huang: Fundamental aspects of solving quantum problems with machine learning
2020-11-04Wolfgang Pfaff: Increasing connectivity and modularity in superconducting quantum circuits
2020-10-29Iordanis Kerenidis: Quantum Machine Learning: prospects and challenges
2020-10-21Urmila Mahadev: Classical homomorphic encryption for quantum circuits
2020-10-08Thomas Baker: Density functionals, Kohn-Sham potentials & Green’s functions from a quantum computer
2020-09-23James D. Whitfield: Limitations of Hartree-Fock with Quantum Resources
2020-09-18Mark Wilde: Quantum Renyi relative entropies and their use
2020-08-17Dmitry Green: A superconducting circuit realization of combinatorial gauge symmetry
2020-07-23Matt Hastings: The Power of Adiabatic Quantum Computation with No Sign Problem
2020-06-19William Slofstra: Arkhipov's theorem, games, groups, and graphs
2020-06-10Ramis Movassagh:Cayley path & quantum supremacy:Average case # P-Hardness of random circuit sampling
2020-06-04Steve Flammia: Characterization of Solvable Spin Models via Graph Invariants
2020-05-20Aram Harrow: Small Quantum Computers and Large Classical Data Sets
2020-02-05Dominik Hangleiter: (How) can we verify quantum supremacy?


Tags:
quantum computing