A quantum algorithm for model independent searches for new physics
Prasanth Shyamsundar
University of Florida
based on [arXiv:2003.02181]
- Prof. Konstantin T. Matchev
Prasanth Shyamsundar
- Dr. Jordan Smolinsky
Pheno 2020 May 4-6, 2020
A quantum algorithm for model independent searches for new physics - - PowerPoint PPT Presentation
A quantum algorithm for model independent searches for new physics Prasanth Shyamsundar University of Florida based on [arXiv:2003.02181] Prof. Konstantin T. Matchev Prasanth Shyamsundar Dr. Jordan Smolinsky Pheno 2020 May 4-6, 2020
Pheno 2020 May 4-6, 2020
Konstantin T. Matchev, Prasanth Shyamsundar, Jordan Smolinsky [arXiv:2003.02181] 1/11 Go to end
Konstantin T. Matchev, Prasanth Shyamsundar, Jordan Smolinsky [arXiv:2003.02181] 2/11 Go to end
Konstantin T. Matchev, Prasanth Shyamsundar, Jordan Smolinsky [arXiv:2003.02181] 3/11 Go to end
Konstantin T. Matchev, Prasanth Shyamsundar, Jordan Smolinsky [arXiv:2003.02181] 3/11 Go to end
Specificity Sensitivity Specificity Sensitivity
Higgs search for known mH Higgs search for unknown mH
Specificity Sensitivity
Fully specified model Simplified model No model
Konstantin T. Matchev, Prasanth Shyamsundar, Jordan Smolinsky [arXiv:2003.02181] 4/11 Go to end
1 20 40 60 80 100 Bin i 4 2 2 4
i 2 = 146.0
r = 49
1 20 40 60 80 100 Bin i 4 2 2 4
i 2 = 145.7
r = 50 1 2 3 4 5 6 7 8 9 10 1 2 3 4 5 6 7 8 9 10 3 2 1 1 2 3
i
1 2 3 4 5 6 7 8 9 10 1 2 3 4 5 6 7 8 9 10 3 2 1 1 2 3
i
Konstantin T. Matchev, Prasanth Shyamsundar, Jordan Smolinsky [arXiv:2003.02181] 5/11 Go to end
1 20 40 60 80 100 Bin i 4 2 2 4
i
2 = 146.0
r = 49
1 20 40 60 80 100 Bin i 4 2 2 4
i
2 = 145.7
r = 50
Konstantin T. Matchev, Prasanth Shyamsundar, Jordan Smolinsky [arXiv:2003.02181] 6/11 Go to end
Konstantin T. Matchev, Prasanth Shyamsundar, Jordan Smolinsky [arXiv:2003.02181] 7/11 Go to end
i
2 = 146.0
r = 49
min =
71.3
i
2 = 145.7
r = 50
min =
82.5
Konstantin T. Matchev, Prasanth Shyamsundar, Jordan Smolinsky [arXiv:2003.02181] 8/11 Go to end
1 2 3 4 5 6 7 8 9 10 1 2 3 4 5 6 7 8 9 10 3 2 1 1 2 3
i
1 2 3 4 5 6 7 8 9 10 1 2 3 4 5 6 7 8 9 10 3 2 1 1 2 3
i
Konstantin T. Matchev, Prasanth Shyamsundar, Jordan Smolinsky [arXiv:2003.02181] 9/11 Go to end
Runs test
2 test 2 + Runs test
KS test
min test
10
1
10
3
10
5
p-value under
2+Runs
10
1
10
3
10
5
p-value under
min
1 1 2 2 3 3 4 4
10 × 10 grid Regions test
2 test 2 + Regions test min test
Konstantin T. Matchev, Prasanth Shyamsundar, Jordan Smolinsky [arXiv:2003.02181] 10/11 Go to end
Konstantin T. Matchev, Prasanth Shyamsundar, Jordan Smolinsky [arXiv:2003.02181] 11/11 Go to end