1. Research
  2. Publications

Publications

Export 169 results:
Author Title [ Type(Desc)] Year
Filters: First Letter Of Title is Q  [Clear All Filters]
Journal Article
S. P. Jordan, Lee, K. S. M., and Preskill, J., “Quantum Algorithms for Fermionic Quantum Field Theories”, 2014.
S. Jeffery and Kimmel, S., “Quantum Algorithms for Graph Connectivity and Formula Evaluation”, 2017.
A. M. Childs, Schulman, L. J., and Vazirani, U. V., “Quantum algorithms for hidden nonlinear structures”, 2007.
G. Alagic and Bering, E. A., “Quantum Algorithms for Invariants of Triangulated Manifolds”, Quantum Info. Comput. Vol. , vol. 12, no. 9-10, pp. 843-863, 2012.
S. P. Jordan, Lee, K. S. M., and Preskill, J., “Quantum Algorithms for Quantum Field Theories”, Science, vol. 336, no. 6085, pp. 1130 - 1133, 2012.
D. Wang, Sundaram, A., Kothari, R., Kapoor, A., and Roetteler, M., “Quantum Algorithms for Reinforcement Learning with a Generative Model”, Proceedings of the 38th International Conference on Machine Learning, PMLR, vol. 139, 2021.
A. M. Childs, Li, T., Liu, J. - P., Wang, C., and Zhang, R., “Quantum Algorithms for Sampling Log-Concave Distributions and Estimating Normalizing Constants”, Advances in Neural Information Processing Systems (NeurIPS 2022), vol. 35, no. 23205, 2022.
G. Alagic, Moore, C., and Russell, A., “Quantum Algorithms for Simon’s Problem over General Groups”, SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 1217–1224, 2007.
G. Alagic, Moore, C., and Russell, A., “Quantum Algorithms for Simon’s Problem over Nonabelian Groups”, ACM Trans. Algorithms, vol. 6, no. 1, 2010.
J. D. Watson, Bringewatt, J., Shaw, A. F., Childs, A. M., Gorshkov, A. V., and Davoudi, Z., “Quantum Algorithms for Simulating Nuclear Effective Field Theories”, 2023.
A. F. Shaw, Lougovski, P., Stryker, J. R., and Wiebe, N., “Quantum Algorithms for Simulating the Lattice Schwinger Model”, Quantum, vol. 4, no. 306, 2020.
A. M. Childs and Eisenberg, J. M., “Quantum algorithms for subset finding”, 2003.
C. Shao and Liu, J. - P., “Quantum algorithms for the polynomial eigenvalue problems”, 2020.
Y. - K. Liu, “Quantum Algorithms Using the Curvelet Transform”, Proc. ACM Symposium on Theory of Computing (STOC), pp. 391-400, 2009.
G. Pagano, Bapat, A., Becker, P., Collins, K. S., De, A., Hess, P. W., Kaplan, H. B., Kyprianidis, A., Tan, W. L., Baldwin, C. L., Brady, L. T., Deshpande, A., Liu, F., Jordan, S., Gorshkov, A. V., and Monroe, C., “Quantum Approximate Optimization with a Trapped-Ion Quantum Simulator”, 2019.
K. Mitra, Strauch, F. W., Lobb, C. J., Anderson, J. R., Wellstood, F. C., and Tiesinga, E., “Quantum behavior of the dc SQUID phase qubit”, Physical Review B, vol. 77, no. 21, 2008.
J. Bub, “The quantum bit commitment theorem”, 2000.
P. Richerme, Senko, C., Korenblit, S., Smith, J., Lee, A., Islam, R., Campbell, W. C., and Monroe, C., “Quantum Catalysis of Magnetic Phase Transitions in a Quantum Simulator”, Physical Review Letters, vol. 111, no. 10, 2013.
B. Augustino, Leng, J., Nannicini, G., Terlaky, T., and Wu, X., “A quantum central path algorithm for linear optimization”, 2023.
K. Fang, Wang, X., Tomamichel, M., and Berta, M., “Quantum Channel Simulation and the Channel's Smooth Max-Information”, 2018.
M. F. Maghrebi, Golestanian, R., and Kardar, M., “Quantum Cherenkov Radiation and Non-contact Friction”, Physical Review A, vol. 88, no. 4, 2013.
G. Alagic, Jeffery, S., Ozols, M., and Poremba, A., “On Quantum Chosen-Ciphertext Attacks and Learning with Errors”, Cryptography, vol. 4, no. 1, p. 10, 2020.
F. Witteveen, Scholz, V., Swingle, B., and Walter, M., “Quantum circuit approximations and entanglement renormalization for the Dirac field in 1+1 dimensions”, 2019.
S. Singh, C. Alderete, H., Balu, R., Monroe, C., Linke, N. M., and Chandrashekar, C. M., “Quantum circuits for the realization of equivalent forms of one-dimensional discrete-time quantum walks on near-term quantum hardware”, Physical Review A, vol. 104, 2021.
M. Gullans, Krastanov, S., Huse, D. A., Jiang, L., and Flammia, S. T., “Quantum coding with low-depth random circuits”, 2020.