Квантна надмоћ (Serbian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Квантна надмоћ" in Serbian language version.

refsWebsite

Global rank Serbian rank

12doi.org

2^nd place

4^th place

10arxiv.org

69^th place

240^th place

8harvard.edu

18^th place

28^th place

7worldcat.org

5^th place

12^th place

4nih.gov

4^th place

8^th place

3aps.org

1,503^rd place

1,710^th place

2ieee.org

652^nd place

1,147^th place

2nature.com

234^th place

287^th place

2acm.org

1,185^th place

1,193^rd place

2springer.com

274^th place

510^th place

1siam.org

low place

1newscientist.com

774^th place

710^th place

1umbc.edu

low place

1web.archive.org

1^st place

1nist.gov

355^th place

258^th place

1sciencemag.org

857^th place

569^th place

acm.org

doi.acm.org

Babai, László; Beals, Robert; Seress, Ákos (2009). „Polynomial-time Theory of Matrix Groups”. Proceedings of the Forty-first Annual ACM Symposium on Theory of Computing. STOC '09. New York, NY, USA: ACM: 55—64. ISBN 9781605585062. doi:10.1145/1536414.1536425.
Rivest, R. L.; Shamir, A.; Adleman, L. (фебруар 1978). „A Method for Obtaining Digital Signatures and Public-key Cryptosystems”. Commun. ACM. 21 (2): 120—126. ISSN 0001-0782. doi:10.1145/359340.359342.

aps.org

link.aps.org

Rahimi-Keshari, Saleh; Ralph, Timothy C.; Caves, Carlton M. (20. 6. 2016). „Sufficient Conditions for Efficient Classical Simulation of Quantum Optics”. Physical Review X. 6 (2): 021039. Bibcode:2016PhRvX...6b1039R. doi:10.1103/PhysRevX.6.021039.
Shor, Peter W. (1. 10. 1995). „Scheme for reducing decoherence in quantum computer memory”. Physical Review A. 52 (4): R2493—R2496. Bibcode:1995PhRvA..52.2493S. doi:10.1103/PhysRevA.52.R2493.
Steane, A. M. (29. 7. 1996). „Error Correcting Codes in Quantum Theory”. Physical Review Letters. 77 (5): 793—797. Bibcode:1996PhRvL..77..793S. PMID 10062908. doi:10.1103/PhysRevLett.77.793.

arxiv.org

Preskill, John (26. 3. 2012). „Quantum computing and the entanglement frontier”. arXiv:1203.5813  [quant-ph].
Papageorgiou, Anargyros; Traub, Joseph F. (12. 8. 2013). „Measures of quantum computing speedup”. Physical Review A. 88 (2): 022316. Bibcode:2013PhRvA..88b2316P. ISSN 1050-2947. arXiv:1307.7488 . doi:10.1103/PhysRevA.88.022316.
Tereza, Tusarova (26. 9. 2004). „Quantum Complexity Classes” (на језику: енглески). arXiv:cs/0409051v1 .
Bremner, Michael J.; Montanaro, Ashley; Shepherd, Dan J. (18. 8. 2016). „Average-case complexity versus approximate simulation of commuting quantum computations”. Physical Review Letters. 117 (8): 080501. Bibcode:2016PhRvL.117h0501B. ISSN 0031-9007. PMID 27588839. arXiv:1504.07999 . doi:10.1103/PhysRevLett.117.080501.
Rubinstein, Michael (19. 10. 2006). „The distribution of solutions to xy = N mod a with an application to factoring integers”. arXiv:math/0610612 .
Clifford, Peter; Clifford, Raphaël (5. 6. 2017). „The Classical Complexity of Boson Sampling”. arXiv:1706.01260  [cs.DS].
Kalai, Gil (2. 6. 2011). „How Quantum Computers Fail: Quantum Codes, Correlations in Physical Systems, and Noise Accumulation”. arXiv:1106.0485  [quant-ph].
Aharonov, Dorit; Ben-Or, Michael (30. 6. 1999). „Fault-Tolerant Quantum Computation With Constant Error Rate”. arXiv:quant-ph/9906129 .
Kalai, Gil (3. 5. 2016). „The Quantum Computer Puzzle (Expanded Version)”. arXiv:1605.00992  [quant-ph].
Dyakonov 2007, стр. 4–18 Dyakonov, M. I. (2007). „Is Fault-Tolerant Quantum Computation Really Possible?”. Ур.: S. Luryi, J. Xu, and A. Zaslavsky. Future Trends in Microelectronics. Up the Nano Creek. Wiley. стр. 4—18. arXiv:quant-ph/0610117 .

doi.org

Papageorgiou, Anargyros; Traub, Joseph F. (12. 8. 2013). „Measures of quantum computing speedup”. Physical Review A. 88 (2): 022316. Bibcode:2013PhRvA..88b2316P. ISSN 1050-2947. arXiv:1307.7488 . doi:10.1103/PhysRevA.88.022316.
Shor, P. (1. 1. 1999). „Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer”. SIAM Review. 41 (2): 303—332. Bibcode:1999SIAMR..41..303S. ISSN 0036-1445. doi:10.1137/S0036144598347011.
Watrous, John (2009). Ph. D, Robert A. Meyers, ур. Encyclopedia of Complexity and Systems Science (на језику: енглески). Springer New York. стр. 7174—7201. ISBN 9780387758886. doi:10.1007/978-0-387-30440-3_428.
Lund, A. P.; Bremner, Michael J.; Ralph, T. C. (13. 4. 2017). „Quantum sampling problems, BosonSampling and quantum supremacy”. Npj Quantum Information (на језику: енглески). 3 (1): 15. Bibcode:2017npjQI...3...15L. ISSN 2056-6387. doi:10.1038/s41534-017-0018-2.
Bremner, Michael J.; Montanaro, Ashley; Shepherd, Dan J. (18. 8. 2016). „Average-case complexity versus approximate simulation of commuting quantum computations”. Physical Review Letters. 117 (8): 080501. Bibcode:2016PhRvL.117h0501B. ISSN 0031-9007. PMID 27588839. arXiv:1504.07999 . doi:10.1103/PhysRevLett.117.080501.
Babai, László; Beals, Robert; Seress, Ákos (2009). „Polynomial-time Theory of Matrix Groups”. Proceedings of the Forty-first Annual ACM Symposium on Theory of Computing. STOC '09. New York, NY, USA: ACM: 55—64. ISBN 9781605585062. doi:10.1145/1536414.1536425.
Rivest, R. L.; Shamir, A.; Adleman, L. (фебруар 1978). „A Method for Obtaining Digital Signatures and Public-key Cryptosystems”. Commun. ACM. 21 (2): 120—126. ISSN 0001-0782. doi:10.1145/359340.359342.
Rahimi-Keshari, Saleh; Ralph, Timothy C.; Caves, Carlton M. (20. 6. 2016). „Sufficient Conditions for Efficient Classical Simulation of Quantum Optics”. Physical Review X. 6 (2): 021039. Bibcode:2016PhRvX...6b1039R. doi:10.1103/PhysRevX.6.021039.
Carolan, Jacques; Harrold, Christopher; Sparrow, Chris; Martín-López, Enrique; Russell, Nicholas J.; Silverstone, Joshua W.; Shadbolt, Peter J.; Matsuda, Nobuyuki; Oguma, Manabu (14. 8. 2015). „Universal linear optics”. Science (на језику: енглески). 349 (6249): 711—716. ISSN 0036-8075. PMID 26160375. doi:10.1126/science.aab3642.
Shor, Peter W. (1. 10. 1995). „Scheme for reducing decoherence in quantum computer memory”. Physical Review A. 52 (4): R2493—R2496. Bibcode:1995PhRvA..52.2493S. doi:10.1103/PhysRevA.52.R2493.
Steane, A. M. (29. 7. 1996). „Error Correcting Codes in Quantum Theory”. Physical Review Letters. 77 (5): 793—797. Bibcode:1996PhRvL..77..793S. PMID 10062908. doi:10.1103/PhysRevLett.77.793.
Knill, E. (3. 3. 2005). „Quantum computing with realistically noisy devices”. Nature (на језику: енглески). 434 (7029): 39—44. Bibcode:2005Natur.434...39K. ISSN 0028-0836. PMID 15744292. doi:10.1038/nature03350.

harvard.edu

adsabs.harvard.edu

Papageorgiou, Anargyros; Traub, Joseph F. (12. 8. 2013). „Measures of quantum computing speedup”. Physical Review A. 88 (2): 022316. Bibcode:2013PhRvA..88b2316P. ISSN 1050-2947. arXiv:1307.7488 . doi:10.1103/PhysRevA.88.022316.
Shor, P. (1. 1. 1999). „Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer”. SIAM Review. 41 (2): 303—332. Bibcode:1999SIAMR..41..303S. ISSN 0036-1445. doi:10.1137/S0036144598347011.
Lund, A. P.; Bremner, Michael J.; Ralph, T. C. (13. 4. 2017). „Quantum sampling problems, BosonSampling and quantum supremacy”. Npj Quantum Information (на језику: енглески). 3 (1): 15. Bibcode:2017npjQI...3...15L. ISSN 2056-6387. doi:10.1038/s41534-017-0018-2.
Bremner, Michael J.; Montanaro, Ashley; Shepherd, Dan J. (18. 8. 2016). „Average-case complexity versus approximate simulation of commuting quantum computations”. Physical Review Letters. 117 (8): 080501. Bibcode:2016PhRvL.117h0501B. ISSN 0031-9007. PMID 27588839. arXiv:1504.07999 . doi:10.1103/PhysRevLett.117.080501.
Rahimi-Keshari, Saleh; Ralph, Timothy C.; Caves, Carlton M. (20. 6. 2016). „Sufficient Conditions for Efficient Classical Simulation of Quantum Optics”. Physical Review X. 6 (2): 021039. Bibcode:2016PhRvX...6b1039R. doi:10.1103/PhysRevX.6.021039.
Shor, Peter W. (1. 10. 1995). „Scheme for reducing decoherence in quantum computer memory”. Physical Review A. 52 (4): R2493—R2496. Bibcode:1995PhRvA..52.2493S. doi:10.1103/PhysRevA.52.R2493.
Steane, A. M. (29. 7. 1996). „Error Correcting Codes in Quantum Theory”. Physical Review Letters. 77 (5): 793—797. Bibcode:1996PhRvL..77..793S. PMID 10062908. doi:10.1103/PhysRevLett.77.793.
Knill, E. (3. 3. 2005). „Quantum computing with realistically noisy devices”. Nature (на језику: енглески). 434 (7029): 39—44. Bibcode:2005Natur.434...39K. ISSN 0028-0836. PMID 15744292. doi:10.1038/nature03350.

ieee.org

spectrum.ieee.org

„Google Plans to Demonstrate the Supremacy of Quantum Computing”. IEEE Spectrum: Technology, Engineering, and Science News (на језику: енглески). Приступљено 11. 1. 2018.
„CES 2018: Intel's 49-Qubit Chip Shoots for Quantum Supremacy”. IEEE Spectrum: Technology, Engineering, and Science News (на језику: енглески). Приступљено 22. 7. 2017.

nature.com

Lund, A. P.; Bremner, Michael J.; Ralph, T. C. (13. 4. 2017). „Quantum sampling problems, BosonSampling and quantum supremacy”. Npj Quantum Information (на језику: енглески). 3 (1): 15. Bibcode:2017npjQI...3...15L. ISSN 2056-6387. doi:10.1038/s41534-017-0018-2.
Knill, E. (3. 3. 2005). „Quantum computing with realistically noisy devices”. Nature (на језику: енглески). 434 (7029): 39—44. Bibcode:2005Natur.434...39K. ISSN 0028-0836. PMID 15744292. doi:10.1038/nature03350.

newscientist.com

„Google’s quantum computing plans threatened by IBM curveball”. 20. 10. 2017. Приступљено 22. 10. 2017.

nih.gov

ncbi.nlm.nih.gov

Bremner, Michael J.; Montanaro, Ashley; Shepherd, Dan J. (18. 8. 2016). „Average-case complexity versus approximate simulation of commuting quantum computations”. Physical Review Letters. 117 (8): 080501. Bibcode:2016PhRvL.117h0501B. ISSN 0031-9007. PMID 27588839. arXiv:1504.07999 . doi:10.1103/PhysRevLett.117.080501.
Carolan, Jacques; Harrold, Christopher; Sparrow, Chris; Martín-López, Enrique; Russell, Nicholas J.; Silverstone, Joshua W.; Shadbolt, Peter J.; Matsuda, Nobuyuki; Oguma, Manabu (14. 8. 2015). „Universal linear optics”. Science (на језику: енглески). 349 (6249): 711—716. ISSN 0036-8075. PMID 26160375. doi:10.1126/science.aab3642.
Steane, A. M. (29. 7. 1996). „Error Correcting Codes in Quantum Theory”. Physical Review Letters. 77 (5): 793—797. Bibcode:1996PhRvL..77..793S. PMID 10062908. doi:10.1103/PhysRevLett.77.793.
Knill, E. (3. 3. 2005). „Quantum computing with realistically noisy devices”. Nature (на језику: енглески). 434 (7029): 39—44. Bibcode:2005Natur.434...39K. ISSN 0028-0836. PMID 15744292. doi:10.1038/nature03350.

nist.gov

math.nist.gov

Jordan, Stephen. „Quantum Algorithm Zoo”. math.nist.gov (на језику: енглески). Архивирано из оригинала 29. 4. 2018. г. Приступљено 29. 7. 2017.

sciencemag.org

science.sciencemag.org

Carolan, Jacques; Harrold, Christopher; Sparrow, Chris; Martín-López, Enrique; Russell, Nicholas J.; Silverstone, Joshua W.; Shadbolt, Peter J.; Matsuda, Nobuyuki; Oguma, Manabu (14. 8. 2015). „Universal linear optics”. Science (на језику: енглески). 349 (6249): 711—716. ISSN 0036-8075. PMID 26160375. doi:10.1126/science.aab3642.

siam.org

epubs.siam.org

Shor, P. (1. 1. 1999). „Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer”. SIAM Review. 41 (2): 303—332. Bibcode:1999SIAMR..41..303S. ISSN 0036-1445. doi:10.1137/S0036144598347011.

springer.com

link.springer.com

Watrous, John (2009). Ph. D, Robert A. Meyers, ур. Encyclopedia of Complexity and Systems Science (на језику: енглески). Springer New York. стр. 7174—7201. ISBN 9780387758886. doi:10.1007/978-0-387-30440-3_428.

springer.com

Bernstein, Daniel (2009). Post-Quantum Cryptography (на језику: енглески). Springer. ISBN 978-3-540-88701-0.

umbc.edu

csee.umbc.edu

Vazirani, Umesh. „A Survey of Quantum Complexity Theory” (PDF). Proceedings of Symposia in Applied Mathematics.

web.archive.org

Jordan, Stephen. „Quantum Algorithm Zoo”. math.nist.gov (на језику: енглески). Архивирано из оригинала 29. 4. 2018. г. Приступљено 29. 7. 2017.

worldcat.org

Papageorgiou, Anargyros; Traub, Joseph F. (12. 8. 2013). „Measures of quantum computing speedup”. Physical Review A. 88 (2): 022316. Bibcode:2013PhRvA..88b2316P. ISSN 1050-2947. arXiv:1307.7488 . doi:10.1103/PhysRevA.88.022316.
Shor, P. (1. 1. 1999). „Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer”. SIAM Review. 41 (2): 303—332. Bibcode:1999SIAMR..41..303S. ISSN 0036-1445. doi:10.1137/S0036144598347011.
Lund, A. P.; Bremner, Michael J.; Ralph, T. C. (13. 4. 2017). „Quantum sampling problems, BosonSampling and quantum supremacy”. Npj Quantum Information (на језику: енглески). 3 (1): 15. Bibcode:2017npjQI...3...15L. ISSN 2056-6387. doi:10.1038/s41534-017-0018-2.
Bremner, Michael J.; Montanaro, Ashley; Shepherd, Dan J. (18. 8. 2016). „Average-case complexity versus approximate simulation of commuting quantum computations”. Physical Review Letters. 117 (8): 080501. Bibcode:2016PhRvL.117h0501B. ISSN 0031-9007. PMID 27588839. arXiv:1504.07999 . doi:10.1103/PhysRevLett.117.080501.
Rivest, R. L.; Shamir, A.; Adleman, L. (фебруар 1978). „A Method for Obtaining Digital Signatures and Public-key Cryptosystems”. Commun. ACM. 21 (2): 120—126. ISSN 0001-0782. doi:10.1145/359340.359342.
Carolan, Jacques; Harrold, Christopher; Sparrow, Chris; Martín-López, Enrique; Russell, Nicholas J.; Silverstone, Joshua W.; Shadbolt, Peter J.; Matsuda, Nobuyuki; Oguma, Manabu (14. 8. 2015). „Universal linear optics”. Science (на језику: енглески). 349 (6249): 711—716. ISSN 0036-8075. PMID 26160375. doi:10.1126/science.aab3642.
Knill, E. (3. 3. 2005). „Quantum computing with realistically noisy devices”. Nature (на језику: енглески). 434 (7029): 39—44. Bibcode:2005Natur.434...39K. ISSN 0028-0836. PMID 15744292. doi:10.1038/nature03350.