| Shang Yu, Jia Zhian, Aonan Zhang, Ewan Mer, Zhenghao Li, Valerio Crescimanna, Kuan-Cheng Chen, Raj B. Patel, Ian A. Walmsley, D. Kaszlikowski (2024). Shedding light on the future: exploring quantum neural networks through optics. Advanced Quantum Technologies 202400074 1-10 |
 |
| J. Lumbreras, M. Tomamichel (2024). Linear bandits with polylogarithmic minimax regret. Proceedings of Conference on Learning Theory 247 39 |
|
| Ioannis D. Leonidas, Alexander Dukakis, Benjamin Tan, D.G. Angelakis (2024). Qubit Efficient Quantum Algorithms for the Vehicle Routing Problem on Noisy Intermediate-Scale Quantum Processors. Advanced Quantum Technologies 7 2300309 |
|
| Elias X. Huber, Benjamin Y. L. Tan, Paul R. Griffin, D.G. Angelakis (2024). Exponential Qubit Reduction in Optimization for Financial Transaction Settlement. EPJ Quantum Technology 11 52 |
|
| C.H. Chee, Adrian M. Mak, L.Daniel, Panagiotis Kl. Barkoutsos, D.G. Angelakis (2024). Computing Electronic Correlation Energies using Linear Depth Quantum Circuits. Quantum Science and Technology 9 025003 |
|
| W.Z. Lau, K.H. Lim, Kishor Bharti, L.C. Kwek, S. Vinjanampathy (2023). Convex optimization for non-equilibrium steady states on a hybrid quantum processor. Phys. Rev. Lett. 130 240601 |
|
| Kang-Da Wu, Chengran Yang, Ren-Dong He, M. Gu, Guo-Yong Xiang, Chuan-Feng Li, Guang-Can Guo, Thomas J. Elliott (2023). Implementing quantum dimensionality reduction for non-Markovian stochastic simulation. Nature Communications 14 2624 |
|
| W. Tian, Wee Wen Jun, Qu An, J. M. Lim, Prithvi Raj Datla, K.P.W.Vanessa , Koh Pei Wen Vanessa , H.Loh (2023). Parallel assembly of arbitrary defect-free atom arrays with a multi-tweezer algorithm. Physical Review Applied 19 034048 |
|
| J. Jirawat Tangpanitanon, J. Tangpanitanon, S. Thanasilp, Marc-Antoine Lemonde, Ninnat Dangniam, D.G. Angelakis (2023). Signatures of a sampling quantum advantage in driven quantum many-body systems. Quantum Science and Technology 8 025019 |
|
| W.Y Suen, Matthieu Parizy, Lau Hoong Chuin (2022). Enhancing a QUBO solver via Data Driven Multi-start and its Application to Vehicle Routing Problem. GECCO |
|
| B.Y. Gan, L.Daniel, D.G. Angelakis (2022). Fock State-enhanced Expressivity of Quantum Machine Learning Models. EPJ Quantum Technology 9 16 |
|
| J. Lumbreras, Erkka Haapasalo, M. Tomamichel (2022). Multi-armed quantum bandits: Exploration versus exploitation when learning properties of quantum states. Quantum 06 749 |
|
| K. Bharti, Alba Cervera-Lierta, Thi Ha Kyaw, Tobias Haug, Sumner Alperin-Lea, Abhinav Anand, Matthias Degroote, Hermanni Heimonen, Jakob S. Kottmann, Tim Menke, Wai-Keong Mok, Sukin Sim, Leong-Chuan Kwek, Alán Aspuru-Guzik (2022). Noisy intermediate-scale quantum (NISQ) algorithms. Rev. Mod. Phys. 94 015004 |
|
| W.Y Suen, Lee Chun Yat, Lau Hoong Chuin (2021). Quantum-inspired Algorithm for Vehicle Sharing Problem. IEEE Quantum Week |
|
| T. Haug, K. Bharti, M. S. Kim (2021). Capacity and quantum geometry of parametrized quantum circuits. PRX Quantum 2 040309 |
|
| Benjamin Tan, Marc-Antoine Lemonde, S. Thanasilp, J. Jirawat Tangpanitanon, J. Tangpanitanon, D.G. Angelakis (2021). Qubit-efficient encoding schemes for binary optimisation problems. Quantum 5 454 |
|
| Ayan Mahalanobis, Upendra Kapshikar (2021). Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling. Advances in Mathematics of Communications (AMC) |
|
| B.-G. Englert, Michael Evans, Gun Ho Jang, H.K. Ng, David Nott, Y.L Seah (2021). Checking the Model and the Prior for the Constrained Multinomial. Metrika |
|
| Sergey Bravyi, Robert Koenig, David Gosset, M. Tomamichel (2020). Quantum advantage with noisy shallow circuits. Nature Physics 16 1040–104 |
|
| D. Gavinsky, R. Jain, T. Lee, M. Santha, Swagato Sanyal, Jevgenijs Vihrovs, D. Gavinsky, H. Klauck, S.Kundu, T. Lee (2020). Quadratically Tight Relations for Randomized Query Complexity. Theory of Computing Systems 64 101-119 |
|
| Adrián Pérez-Salinas, Alba Cervera-Lierta, Elies Gil-Fuster, J. I. Latorre (2020). Data re-uploading for a universal quantum classifier. Quantum 4 226 |
|
| Carlos Bravo-Prieto, J. Lumbreras, Luca Tagliacozzo, J. I. Latorre (2020). Scaling of variational quantum circuit depth for condensed matter systems. Quantum 4 272 |
|
| J. Jirawat Tangpanitanon, J. Tangpanitanon, S. Thanasilp, Ninnat Dangniam, Marc-Antoine Lemonde, D.G. Angelakis (2020). Expressibility and trainability of parameterized analog quantum systems for machine learning applications. Physical Review Research 2 043364 |
|
| Benjamin Jaderberg, Abhishek Agarwal, Karsten Leonhardt, M. Kiffner, D. Jaksch (2020). Minimum Hardware Requirements for Hybrid Quantum-Classical DMFT. Quantum Science and Technology 5 034015 |
|
| Michael Lubasch, Jaewoo Joo, Pierre Moinier, M. Kiffner, D. Jaksch (2020). Variational Quantum Algorithms for Nonlinear Problems. Phys. Rev. A (R) 101 010301(R) |
|
| Youming Qiao, G. Ivanyos (2019). Algorithms based on *-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing. SIAM Journal of Computing 48 926-963 |
|
| Péter Kutas, Lajos Rónyai, G. Ivanyos (2019). Explicit equivalence of quadratic forms over $\\\\mathbb{F}_q(t)$. Finite Fields and Their Applications 55 33--63 |
|
| Yassine Hamoudi, R.Patrick, Ansis Rosmanis, M. Santha (2019). Quantum and Classical Algorithms for Approximate Submodular Function Minimization. Quantum Information and Computation 19 1325-1349 |
|
| Alba Cervera-Lierta, J. I. Latorre, Dardo Goyeneche (2019). Quantum circuits for maximally entangled states. Phys. Rev. A 100 022342 |
|
| R.Patrick, Maria Schuld, Leonard Wossnig, Francesco Petruccione, Seth Lloyd (2019). Quantum gradient descent and Newton\'s method for constrained polynomial optimization. New J. Phys. |
|
| Gábor Ivanyos, Youming Qiao (2019). Algorithms based on *-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing. SIAM Journal of Computing |
|
| Gábor Ivanyos, Péter Kutas, Lajos Rónyai (2019). Explicit equivalence of quadratic forms over $\\\\mathbb{F}_q(t)$. Finite Fields and Their Applications |
|
| François Le Gall, Harumichi Nishimura, Ansis Rosmanis (2019). Quantum Advantage for the LOCAL Model in Distributed Computing. Proceedings of STACS |
|
| Eyal Bairey, I. Arad, Netanel H. Lindner (2019). Learning a local Hamiltonian from local measurements. Phys. Rev. Lett. |
|
| T. Lee, M. Santha, T. Lee, M.Ray (2019). Strategies for quantum races. ITCS 14 |
|
| Gábor Ivanyos, Péter Kutas, Lajos Rónyai (2019). Explicit equivalence of quadratic forms over $\\mathbb{F}_q(t)$. Finite Fields and Their Applications 55 33-63 |
|
| Péter Kutas, Lajos Rónyai, G. Ivanyos (2018). Computing explicit isomorphisms with full matrix algebras over $\\\\mathbb{F}_q(x)$. Foundations of Computational Mathematics 18 381-397 |
|
| Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, M. Santha, Aarthi Sundaram (2018). On the Complexity of Trial and Error for Constraint Satisfaction Problems. Journal of Computer and System Sciences 92 48-64 |
|
| D. Aggarwal, Gavin K. Brennen, T. Lee, M. Santha, M. Tomamichel, T. Lee (2018). Quantum attacks on Bitcoin, and how to protect against them. Ledger 3 |
|
| Sevag Gharibian, M. Santha, Jamie Sikora, Aarthi Sundaram, Justin Yirka (2018). Quantum generalizations of the polynomial hierarchy with applications to QMA(2). International Symposium MFCS 1-16 |
|
| Gábor Ivanyos, Péter Kutas, Lajos Rónyai (2018). Computing explicit isomorphisms with full matrix algebras over $\mathbb{F}_q(x)$. Foundations of Computational Mathematics 18 381-397 |
|
| D. Aggarwal, Gavin K. Brennen, T. Lee, M. Santha, M. Tomamichel, T. Lee (2018). Quantum attacks on Bitcoin, and how to protect against them. Ledger |
|
| I. Arad, M. Santha, Aarthi Sundaram, Shengyu Zhang (2018). Linear time algorithm for quantum 2SAT. Theory of Computing 1-27 |
|
| G. Ivanyos, Y. Qiao (2018). Algorithms based on *-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing. ACM SIAM SODA 2357-2376 |
|
| M. Kiffner, D. Jaksch, Davide Ceresoli (2018). A polynomial Ansatz for Norm-conserving Pseudopotentials. J. Phys.: Condens. Matter 30 275501 |
|
| Youming Qiao, G. Ivanyos (2018). Algorithms based on *-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing. Symposium on Discrete Algorithms 2357-2376 |
|
| K.T. Goh, J. Kaniewski, Elie Wolfe, Tamas Vertesi, X. Wu, Y. Cai, Yeong-Cherng Liang, V. Scarani (2018). Geometry of the quantum set of correlations. Phys. Rev. A 97 022104 |
|
| Mika Goos, R. Jain, Thomas Watson (2018). Extension Complexity of Independent Set Polytopes. SIAM Journal of Computing 47 241–269 |
|
| T. Lee, Juris Smotrovs, M. Santha, Kaspars Balodis, Andris Ambainis, Aleksandrs Belovs, T. Lee (2017). Separations in Query Complexity Based on Pointer Functions. JACM 64 |
|
| A. Anshu, A. Anshu, V. Krishna, R. Jain (2017). Quantum Communication Using Coherent Rejection Sampling. Phys. Rev. Lett. 119 120506 |
|
| J. Shang, Zhengyun Zhang, H.K. Ng (2017). Superfast maximum likelihood reconstruction for quantum tomography. Phys. Rev. A 95 062336 |
|
| G. Ivanyos, M. Santha (2017). On solving systems of diagonal polynomial equations over finite fields. Theoretical Computer Science 657 73-85 |
|
| R. Jain, Z.H. Wei, Penghui Yao, S. Zhang (2017). Multipartite Quantum Correlation and Communication Complexities. Computational Complexity 26 199--228 |
|
| D. Aggarwal, O. Regev (2016). A Note on Discrete Gaussian Combinations of Lattice Vectors. CJTCS 1 |
|
| A. Anshu, A. Anshu, R. Jain, P. Mukhopadhyay, Ala Shayeghi, P. Yao (2016). New One Shot Quantum Protocols With Application to Communication Complexity. IEEE Trans. Inf. 62 7566 - 757 |
|
| Andris Ambainis, Kaspars Balodis, Aleksandrs Belovs, T. Lee, T. Lee, M. Santha, Juris Smotrovs (2016). Separation in query complexity based on pointer functions. Proceedings of ACM STOC 800-813 |
|
| H.S. Poh, Marcin Markiewicz, Pawel Kurzynski, A. Cere, D. Kaszlikowski, C. Kurtsiefer (2016). Probing the quantum-classical boundary with compression software. New J. Phys. 18 035011 |
|
| D. Gavinsky, D. Gavinsky (2016). Entangled simultaneity versus classical interactivity in communication complexity. Proceedings of ACM STOC |
|
| Robin Kothari, DR.Desloges, M. Santha (2015). Separating decision tree complexity from subcube partition complexity. Proceedings of International Workshop on Randomization and Computation 915-930 |
|
| M. Santha (2015). Quantum and randomized query complexities. International Conference on Theory and Applications of Models of Computation 18-19 |
|
| Ralph C. Bottesch, D. Gavinsky, D. Gavinsky, H. Klauck (2015). Correlation in Hard Distributions in Communication Complexity. RANDOM 544-572 |
|
| Christopher Perry, R. Jain, J. Oppenheim (2015). Communication tasks with infinite quantum-classical separation. Phys. Rev. Lett. 115 030504 |
|
| Y.L Seah, J. Shang, H.K. Ng, David John Nott, B.-G. Englert (2015). Monte Carlo sampling from the quantum state space. II. New J. Phys. 17 043018 |
|
| J. Shang, Y.L Seah, H.K. Ng, David John Nott, B.-G. Englert (2015). Monte Carlo sampling from the quantum state space. I. New J. Phys. 17 043017 |
|
| H. Klauck, Danupon Nanongkai, Gopal Pandurangan, Peter Robinson (2015). Distributed Computation of Large-scale Graph Problems. ACM SIAM SODA 391-410 |
|
| T. Lee, T. Lee, Frederic Magniez, M. Santha (2015). Improved quantum query algorithms for Triangle Finding and Associativity Testing. Algorithmica 1486-1502 |
|
| Seokwon Yoo, Jeongho Bang, C. Lee, Jinhyoung Lee (2014). A quantum speedup in machine learning: finding an N-bit Boolean function for a classification.. New J. Phys. 16 103014 |
|
| L. Mancinska, David E. Roberson, A.Varvitsiotis (2014). Two characterizations of nonlocal games with perfect maximally entangled strategies. AQIS |
|
| M. E.-Nagy, Monique Laurent, A.Varvitsiotis (2014). Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope. Journal of Combinatorial Theory, Series B 108 40-80 |
|
| Katalin Friedl, G. Ivanyos, Frederic Magniez, M. Santha, Pranab Sen (2014). Hidden Translation and Translating Coset in Quantum Computing. SIAM Journal of Computing 43 1-24 |
|
| T. Decker, P. Hoyer, G. Ivanyos, M. Santha (2014). Polynomial time quantum algorithms for certain bivariate hidden polynomial problems. Quantum Information and Computation 14 790–806 |
|
| Nathanael Francois, R. Jain, Frederic Magniez (2014). Input/Output Streaming Complexity of Reversal and Sorting. RANDOM 654-668 |
|
| T. Decker, G. Ivanyos, R. Kulkarni, Y. Qiao, M. Santha (2014). An efficient quantum algorithm for finding hidden parabolic subgroups in the general linear group. International Symposium MFCS 226-238 |
|
| G. Ivanyos, R. Kulkarni, Y. Qiao, M. Santha, A. Sundaram (2014). On the complexity of trial and error for constraint satisfaction problems. Proceedings of ICALP 663-675 |
|
| Joshua A. Grochow, Y. Qiao (2014). Algorithms for group isomorphism via group extensions and cohomology. IEEE Conference on Computational Complexity |
|
| G. Ivanyos, Marek Karpinski, Y. Qiao, M. Santha (2014). Generalized Wong sequences and their applications to Edmonds. Proceedings of STACS 25 397-408 |
|
| Michael Elkin, H. Klauck, Danupon Nanongkai, Gopal Pandurangan (2014). Can Quantum Communication Speed Up Distributed Computation?. ACM Symposium PODC |
|
| H. Klauck, V. Prakash (2014). An Improved Interactive Streaming Algorithm for the Distinct Elements Problem. Proceedings of ICALP 928-939 |
|
| R. Kulkarni, M. Santha (2013). Query complexity of matroids. CIAC 300-311 |
|
| R. Jain, Yaoyun Shi, Z.H. Wei, S. Zhang (2013). Efficient protocols for generating bipartite classical distributions and quantum states. IEEE Trans. Inf. 59 5171-5178 |
|
| T. Decker, G. Ivanyos, M. Santha, Pawel Wocjan (2013). Hidden Symmetry Subgroup Problems. SIAM Journal of Computing 42 1987-2007 |
|
| H. Klauck, V. Prakash (2013). Streaming computations with a loquacious prover. Proc. ICS 305-320 |
|
| Atul Mantri, J. Fitzsimons, C.A. Delgado (2013). Optimal Blind Quantum Computation. Phys. Rev. Lett. 111 230502 |
|
| Ankit Gupta, Neeraj Kayal, Y. Qiao (2013). Random Arithmetic Formulas can be Reconstructed Efficiently (extended abstract). Proc. IEEE CCC |
|
| A. Anshu, A. Anshu, M. Mhalla (2013). Pseudo-telepathy games and genuine NS k-way nonlocality using graph states. Quantum Information and Computation 13 0834-0846 |
|
| M. Hayashi, Toyohiro Tsurumaru (2012). Concise and Tight Security Analysis of the Bennett-Brassard 1984 Protocol with Finite Key Lengths. New J. Phys. 14 093014 |
|
| G. Ivanyos, H. Klauck, T. Lee, T. Lee, M. Santha, Ronald de Wolf (2012). New bounds on the classical and quantum communication complexity of some graph properties. Proceedings of FSTTCS 148-159 |
|
| T. Lee, T. Lee, Frederic Magniez, M. Santha (2012). Learning graph based quantum query algorithms for finding constant-size subgraphs. CJTCS 2012 1-21 |
|
| T.Islam, T.Islam, S. Wehner (2012). Are all non-local correlations physical?. Phys. Rev. A 86 |
|
| R. Jain, Yaoyun Shi, Z.H. Wei, S. Zhang (2012). Correlation/Communication complexity of generating bipartite states. Symposium on Discrete Algorithms |
|
| Frederic Magniez, A. Nayak, Peter Richter, M. Santha (2012). On the hitting times of quantum versus random walks. Algorithmica 63 98-116 |
|
| G. Ivanyos, Luc Sanselme, M. Santha (2012). An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups. Algorithmica 62 480-498 |
|
| L.C. Kwek, Setiawan (2011). One-dimensional quantum walk with a moving boundary. Phys. Rev. A 84 032319 |
|
| A. Kay (2011). The Capabilities of a Perturbed Toric Code as a Quantum Memory. Phys. Rev. Lett. 107 270502 |
|
| Anna Pappa, Andre Chailloux, Eleni Diamanti, I. Kerenidis (2011). Practical Quantum Coin Flipping. Phys. Rev. A 84 052305 |
|
| Biamonte, JD, Bergholm, V., Whitfield, J.D., J. Fitzsimons, Aspuru-Guzik, A. (2011). Adiabatic quantum simulators. AIP Advances 1 022126 |
|
| Jop Briet, Harry Buhrman, T. Lee, T. Lee, Thomas Vidick (2011). All Schatten spaces endowed with the Schur product are Q-algebras. Journal of Functional Analysis 262 1-9 |
|
| M.E. McKague (2011). Self-testing graph states. Proceedings of TQC |
|
| Frederic Magniez, A. Nayak, Jeremie Roland, M. Santha (2011). Search via Quantum Walk. SIAM Journal of Computing 1 142-164 |
|
| R. Jain, P. Yao (2011). A Parallel Approximation Algorithm for Positive Semidefinite Programming. Proc. IEEE FOCS |
|
| Earl T. Campbell, J. Fitzsimons (2010). An introduction to one-way quantum computing in distributed architectures. Int. J. Quant. Info. 8 219-258 |
|
| Y.F. Li, I. Dumer, M. Grassl, L.P. Pryadko (2010). Structured error recovery for code-word-stabilized quantum codes. Phys. Rev. A 81 052327 |
|
| E. Mascarenhas, B. Marques, M.T. Cunha, (2010). Continuous quantum error correction through local operations. Phys. Rev. A 82 032327 |
|
| Y. Dong, D. Hu, S.X. Yu (2010). Breeding quantum error-correcting codes. Phys. Rev. A 81 022322 |
|
| R. Jain, H. Klauck, S. Zhang (2010). Depth-Independent Lower bounds on Communication Complexity of Read-Once Boolean Functions. COCOON 16 |
|
| R. Duan, M. Grassl, Z. Ji, B. Zeng (2010). Multi-Error-Correcting Amplitude Damping Codes. Proceedings of ISIT 2672-2676 |
|
| C. Beny, O. Oreshkov (2010). General conditions for approximate quantum error correction and near-optimal recovery channels. Phys. Rev. Lett. 104 120501 |
|
| Y. Matsuzaki, S.C. Benjamin, J. Fitzsimons (2010). Probabilistic growth of large entangled states with low error accumulation. Phys. Rev. Lett. 104 050501 |
|
| Y. Dong, X.H. Deng, M.M. jiang, Q. Chen, S.X. Yu (2009). Entanglement-enhanced quantum error-correcting codes. Phys. Rev. A 79 042342 |
|
| R. Cleve, D. Gavinsky, R. Jain (2009). Entanglement-resistant two-prover interactive proof systems and non-adaptive private information retrieval systems. Quantum Information and Computation 9 648-656 |
|
| R. Jain, A. Kolla, G. Midrijanis, B.W. Reichardt (2009). On parallel composition of zero-knowledge proofs with black-box quantum simulators. Quantum Information and Computation 9 513-532 |
|
| R. Jain, J. Watrous (2009). Parallel approximation of non-interactive zero-sum quantum games. Proc. IEEE CCC 243-253 |
|
| R. Jain, H. Klauck (2009). New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques. Proc. IEEE CCC 369-378 |
|
| K. Friedl, F. Magniez, M. Santha, P. Sen (2009). Quantum testers for hidden group properties. Fundamenta Informaticae 91 325-340 |
|
| Z.W. Yu, X.T. Ni, L.C. Kwek, X.B. Wang (2009). A unified quantum NOT gate. J. Phys. A: Math. Theor. 42 205304 |
|
| P. Hayden, P.W. Shor, A. Winter (2008). Random Quantum Codes from Gaussian Ensembles and an Uncertainty Relation. Open Sys. Info. Dyn. 15 71-89 |
|
| J. Ivanyos, L. Sanselme, M. Santha (2008). An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups. Latin American Symposium on Theoretical Informatics 759-771 |
|
| M. Santha (2008). Quantum walk based search algorithms. International Conference on Theory and Applications of Models of Computation 31-46 |
|
| S.X. Yu, Q. Chen, C.H. Lai, C.H. Lai, C.H. Oh (2008). Nonadditive quantum error-correcting code. Phys. Rev. Lett. 101 090501 |
|
| D. Hu, W. Tang, M. Zhao, Q. Chen, S.X. Yu, C.H. Oh (2008). Graphical nonbinary quantum error-correcting codes. Phys. Rev. A 78 012306 |
|
| Wim van Dam, Frederic Magniez, Michele Mosca, M. Santha (2007). Self-testing of universal and fault-tolerant sets of quantum gates. SIAM Journal of Computing 2 611-629 |
|
| Frederic Magniez, M. Santha, Mario Szegedy (2007). Quantum algorithms for the triangle problem. SIAM Journal of Computing 2 413-424 |
|
| H. Klauck, Robert Spalek, Ronald de Wolf (2007). Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. SIAM Journal of Computing 36 1472-1493 |
|
| C.H. Chee, L.Daniel, Adrian M. Mak, D.G. Angelakis Shallow quantum circuits for efficient preparation of Slater determinants and correlated states on a quantum computer. |
|
| Srinivasan Arunachalam, Sourav Chakraborty, T. Lee, Manaswi Paraashar, Ronald de Wolf, T. Lee Two new results about quantum exact learning. Proceedings of ICALP |
|
| Gabor Ivanyos, Anupam Prakash, M. Santha On learning linear functions from subset and its applications in quantum computing. |
|
| Gábor Ivanyos Finding hidden Borel subgroups of the general linear group. Quantum Information and Computation |
|
