Information Theoretically Secure Hypothesis Test for Temporally Unstructured Quantum Computation (Extended Abstract)

@inproceedings{Mills2017InformationTS,
  title={Information Theoretically Secure Hypothesis Test for Temporally Unstructured Quantum Computation (Extended Abstract)},
  author={Daniel Mills and A. Pappa and Theodoros Kapourniotis and E. Kashefi},
  year={2017}
}
The efficient certification of classically intractable quantum devices has been a central research question for some time. However, to observe a "quantum advantage", it is believed that one does not need to build a large scale universal quantum computer, a task which has proven extremely challenging. Intermediate quantum models that are easier to implement, but which also exhibit this quantum advantage over classical computers, have been proposed. In this work, we present a certification… Expand
12 Citations
Verification of Quantum Computation: An Overview of Existing Approaches
  • 64
  • PDF
Methods for Classically Simulating Noisy Networked Quantum Architectures
  • 5
  • PDF
Methods for classically simulating noisy networked quantum architectures
  • IskrenVankov, DanielMills
  • 2019
  • PDF
Classical simulations of noisy commuting quantum computations
  • PDF
Sample Complexity of Device-Independently Certified "Quantum Supremacy".
  • 17
  • PDF
Nonadaptive fault-tolerant verification of quantum supremacy with noise
  • 12
  • PDF
Verification of Many-Qubit States
  • 38
  • PDF
Application-Motivated, Holistic Benchmarking of a Full Quantum Computing Stack
  • 3
  • PDF
The Born supremacy: quantum advantage and training of an Ising Born machine
  • 26
  • PDF
...
1
2
...

References

SHOWING 1-10 OF 48 REFERENCES
Optimised resource construction for verifiable quantum computation
  • 22
  • PDF
Temporally unstructured quantum computation
  • D. Shepherd, M. Bremner
  • Mathematics
  • Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • 2009
  • 97
  • Highly Influential
  • PDF
Quantum Supremacy for Simulating a Translation-Invariant Ising Spin Model.
  • 62
  • PDF
Universal Blind Quantum Computation
  • 363
  • PDF
Quantum computing and the entanglement frontier
  • 212
  • PDF
Unconditionally verifiable blind quantum computation
  • 127
  • PDF
Nonadaptive fault-tolerant verification of quantum supremacy with noise
  • 12
  • PDF
Measurement-based classical computation.
  • 24
  • PDF
...
1
2
3
4
5
...