Figure 9 - uploaded by René Peralta
Content may be subject to copyright.
Download
View publication
Sample size vs. FN=FP, with í µí¼™ 1 = 0.002

Sample size vs. FN=FP, with í µí¼™ 1 = 0.002

Source publication
Figure 3: Various PDFs of QC-values
Figure 7: Inverse CDFs of SQC with í µí±š = 10 6
Figure 9: Sample size vs. FN=FP, with í µí¼™ 1 = 0.002
Figure 10: Sample size vs. FN=FP, with í µí¼™ 1 = 0.01
+9 Figures 9 and 10, respectively for honest fidelities í µí¼™ = 0.002 í...
Notes on Interrogating Random Quantum Circuits
Preprint
Full-text available
  • May 2020
Consider a quantum circuit that, when fed a constant input, produces a fixed-length random bit-string in each execution. Executing it many times yields a sample of many bit-strings that contain fresh randomness inherent to the quantum evaluation. When the circuit is freshly selected from a special class, the output distribution of strings cannot be...

Context in source publication

Context 1
... Figure 6 PDF approximations of SQC í µí±‹ í µí°¹ ,í µí±š=5,.5 . . 9 Figure 7 Inverse CDFs of SQC with í µí±š = 10 6 . . . . 10 Figure 8 Inverse CDFs of SQC with í µí±š = 10 7 . . . . 10 Figure 9 Sample size vs. FN=FP, with í µí¼™ 1 = 0.002 . ...

Similar publications

The structure of our one-round QMAKA scheme
The structure of N ordered three-particle entangled states sequences
Example of Subset-of-Intersection-Method
Example between SHS and Bob with three-particle entangled states
A One-Round Quantum Mutual Authenticated Key Agreement Protocol with Semi-Honest Server Using Three-Particle Entangled States
Article
Full-text available
  • Mar 2021
In this paper, we propose a mutual authenticated quantum key agreement scheme based on three-particle entangled states, which can achieve both completely secure and more efficient. In our scheme, the pre-shared keys are classical bit strings between the semi-honest server (SHS) and the client (Alice or Bob), so they are kept and use to authenticate...