Resource-efficient verification of quantum computing using Serfling’s bound
10.1038/s41534-019-0142-2
Saved in:
Main Authors: | Takeuchi, Y., Mantri, A., Morimae, T., Mizutani, A., Fitzsimons, J.F. |
---|---|
Other Authors: | CENTRE FOR QUANTUM TECHNOLOGIES |
Format: | Article |
Published: |
Nature Partner Journals
2021
|
Online Access: | https://scholarbank.nus.edu.sg/handle/10635/212237 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Experimental verification of quantum computation
by: Barz, S., et al.
Published: (2014) -
Optimal blind quantum computation
by: Mantri, A., et al.
Published: (2014) -
Universality of quantum computation with cluster states and (X, Y)-plane measurements
by: Mantri, A, et al.
Published: (2020) -
Quantum computational universality of hypergraph states with Pauli-X and Z basis measurements
by: Takeuchi, Y., et al.
Published: (2021) -
Flow ambiguity: A path towards classically driven blind quantum computation
by: Mantri, A, et al.
Published: (2020)