| Year |
Citation |
Score |
| 2022 |
Mosca M, Verschoor SR. Factoring semi-primes with (quantum) SAT-solvers. Scientific Reports. 12: 7982. PMID 35568707 DOI: 10.1038/s41598-022-11687-7 |
0.473 |
|
| 2020 |
Mosca M, Basso JMV, Verschoor SR. On speeding up factoring with quantum SAT solvers. Scientific Reports. 10: 15022. PMID 32929125 DOI: 10.1038/s41598-020-71654-y |
0.408 |
|
| 2020 |
Matteo OD, Gheorghiu V, Mosca M. Fault-Tolerant Resource Estimation of Quantum Random-Access Memories Arxiv: Quantum Physics. 1: 1-13. DOI: 10.1109/Tqe.2020.2965803 |
0.411 |
|
| 2020 |
Nash B, Gheorghiu V, Mosca M. Quantum circuit optimizations for NISQ architectures Quantum Science and Technology. 5: 025010. DOI: 10.1088/2058-9565/Ab79B1 |
0.459 |
|
| 2019 |
Raeisi S, Kieferová M, Mosca M. Novel Technique for Robust Optimal Algorithmic Cooling. Physical Review Letters. 122: 220501. PMID 31283276 DOI: 10.1103/PhysRevLett.122.220501 |
0.626 |
|
| 2018 |
Mosca M. Cybersecurity in an Era with Quantum Computers: Will We Be Ready? Ieee Security & Privacy. 16: 38-41. DOI: 10.1109/MSP.2018.3761723 |
0.375 |
|
| 2016 |
Kliuchnikov V, Maslov D, Mosca M. Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T Circuits Ieee Transactions On Computers. 65: 161-172. DOI: 10.1109/Tc.2015.2409842 |
0.817 |
|
| 2016 |
Matteo OD, Mosca M. Parallelizing quantum circuit synthesis Quantum Science and Technology. 1: 015003. DOI: 10.1088/2058-9565/1/1/015003 |
0.359 |
|
| 2015 |
Laarhoven T, Mosca M, van de Pol J. Finding shortest lattice vectors faster using quantum search. Designs, Codes, and Cryptography. 77: 375-400. PMID 32226228 DOI: 10.1007/s10623-015-0067-5 |
0.471 |
|
| 2015 |
Raeisi S, Mosca M. Asymptotic bound for heat-bath algorithmic cooling. Physical Review Letters. 114: 100404. PMID 25815911 DOI: 10.1103/PhysRevLett.114.100404 |
0.769 |
|
| 2015 |
Arunachalam S, Gheorghiu V, Jochym-O'Connor T, Mosca M, Srinivasan PV. On the robustness of bucket brigade quantum RAM New Journal of Physics. 17. DOI: 10.1088/1367-2630/17/12/123010 |
0.364 |
|
| 2014 |
Gosset D, Kliuchnikov V, Mosca M, Russo V. An algorithm for the T-countAn algorithm for the T-count Quantum Information and Computation. 14: 1261-1276. DOI: 10.26421/QIC14.15-16-1 |
0.777 |
|
| 2014 |
Amy M, Maslov D, Mosca M. Polynomial-time T-depth optimization of Clifford+T circuits via matroid partitioning Ieee Transactions On Computer-Aided Design of Integrated Circuits and Systems. 33: 1476-1489. DOI: 10.1109/Tcad.2014.2341953 |
0.442 |
|
| 2014 |
Ioannou LM, Mosca M. Public-key cryptography based on bounded quantum reference frames Theoretical Computer Science. 560: 33-45. DOI: 10.1016/j.tcs.2014.09.016 |
0.346 |
|
| 2013 |
Kliuchnikov V, Maslov D, Mosca M. Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits. Physical Review Letters. 110: 190502. PMID 23705696 DOI: 10.1103/Physrevlett.110.190502 |
0.812 |
|
| 2013 |
Kliuchnikov V, Maslov D, Mosca M. Fast and efficient exact synthesis of single-qubit unitaries generated by Clifford and T gates Quantum Information and Computation. 13: 607-630. DOI: 10.26421/QIC13.7-8-4 |
0.775 |
|
| 2013 |
Amy M, Maslov D, Mosca M, Roetteler M. A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits Ieee Transactions On Computer-Aided Design of Integrated Circuits and Systems. 32: 818-830. DOI: 10.1109/Tcad.2013.2244643 |
0.58 |
|
| 2013 |
Kliuchnikov V, Maslov D, Mosca M. Asymptotically optimal approximation of single qubit unitaries by clifford and T circuits using a constant number of ancillary qubits Physical Review Letters. 110. DOI: 10.1103/PhysRevLett.110.190502 |
0.812 |
|
| 2010 |
Wei TC, Mosca M, Nayak A. Interacting boson problems can be QMA hard. Physical Review Letters. 104: 040501. PMID 20366692 DOI: 10.1103/Physrevlett.104.040501 |
0.331 |
|
| 2010 |
Ioannou L, Mosca M. Universal quantum computation in a hidden basis Quantum Information and Computation. 10: 541-561. DOI: 10.26421/QIC10.7-8-1 |
0.463 |
|
| 2009 |
McKague M, Mosca M, Gisin N. Simulating quantum systems using real Hilbert spaces. Physical Review Letters. 102: 020505. PMID 19257258 DOI: 10.1103/Physrevlett.102.020505 |
0.332 |
|
| 2009 |
Sheridan L, Maslov D, Mosca M. Approximating fractional time quantum evolution Journal of Physics a: Mathematical and Theoretical. 42. DOI: 10.1088/1751-8113/42/18/185302 |
0.443 |
|
| 2008 |
IOANNOU LM, MOSCA M. LIMITATIONS OF SOME SIMPLE ADIABATIC QUANTUM ALGORITHMS International Journal of Quantum Information. 6: 419-426. DOI: 10.1142/S0219749908003724 |
0.401 |
|
| 2008 |
Maslov D, Falconer SM, Mosca M. Quantum circuit placement Ieee Transactions On Computer-Aided Design of Integrated Circuits and Systems. 27: 752-763. DOI: 10.1109/Tcad.2008.917562 |
0.403 |
|
| 2007 |
van Dam W, D'Ariano GM, Ekert A, Macchiavello C, Mosca M. Optimal quantum circuits for general phase estimation. Physical Review Letters. 98: 090501. PMID 17359143 DOI: 10.1103/Physrevlett.98.090501 |
0.723 |
|
| 2007 |
Van Dam W, Magniez F, Mosca M, Santha M. Self-testing of universal and fault-tolerant sets of quantum gates Siam Journal On Computing. 37: 611-629. DOI: 10.1137/S0097539702404377 |
0.611 |
|
| 2007 |
Van Dam W, D'Ariano GM, Ekert A, MacChiavello C, Mosca M. Optimal phase estimation in quantum networks Journal of Physics a: Mathematical and Theoretical. 40: 7971-7984. DOI: 10.1088/1751-8113/40/28/S07 |
0.741 |
|
| 2006 |
Magniez F, Mayers D, Mosca M, Ollivier H. Self-testing of quantum circuits Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4051: 72-83. DOI: 10.1007/11786986_8 |
0.352 |
|
| 2004 |
MOSCA M, ZALKA C. EXACT QUANTUM FOURIER TRANSFORMS AND DISCRETE LOGARITHM ALGORITHMS International Journal of Quantum Information. 2: 91-100. DOI: 10.1142/S0219749904000109 |
0.505 |
|
| 2001 |
Beals R, Buhrman H, Cleve R, Mosca M, De Wolf R. Quantum lower bounds by polynomials Journal of the Acm. 48: 778-797. DOI: 10.1145/502090.502097 |
0.517 |
|
| 2001 |
Mosca M. Counting by quantum eigenvalue estimation Theoretical Computer Science. 264: 139-153. DOI: 10.1016/S0304-3975(00)00217-6 |
0.329 |
|
| 2001 |
Van Dam W, Mosca M, Vazirani U. How powerful is adiabatic quantum computation? Annual Symposium On Foundations of Computer Science - Proceedings. 279-287. |
0.745 |
|
| 2000 |
Mosca M, Jozsa R, Steane A, Ekert A. Quantum-enhanced information processing Philosophical Transactions of the Royal Society a: Mathematical, Physical and Engineering Sciences. 358: 261-279. |
0.612 |
|
| 1999 |
Jones JA, Hansen RH, Mosca M. Quantum logic gates and nuclear magnetic resonance pulse sequences. Journal of Magnetic Resonance (San Diego, Calif. : 1997). 135: 353-60. PMID 9878463 DOI: 10.1006/jmre.1998.1606 |
0.391 |
|
| 1999 |
Jones JA, Mosca M. Approximate Quantum Counting on an NMR Ensemble Quantum Computer Physical Review Letters. 83: 1050-1053. DOI: 10.1103/PhysRevLett.83.1050 |
0.369 |
|
| 1999 |
Mosca M, Ekert A. The hidden subgroup problem and eigenvalue estimation on a quantum computer Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1509: 174-188. |
0.616 |
|
| 1998 |
Cleve R, Ekert A, Macchiavello C, Mosca M. Quantum algorithms revisited Proceedings of the Royal Society a: Mathematical, Physical and Engineering Sciences. 454: 339-354. DOI: 10.1098/Rspa.1998.0164 |
0.727 |
|
| 1998 |
Jones JA, Mosca M. Implementation of a quantum algorithm on a nuclear magnetic resonance quantum computer The Journal of Chemical Physics. 109: 1648-1653. DOI: 10.1063/1.476739 |
0.434 |
|
| 1998 |
Jones JA, Mosca M, Hansen RH. Implementation of a quantum search algorithm on a quantum computer Nature. 393: 344-346. DOI: 10.1038/30687 |
0.509 |
|
| 1998 |
Cleve R, Ekert A, Henderson L, Macchiavello C, Mosca M. On quantum algorithms Complexity. 4: 33-42. DOI: 10.1002/(Sici)1099-0526(199809/10)4:1<33::Aid-Cplx10>3.3.Co;2-L |
0.737 |
|
| Show low-probability matches. |