-
Notifications
You must be signed in to change notification settings - Fork 53
/
book.bib
6070 lines (6044 loc) · 229 KB
/
book.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
@misc{adversary-simple,
title = {Lecture 13: Lower Bounds using the Adversary Method},
author = {Ryan O’Donnell},
year = 2015,
month = {October},
publisher = {Carnegie Mellon University},
}
@article{giurgica2022low,
title={Low-depth amplitude estimation on a trapped-ion quantum computer},
author={Giurgica-Tiron, Tudor and Johri, Sonika and Kerenidis, Iordanis and Nguyen, Jason and Pisenti, Neal and Prakash, Anupam and Sosnova, Ksenia and Wright, Ken and Zeng, William},
journal={Physical Review Research},
volume={4},
number={3},
pages={033034},
year={2022},
publisher={APS}
}
@article{callison2022improved,
title={Improved maximum-likelihood quantum amplitude estimation},
author={Callison, Adam and Browne, Dan},
journal={arXiv preprint arXiv:2209.03321},
year={2022}
}
@article{brown2020quantum,
title={Quantum amplitude estimation in the presence of noise},
author={Brown, Eric G and Goktas, Oktay and Tham, WK},
journal={arXiv preprint arXiv:2006.14145},
year={2020}
}
@article{zhang2022quantum,
title = {Quantum State Preparation with Optimal Circuit Depth: Implementations and Applications},
author = {Zhang, Xiao-Ming and Li, Tongyang and Yuan, Xiao},
year = 2022,
journal = {arXiv preprint arXiv:2201.11495},
}
@inproceedings{bernstein2013quantum,
title={Quantum algorithms for the subset-sum problem},
author={Bernstein, Daniel J and Jeffery, Stacey and Lange, Tanja and Meurer, Alexander},
booktitle={International Workshop on Post-Quantum Cryptography},
pages={16--33},
year={2013},
organization={Springer}
}
@article{bellante2022quantum,
title={Quantum matching pursuit: A quantum algorithm for sparse representations},
author={Bellante, Armando and Zanero, Stefano},
journal={Physical Review A},
volume={105},
number={2},
pages={022414},
year={2022},
publisher={APS}
}
@article{an2022quantum,
title={Quantum linear system solver based on time-optimal adiabatic quantum computing and quantum approximate optimization algorithm},
author={An, Dong and Lin, Lin},
journal={ACM Transactions on Quantum Computing},
volume={3},
number={2},
pages={1--28},
year={2022},
publisher={ACM New York, NY}
}
@article{lin2020optimal,
title={Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems},
author={Lin, Lin and Tong, Yu},
journal={Quantum},
volume={4},
pages={361},
year={2020},
publisher={Verein zur F{\"o}rderung des Open Access Publizierens in den Quantenwissenschaften}
}
@article{costa2021optimal,
title={Optimal scaling quantum linear systems solver via discrete adiabatic theorem},
author={Costa, Pedro and An, Dong and Sanders, Yuval R and Su, Yuan and Babbush, Ryan and Berry, Dominic W},
journal={arXiv preprint arXiv:2111.08152},
year={2021}
}
@article{buhrman2022memory,
title={Memory Compression with Quantum Random-Access Gates},
author={Buhrman, Harry and Loff, Bruno and Patro, Subhasree and Speelman, Florian},
journal={arXiv preprint arXiv:2203.05599},
year={2022}
}
@article{jeffery2014frameworks,
title={Frameworks for quantum algorithms},
author={Jeffery, Stacey},
year={2014},
publisher={University of Waterloo}
}
@book{serfozo2009basics,
title = {Basics of applied stochastic processes},
author = {Serfozo, Richard},
year = 2009,
publisher = {Springer Science \& Business Media},
}
@article{chakrabarti2021threshold,
title = {A threshold for quantum advantage in derivative pricing},
author = {Chakrabarti, Shouvanik and Krishnakumar, Rajiv and Mazzola, Guglielmo and Stamatopoulos, Nikitas and Woerner, Stefan and Zeng, William J},
year = 2021,
journal = {Quantum},
publisher = {Verein zur F{\"o}rderung des Open Access Publizierens in den Quantenwissenschaften},
volume = 5,
pages = 463,
}
@article{paler2020parallelizing,
title = {Parallelizing the queries in a bucket-brigade quantum random access memory},
author = {Paler, Alexandru and Oumarou, Oumarou and Basmadjian, Robert},
year = 2020,
journal = {Physical Review A},
publisher = {APS},
volume = 102,
number = 3,
pages = {032608},
}
@article{low2018trading,
title = {Trading T-gates for dirty qubits in state preparation and unitary synthesis},
author = {Low, Guang Hao and Kliuchnikov, Vadym and Schaeffer, Luke},
year = 2018,
journal = {arXiv preprint arXiv:1812.00954},
}
@article{berry2019qubitization,
title = {Qubitization of arbitrary basis quantum chemistry leveraging sparsity and low rank factorization},
author = {Berry, Dominic W and Gidney, Craig and Motta, Mario and McClean, Jarrod R and Babbush, Ryan},
year = 2019,
journal = {Quantum},
publisher = {Verein zur F{\"o}rderung des Open Access Publizierens in den Quantenwissenschaften},
volume = 3,
pages = 208,
}
@article{hann2021resilience,
title = {Resilience of quantum random access memory to generic noise},
author = {Hann, Connor T and Lee, Gideon and Girvin, SM and Jiang, Liang},
year = 2021,
journal = {PRX Quantum},
publisher = {APS},
volume = 2,
number = 2,
pages = {020311},
}
@article{ambainis2002adversary,
title = {Quantum Lower Bounds by Quantum Arguments},
author = {Andris Ambainis},
year = 2002,
journal = {Journal of Computer and System Sciences},
volume = 64,
number = 4,
pages = {750--767},
issn = {0022-0000},
}
@article{markov1890ineq,
title = {On a question by D. I. Mendeleev},
author = {Markov},
year = 1890,
journal = {Zap. Imp. Akad. Nauk. St. Petersburg},
}
@inproceedings{paturi1992degbound,
title = {On the Degree of Polynomials That Approximate Symmetric Boolean Functions (Preliminary Version)},
author = {Paturi, Ramamohan},
year = 1992,
booktitle = {Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing},
location = {Victoria, British Columbia, Canada},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
series = {STOC '92},
pages = {468–474},
doi = {10.1145/129712.129758},
isbn = {0897915119},
url = {https://doi.org/10.1145/129712.129758},
abstract = {In this paper, we provide matching (up to a constant factor) upper and lower bounds on the degree of polynomials that represent symmetric boolean functions with an error 1/3. Let Γ(f)=min{|2k–n+1|:fk ≠ fk+ 1 and 0 ≤ k ≤ n – 1} where fi is the value of f on inputs with exactly i 1's. We prove that the minimum degree over all the approximating polynomials of f is Θ((n(n-Γ(f))).5). We apply the techniques and tools from approximation theory to derive this result.},
numpages = 7,
}
@article{boyer1998tight,
title = {Tight bounds on quantum searching},
author = {Boyer, Michel and Brassard, Gilles and H{\o}yer, Peter and Tapp, Alain},
year = 1998,
journal = {Fortschritte der Physik: Progress of Physics},
publisher = {Wiley Online Library},
volume = 46,
number = {4-5},
pages = {493--505},
}
@book{scapellato,
title = {Geometria e algebra lineare},
author = {Manara, M.P. and Perotti, A. and Scapellato, R.},
year = 2007,
publisher = {Esculapio},
}
@article{cade2017quantum,
title={The Quantum Complexity of Computing Schatten $ p $-norms},
author={Cade, Chris and Montanaro, Ashley},
journal={arXiv preprint arXiv:1706.09279},
year={2017}
}
@article{gyurik2020towards,
title={Towards quantum advantage for topological data analysis},
author={Gyurik, Casper and Cade, Chris and Dunjko, Vedran},
journal={arXiv preprint arXiv:2005.02607},
year={2020}
}
@book{linearalgebragilbert,
title = {Introduction to linear algebra},
author = {Strang, Gilbert},
year = 2016,
publisher = {Wellesley - Cambridge Press},
isbn = {ISBN 978-0-9802327-7-6},
}
@article{cao2017quantum,
title = {Quantum Neuron: an elementary building block for machine learning on quantum computers},
author = {Cao, Yudong and Guerreschi, Gian Giacomo and Aspuru-Guzik, Al{\'a}n},
year = 2017,
journal = {arXiv preprint arXiv:1711.11240},
}
@article{verbeek2003efficient,
title = {Efficient greedy learning of Gaussian mixture models},
author = {Verbeek, Jakob J and Vlassis, Nikos and Kr{\"o}se, Ben},
year = 2003,
journal = {Neural computation},
publisher = {MIT Press},
volume = 15,
number = 2,
pages = {469--485},
}
@ieeetranbstctl{IEEEexample:BSTcontrol,
ctldash_repeated_names = {no},
}
@misc{researchpaper,
title = {Research Paper dataset},
author = {Harun-Ur-Rashid},
year = 2018,
journal = {https://www. kaggle. com/harunshimanto/research-paper},
}
@article{nannicini2019fast,
title = {Fast quantum subroutines for the simplex method},
author = {Nannicini, Giacomo},
year = 2019,
journal = {arXiv preprint arXiv:1910.10649},
}
@article{van2020quantum,
title = {Quantum SDP-solvers: Better upper and lower bounds},
author = {van Apeldoorn, Joran and Gily{\'e}n, Andr{\'a}s and Gribling, Sander and {de Wolf}, Ronald},
year = 2020,
journal = {Quantum},
publisher = {Verein zur F{\"o}rderung des Open Access Publizierens in den Quantenwissenschaften},
volume = 4,
pages = 230,
}
@article{huang2019near,
title = {Near-term quantum algorithms for linear systems of equations},
author = {Huang, Hsin-Yuan and Bharti, Kishor and Rebentrost, Patrick},
year = 2019,
journal = {arXiv preprint arXiv:1909.07344},
}
@article{hamoudi2020quantum,
title = {Quantum algorithms for hedging and the Sparsitron},
author = {Hamoudi, Yassine and Ray, Maharshi and Rebentrost, Patrick and Santha, Miklos and Wang, Xin and Yang, Siyi},
year = 2020,
journal = {arXiv preprint arXiv:2002.06003},
}
@incollection{vinayakumar2019improved,
title = {Improved DGA Domain Names Detection and Categorization Using Deep Learning Architectures with Classical Machine Learning Algorithms},
author = {Vinayakumar, R and Soman, KP and Poornachandran, Prabaharan and Akarsh, S and Elhoseny, Mohamed},
year = 2019,
booktitle = {Cybersecurity and Secure Information Systems},
publisher = {Springer},
pages = {161--192},
}
@inproceedings{curtin2019detecting,
title = {Detecting DGA domains with recurrent neural networks and side information},
author = {Curtin, Ryan R and Gardner, Andrew B and Grzonkowski, Slawomir and Kleymenov, Alexey and Mosquera, Alejandro},
year = 2019,
booktitle = {Proceedings of the 14th International Conference on Availability, Reliability and Security},
pages = {1--10},
}
@article{jiang2019experimental,
title = {Experimental realization of 105-qubit random access quantum memory},
author = {Jiang, N and Pu, Y-F and Chang, W and Li, C and Zhang, S and Duan, L-M},
year = 2019,
journal = {npj Quantum Information},
publisher = {Nature Publishing Group},
volume = 5,
number = 1,
pages = 28,
}
@incollection{kearns1998information,
title = {An information-theoretic analysis of hard and soft assignment methods for clustering},
author = {Kearns, Michael and Mansour, Yishay and Ng, Andrew Y},
year = 1998,
booktitle = {Learning in graphical models},
publisher = {Springer},
pages = {495--520},
}
@article{gilyen2018quantum,
title = {Quantum-inspired low-rank stochastic regression with logarithmic dependence on the dimension},
author = {Gily{\'e}n, Andr{\'a}s and Lloyd, Seth and Tang, Ewin},
year = 2018,
journal = {arXiv preprint arXiv:1811.04909},
}
@article{chia2018quantum,
title = {Quantum-inspired sublinear classical algorithms for solving low-rank linear systems},
author = {Chia, Nai-Hui and Lin, Han-Hsuan and Wang, Chunhao},
year = 2018,
journal = {arXiv preprint arXiv:1811.04852},
}
@article{liu1995ml,
title = {{ML} estimation of the t distribution using {EM} and its extensions, {ECM} and {ECME}},
author = {Liu, Chuanhai and Rubin, Donald B},
year = 1995,
journal = {Statistica Sinica},
publisher = {JSTOR},
pages = {19--39},
}
@article{buhrman2001quantum,
title = {Quantum fingerprinting},
author = {Buhrman, Harry and Cleve, Richard and Watrous, John and {de Wolf}, Ronald},
year = 2001,
journal = {Physical Review Letters},
publisher = {APS},
volume = 87,
number = 16,
pages = 167902,
}
@article{miyahara2019expectation,
title = {Quantum expectation-maximization algorithm},
author = {Miyahara, Hideyuki and Aihara, Kazuyuki and Lechner, Wolfgang},
year = 2020,
journal = {Physical Review A},
publisher = {APS},
volume = 101,
number = 1,
pages = {012326},
}
@article{church1995poisson,
title = {Poisson mixtures},
author = {Church, Kenneth W and Gale, William A},
year = 1995,
journal = {Natural Language Engineering},
publisher = {Cambridge University Press},
volume = 1,
number = 2,
pages = {163--190},
}
@article{deutsch1992rapid,
title = {Rapid solution of problems by quantum computation},
author = {Deutsch, David and Jozsa, Richard},
year = 1992,
journal = {Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences},
publisher = {The Royal Society London},
volume = 439,
number = 1907,
pages = {553--558},
}
@article{blomer2013simple,
title = {Simple methods for initializing the {EM} algorithm for gaussian mixture models},
author = {Bl{\"o}mer, Johannes and Bujna, Kathrin},
year = 2013,
journal = {CoRR},
}
@article{biernacki2003choosing,
title = {Choosing starting values for the {EM} algorithm for getting the highest likelihood in multivariate Gaussian mixture models},
author = {Biernacki, Christophe and Celeux, Gilles and Govaert, G{\'e}rard},
year = 2003,
journal = {Computational Statistics \& Data Analysis},
publisher = {Elsevier},
volume = 41,
number = {3-4},
pages = {561--575},
}
@article{dallaire2018quantum,
title = {Quantum generative adversarial networks},
author = {Dallaire-Demers, Pierre-Luc and Killoran, Nathan},
year = 2018,
journal = {Physical Review A},
publisher = {APS},
volume = 98,
number = 1,
pages = {012324},
}
@misc{haas2002expectation,
title = {The expectation-maximization and alternating minimization algorithms},
author = {Haas, Shane M},
year = 2002,
publisher = {September},
}
@article{shor2007estimating,
title = {Estimating Jones polynomials is a complete problem for one clean qubit},
author = {Shor, Peter W and Jordan, Stephen P},
year = 2007,
journal = {arXiv preprint arXiv:0707.2831},
}
@article{Boutsidis,
title = {A randomized algorithm for approximating the log determinant of a symmetric positive definite matrix},
author = {Boutsidis, Christos and Drineas, Petros and Kambadur, Prabhanjan and Kontopoulou, Eugenia-Maria and Zouzias, Anastasios},
year = 2017,
journal = {Linear Algebra and its Applications},
publisher = {Elsevier},
volume = 533,
pages = {95--117},
}
@inproceedings{gabrie2018entropy,
title = {Entropy and mutual information in models of deep neural networks},
author = {Gabri{\'e}, Marylou and Manoel, Andre and Luneau, Cl{\'e}ment and Macris, Nicolas and Krzakala, Florent and Zdeborov{\'a}, Lenka and others},
year = 2018,
booktitle = {Advances in Neural Information Processing Systems},
pages = {1821--1831},
}
@article{csiszar1984information,
title = {Information geometry and alternating minimization procedures},
author = {Csisz{\'a}r, Imre},
year = 1984,
journal = {Statistics and decisions},
publisher = {Oldenburg Verlag},
volume = 1,
pages = {205--237},
}
@article{dauwels2005expectation,
title = {Expectation maximization as message passing},
author = {Dauwels, Justin and Korl, Sascha and Loeliger, H-A},
year = 2005,
journal = {arXiv preprint cs/0508027},
}
@inproceedings{raz2019oracle,
title = {Oracle separation of BQP and PH},
author = {Raz, Ran and Tal, Avishay},
year = 2019,
booktitle = {Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing},
pages = {13--23},
}
@article{lloyd2018quantum,
title = {Quantum generative adversarial learning},
author = {Lloyd, Seth and Weedbrook, Christian},
year = 2018,
journal = {Physical review letters},
publisher = {APS},
volume = 121,
number = 4,
pages = {040502},
}
@article{kerenidis2018neural,
title = {Quantum algorithms for feedforward neural networks},
author = {Allcock, Jonathan and Hsieh, Chang-Yu and Kerenidis, Iordanis and Zhang, Shengyu},
year = 2018,
journal = {arXiv preprint arXiv:1812.03089},
}
@article{boutsidis2017randomized,
title = {A randomized algorithm for approximating the log determinant of a symmetric positive definite matrix},
author = {Boutsidis, Christos and Drineas, Petros and Kambadur, Prabhanjan and Kontopoulou, Eugenia-Maria and Zouzias, Anastasios},
year = 2017,
journal = {Linear Algebra and its Applications},
publisher = {Elsevier},
volume = 533,
pages = {95--117},
}
@article{zhao2019compiling,
title = {Compiling basic linear algebra subroutines for quantum computers},
author = {Zhao, Liming and Zhao, Zhikuan and Rebentrost, Patrick and Fitzsimons, Joseph},
year = 2019,
journal = {arXiv preprint arXiv:1902.10394},
}
@article{hadfield2018quantum,
title = {Quantum Algorithms for Scientific Computing and Approximate Optimization},
author = {Hadfield, Stuart},
year = 2018,
journal = {arXiv preprint arXiv:1805.03265},
}
@inproceedings{achlioptas2003fast,
title = {Fast computation of low rank matrix approximations},
author = {Achlioptas, Dimitris and McSherry, Frank},
booktitle = {Proceedings of the 33rd Annual Symposium on Theory of Computing, 611-618, 2001},
}
@article{drineas2004clustering,
title = {Clustering large graphs via the singular value decomposition},
author = {Drineas, Petros and Frieze, Alan and Kannan, Ravi and Vempala, Santosh and Vinay, V},
year = 2004,
journal = {Machine learning},
publisher = {Springer},
volume = 56,
number = {1-3},
pages = {9--33},
}
@book{schlesinger,
title = {Algebra lineare e geometria},
author = {Schlesinger, Enrico},
year = 2011,
publisher = {Zanichelli},
}
@article{hamoudi2018quantum,
title = {Quantum Chebyshev's Inequality and Applications},
author = {Hamoudi, Yassine and Magniez, Fr{\'e}d{\'e}ric},
year = 2018,
journal = {arXiv preprint arXiv:1807.06456},
}
@inproceedings{A12,
title = {Variable time amplitude amplification and quantum algorithms for linear algebra problems},
author = {Ambainis, Andris},
year = 2012,
booktitle = {STACS'12 (29th Symposium on Theoretical Aspects of Computer Science)},
volume = 14,
pages = {636--647},
organization = {LIPIcs},
}
@article{GLT18,
title = {Quantum-inspired low-rank stochastic regression with logarithmic dependence on the dimension},
author = {Gily{\'e}n, Andr{\'a}s and Lloyd, Seth and Tang, Ewin},
year = 2018,
journal = {arXiv preprint arXiv:1811.04909},
}
@article{T18,
title = {Quantum-inspired classical algorithms for principal component analysis and supervised clustering},
author = {Tang, Ewin},
year = 2018,
journal = {arXiv preprint arXiv:1811.00414},
}
@article{ghojogh2019eigenvalue,
title = {Eigenvalue and generalized eigenvalue problems: Tutorial},
author = {Ghojogh, Benyamin and Karray, Fakhri and Crowley, Mark},
year = 2019,
journal = {arXiv preprint arXiv:1903.11240},
}
@article{B17,
title = {Quantum machine learning},
author = {Biamonte, Jacob and Wittek, Peter and Pancotti, Nicola and Rebentrost, Patrick and Wiebe, Nathan and Lloyd, Seth},
year = 2017,
journal = {Nature},
publisher = {Nature Publishing Group},
volume = 549,
number = 7671,
pages = 195,
}
@article{V17,
title = {Quantum Machine Learning},
author = {von Lilienfeld, Anatole},
year = 2017,
journal = {Bulletin of the American Physical Society},
publisher = {American Physical Society},
volume = 62,
}
@article{S15,
title = {An introduction to quantum machine learning},
author = {Schuld, Maria and Sinayskiy, Ilya and Petruccione, Francesco},
year = 2015,
journal = {Contemporary Physics},
publisher = {Taylor \& Francis},
volume = 56,
number = 2,
pages = {172--185},
}
@article{reynolds2000speaker,
title = {Speaker verification using adapted Gaussian mixture models},
author = {Reynolds, Douglas A and Quatieri, Thomas F and Dunn, Robert B},
year = 2000,
journal = {Digital signal processing},
publisher = {Elsevier},
volume = 10,
number = {1-3},
pages = {19--41},
}
@article{C18,
title = {Quantum machine learning: a classical perspective},
author = {Ciliberto, Carlo and Herbster, Mark and Ialongo, Alessandro Davide and Pontil, Massimiliano and Rocchetto, Andrea and Severini, Simone and Wossnig, Leonard},
year = 2018,
journal = {Proc. R. Soc. A},
publisher = {The Royal Society},
volume = 474,
number = 2209,
pages = 20170551,
}
@article{LMR13,
title = {{Quantum algorithms for supervised and unsupervised machine learning}},
author = {Lloyd, Seth and Mohseni, Masoud and Rebentrost, Patrick},
year = 2013,
month = 7,
journal = {arXiv},
volume = {1307.0411},
pages = {1--11},
url = {http://arxiv.org/abs/1307.0411},
arxivid = {1307.0411},
}
@article{cong2015quantum,
title = {Quantum Discriminant Analysis for Dimensionality Reduction and Classification},
author = {Cong, Iris and Duan, Luming},
year = 2015,
journal = {arXiv preprint arXiv:1510.00113},
}
@article{nayak1998quantum,
title = {The quantum query complexity of approximating the median and related statistics},
author = {Nayak, Ashwin and Wu, Felix},
year = 1998,
journal = {arXiv preprint quant-ph/9804066},
}
@article{cong2016quantum,
title = {Quantum discriminant analysis for dimensionality reduction and classification},
author = {Cong, Iris and Duan, Luming},
year = 2016,
journal = {New Journal of Physics},
publisher = {IOP Publishing},
volume = 18,
number = 7,
pages = {073011},
}
@article{dempster1977maximum,
title = {Maximum likelihood from incomplete data via the {EM} algorithm},
author = {Dempster, Arthur P and Laird, Nan M and Rubin, Donald B},
year = 1977,
journal = {Journal of the royal statistical society. Series B (methodological)},
publisher = {JSTOR},
pages = {1--38},
}
@misc{scklearncompare,
title = {A demo of K-Means clustering on the handwritten digits data},
author = {Sciki-learn project's documentation},
urldate = {2018-11-12},
howpublished = {\url{https://scikit-learn.org/stable/auto_examples/cluster/plot_kmeans_digits.html}},
}
@misc{mathstack,
title = {Is the softmax function Lipschitz with Lipschitz constant 1?},
url = {https://math.stackexchange.com/questions/2020867/machine-learning-is-the-softmax-function-lipschitz-with-lipschitz-constant-1},
}
@article{scikit-learn,
title = {Scikit-learn: Machine Learning in {P}ython},
author = {Pedregosa, F. and Varoquaux, G. and Gramfort, A. and Michel, V. and Thirion, B. and Grisel, O. and Blondel, M. and Prettenhofer, P. and Weiss, R. and Dubourg, V. and Vanderplas, J. and Passos, A. and Cournapeau, D. and Brucher, M. and Perrot, M. and Duchesnay, E.},
year = 2011,
journal = {Journal of Machine Learning Research},
volume = 12,
pages = {2825--2830},
}
@article{lloyd2014quantum,
title = {Quantum principal component analysis},
author = {Lloyd, Seth and Mohseni, Masoud and Rebentrost, Patrick},
year = 2014,
journal = {Nature Physics},
publisher = {Nature Publishing Group},
volume = 10,
number = 9,
pages = 631,
}
@article{giovannetti2008architectures,
title = {Architectures for a quantum random access memory},
author = {Giovannetti, Vittorio and Lloyd, Seth and Maccone, Lorenzo},
year = 2008,
journal = {Physical Review A},
publisher = {APS},
volume = 78,
number = 5,
pages = {052310},
}
@article{partridge1997fast,
title = {Fast dimensionality reduction and simple PCA},
author = {Partridge, Matthew and Calvo, Rafael},
year = 1997,
journal = {Intelligent data analysis},
publisher = {Citeseer},
volume = 2,
number = 3,
pages = {292--298},
}
@inproceedings{bhojanapalli2014tighter,
title = {Tighter low-rank approximation via sampling the leveraged element},
author = {Bhojanapalli, Srinadh and Jain, Prateek and Sanghavi, Sujay},
year = 2014,
booktitle = {Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms},
pages = {902--920},
organization = {SIAM},
}
@article{di2020fault,
title = {Fault-tolerant resource estimation of quantum random-access memories},
author = {Di Matteo, Olivia and Gheorghiu, Vlad and Mosca, Michele},
year = 2020,
journal = {IEEE Transactions on Quantum Engineering},
publisher = {IEEE},
volume = 1,
pages = {1--13},
}
@article{durr1996quantum,
title = {A quantum algorithm for finding the minimum},
author = {Durr, Christoph and Hoyer, Peter},
year = 1996,
journal = {arXiv preprint quant-ph/9607014},
}
@article{ruiz2017quantum,
title = {Quantum arithmetic with the quantum Fourier transform},
author = {Ruiz-Perez, Lidia and Garcia-Escartin, Juan Carlos},
year = 2017,
journal = {Quantum Information Processing},
publisher = {Springer},
volume = 16,
number = 6,
pages = 152,
}
@inproceedings{ambainis2019quantum,
title = {Quantum speedups for exponential-time dynamic programming algorithms},
author = {Ambainis, Andris and Balodis, Kaspars and Iraids, J{\=a}nis and Kokainis, Martins and Pr{\=u}sis, Kri{\v{s}}j{\=a}nis and Vihrovs, Jevg{\=e}nijs},
year = 2019,
booktitle = {Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms},
pages = {1783--1793},
organization = {SIAM},
}
@article{aimeur2013quantum,
title = {Quantum speed-up for unsupervised learning},
author = {A{\"\i}meur, Esma and Brassard, Gilles and Gambs, S{\'e}bastien},
year = 2013,
journal = {Machine Learning},
publisher = {Springer},
volume = 90,
number = 2,
pages = {261--287},
}
@article{nielsen2009statistical,
title = {Statistical exponential families: A digest with flash cards},
author = {Nielsen, Frank and Garcia, Vincent},
year = 2009,
journal = {arXiv preprint arXiv:0911.4863},
}
@inproceedings{yin2014dirichlet,
title = {A dirichlet multinomial mixture model-based approach for short text clustering},
author = {Yin, Jianhua and Wang, Jianyong},
year = 2014,
booktitle = {Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining},
pages = {233--242},
organization = {ACM},
}
@article{celeux1992classification,
title = {A classification {EM} algorithm for clustering and two stochastic versions},
author = {Celeux, Gilles and Govaert, G{\'e}rard},
year = 1992,
journal = {Computational statistics \& Data analysis},
publisher = {Elsevier},
volume = 14,
number = 3,
pages = {315--332},
}
@article{ghitany1994exponential,
title = {Exponential mixture models with long-term survivors and covariates},
author = {Ghitany, ME and Maller, Ross A and Zhou, S},
year = 1994,
journal = {Journal of multivariate Analysis},
publisher = {Elsevier},
volume = 49,
number = 2,
pages = {218--241},
}
@article{dexter1972packing,
title = {Packing densities of mixtures of spheres with log-normal size distributions},
author = {Dexter, AR and Tanner, DW},
year = 1972,
journal = {Nature physical science},
publisher = {Nature Publishing Group},
volume = 238,
number = 80,
pages = 31,
}
@inproceedings{arthur2007k,
title = {k-means++: The advantages of careful seeding},
author = {Arthur, David and Vassilvitskii, Sergei},
year = 2007,
booktitle = {Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms},
pages = {1027--1035},
organization = {Society for Industrial and Applied Mathematics},
}
@inproceedings{sculley2010web,
title = {Web-scale k-means clustering},
author = {Sculley, David},
year = 2010,
booktitle = {Proceedings of the 19th international conference on World wide web},
pages = {1177--1178},
organization = {ACM},
}
@inproceedings{arthur2006slow,
title = {How slow is the k-means method?},
author = {Arthur, David and Vassilvitskii, Sergei},
year = 2006,
booktitle = {Proceedings of the twenty-second annual symposium on Computational geometry},
pages = {144--153},
organization = {ACM},
}
@article{frieze2004fast,
title = {Fast Monte-Carlo algorithms for finding low-rank approximations},
author = {Frieze, Alan and Kannan, Ravi and Vempala, Santosh},
year = 2004,
journal = {Journal of the ACM (JACM)},
publisher = {ACM},
volume = 51,
number = 6,
pages = {1025--1041},
}
@article{soeken2018epfl,
title = {The EPFL logic synthesis libraries},
author = {Soeken, Mathias and Riener, Heinz and Haaswijk, Winston and Testa, Eleonora and Schmitt, Bruno and Meuli, Giulia and Mozafari, Fereshte and De Micheli, Giovanni},
year = 2018,
journal = {arXiv preprint arXiv:1805.05121},
}
@article{herbert2021no,
title = {No quantum speedup with Grover-Rudolph state preparation for quantum Monte Carlo integration},
author = {Herbert, Steven},
year = 2021,
journal = {Physical Review E},
publisher = {APS},
volume = 103,
number = 6,
pages = {063302},
}
@phdthesis{de2020methods,
title = {Methods for optimizing the synthesis of quantum circuits},
author = {de Brugière, Timothée Goubault},
year = 2020,
school = {Universit{\'e} Paris-Saclay},
}
@article{shende2006synthesis,
title = {Synthesis of quantum-logic circuits},
author = {Shende, Vivek V and Bullock, Stephen S and Markov, Igor L},
year = 2006,
journal = {IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems},
publisher = {IEEE},
volume = 25,
number = 6,
pages = {1000--1010},
}
@inproceedings{schmitt2021boolean,
title = {From Boolean functions to quantum circuits: A scalable quantum compilation flow in C++},
author = {Schmitt, Bruno and Mozafari, Fereshte and Meuli, Giulia and Riener, Heinz and De Micheli, Giovanni},
year = 2021,
booktitle = {2021 Design, Automation \& Test in Europe Conference \& Exhibition (DATE)},
pages = {1044--1049},
organization = {IEEE},
}
@inproceedings{kerenidis2019qmeans,
title = {q-means: A quantum algorithm for unsupervised machine learning},
author = {Kerenidis, Iordanis and Landman, Jonas and Luongo, Alessandro and Prakash, Anupam},
year = 2019,
booktitle = {Advances in Neural Information Processing Systems},
pages = {4136--4146},
}
@article{GR02,
title = {Creating superpositions that correspond to efficiently integrable probability distributions},
author = {Grover, Lov and Rudolph, Terry},
year = 2002,
journal = {arXiv preprint quant-ph/0208112},
}
@inproceedings{drineas2002competitive,
title = {Competitive recommendation systems},
author = {Drineas, Petros and Kerenidis, Iordanis and Raghavan, Prabhakar},
year = 2002,
booktitle = {Proceedings of the thiry-fourth annual ACM symposium on Theory of computing},
pages = {82--90},
organization = {ACM},
}
@inproceedings{buhrman2001time,
title = {Time and space bounds for reversible simulation},
author = {Buhrman, Harry and Tromp, John and Vit{\'a}nyi, Paul},
year = 2001,
booktitle = {International Colloquium on Automata, Languages, and Programming},
pages = {1017--1027},
organization = {Springer},
}
@article{bausch2021quantum,
title = {A quantum search decoder for natural language processing},
author = {Bausch, Johannes and Subramanian, Sathyawageeswar and Piddock, Stephen},
year = 2021,
journal = {Quantum Machine Intelligence},
publisher = {Springer},
volume = 3,
number = 1,
pages = {1--24},
}
@phdthesis{hann2021practicality,
title = {Practicality of Quantum Random Access Memory},
author = {Hann, Connor T},
year = 2021,
school = {Yale University},
}
@article{chakraborty2022regularized,
title={Quantum Regularized Least Squares},
author={Chakraborty, Shantanav and Morolia, Aditya and Peduri, Anurudh},
journal={arXiv preprint arXiv:2206.13143},
year={2022}
}
@article{wang2017quantum,
title={Quantum algorithm for linear regression},
author={Wang, Guoming},
journal={Physical review A},
volume={96},
number={1},
pages={012335},
year={2017},
publisher={APS}
}
@article{wiebe2012quantumdatafitting,
title={Quantum algorithm for data fitting},
author={Wiebe, Nathan and Braun, Daniel and Lloyd, Seth},
journal={Physical review letters},
volume={109},
number={5},
pages={050505},
year={2012},
publisher={APS}
}
@article{dervovic2018quantum,
title={Quantum linear systems algorithms: a primer},
author={Dervovic, Danial and Herbster, Mark and Mountney, Peter and Severini, Simone and Usher, Na{\"\i}ri and Wossnig, Leonard},
journal={arXiv preprint arXiv:1802.08227},
year={2018}
}
@article{gribling2021improving,
title={Improving quantum linear system solvers via a gradient descent perspective},
author={Gribling, Sander and Kerenidis, Iordanis and Szil{\'a}gyi, D{\'a}niel},
journal={arXiv preprint arXiv:2109.04248},
year={2021}
}
@inproceedings{CGJ18,
title = {The Power of Block-Encoded Matrix Powers: Improved Regression Techniques via Faster Hamiltonian Simulation},
author = {Chakraborty, Shantanav and Gily{\'e}n, Andr{\'a}s and Jeffery, Stacey},
year = 2019,
journal = {arXiv preprint arXiv:1804.01973},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
organization = {Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik},
}
@article{greenacre1984corranalysis,
title = {Theory and applications of correspondence analysis},
author = {Greenacre, Michael J},
year = 1984,
publisher = {London (UK) Academic Press},
}
@article{deerwester1990indexing,
title = {Indexing by latent semantic analysis},
author = {Deerwester, Scott and Dumais, Susan T and Furnas, George W and Landauer, Thomas K and Harshman, Richard},
year = 1990,
journal = {Journal of the American society for information science},
publisher = {Wiley Online Library},
volume = 41,
number = 6,
pages = {391--407},
doi = {10.1002/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9},
}
@article{ambainis2022matching,
title={Matching Triangles and Triangle Collection: Hardness based on a Weak Quantum Conjecture},
author={Ambainis, Andris and Buhrman, Harry and Leijnse, Koen and Patro, Subhasree and Speelman, Florian},
journal={arXiv preprint arXiv:2207.11068},
year={2022}
}
@article{kuperberg2011another,
title={Another subexponential-time quantum algorithm for the dihedral hidden subgroup problem},
author={Kuperberg, Greg},
journal={arXiv preprint arXiv:1112.3333},
year={2011}
}
@article{KP16,
title = {Quantum Recommendation Systems},
author = {Kerenidis, Iordanis and Prakash, Anupam},
year = 2017,
journal = {Proceedings of the 8th Innovations in Theoretical Computer Science Conference},
}
@inproceedings{hsu2019correspondence,
title = {Correspondence Analysis Using Neural Networks},
author = {Hsu, Hsiang and Salamatian, Salman and Calmon, Flavio P},
year = 2019,
booktitle = {The 22nd International Conference on Artificial Intelligence and Statistics},
pages = {2671--2680},
}
@article{KP18,
title = {A quantum interior point method for {LPs} and {SDPs}},
author = {Kerenidis, Iordanis and Prakash, Anupam},
year = 2018,
journal = {arXiv:1808.09266},
}
@article{tang2018quantum,
title = {Quantum-inspired classical algorithms for principal component analysis and supervised clustering},
author = {Tang, Ewin},
year = 2018,
journal = {arXiv preprint arXiv:1811.00414},
}
@article{tang2018quantum2,
title = {A quantum-inspired classical algorithm for recommendation systems},
author = {Tang, Ewin},
year = 2018,
journal = {arXiv preprint arXiv:1807.04271},