Santha, Miklos

1. Quantum Algorithms for the Triangle Problem
   2003/10/21 by Magniez, Frederic, Santha, Miklos, Szegedy, Mario · 5 citations
   #FOS: Physical sciences #Quantum Physics (quant-ph)
2. Separations in Query Complexity Based on Pointer Functions
   2015/06/15 by Ambainis, Andris, Balodis, Kaspars, Belovs, Aleksandrs +3 · 4 citations
   #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Physics (quant-ph)
3. An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups
   2007/07/09 by Gábor Ivanyos, Ivanyos, Gábor, Luc Sanselme +3 · 3 citations
   Computer Science · Engineering · #Quantum Computing Algorithms and Architecture #Coding theory and cryptography #graph theory and CDMA systems
4. On the dynamical Lie algebras of quantum approximate optimization algorithms
   2024/07/17 by Allcock, Jonathan, Santha, Miklos, Yuan, Pei +1 · 7 citations
   #FOS: Physical sciences #Quantum Physics (quant-ph)
5. Quantum algorithms for graph problems with cut queries
   2020/07/16 by Lee, Troy, Santha, Miklos, Zhang, Shengyu · 3 citations
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Physics (quant-ph)
6. On the cut dimension of a graph
   2020/11/10 by Lee, Troy, Li, Tongyang, Santha, Miklos +1 · 3 citations
   #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics
7. A learning graph based quantum query algorithm for finding constant-size subgraphs
   2011/09/23 by Troy Lee, Lee, Troy, Frédéric Magniez +3 · 2 citations
   Computer Science · #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #Quantum-Dot Cellular Automata
8. Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem
   2001/02/02 by Gabor Ivanyos, Gábor Ivanyos, Frédéric Magniez +6 · 1 citation
   Computer Science · Mathematics · Physics and Astronomy · #Algebraic structures and combinatorial models #Coding theory and cryptography #FOS: Physical sciences #Finite Group Theory Research #Quantum Physics (quant-ph) #quant-ph
9. Quantum testers for hidden group properties
   2002/08/29 by Katalin Friedl, Frederic Magniez, Friedl, Katalin +8 · 1 citation
   Computer Science · Physics and Astronomy · #Complexity and Algorithms in Graphs #Cryptography and Data Security #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph) #quant-ph
10. On the hitting times of quantum versus random walks
    2008/08/01 by Magniez, Frederic, Nayak, Ashwin, Richter, Peter C. +1 · 1 citation
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Physics (quant-ph)
11. An efficient quantum algorithm for finding hidden parabolic subgroups in\n the general linear group
    2014/06/25 by Thomas Decker, Decker, Thomas, Gábor Ivanyos +7 · 1 citation
    Computer Science · Engineering · Mathematics · #Coding theory and cryptography #FOS: Physical sciences #Finite Group Theory Research #Graph theory and applications #Quantum Physics (quant-ph) #graph theory and CDMA systems
12. On the quantum time complexity of divide and conquer
    2023/11/28 by Allcock, Jonathan, Bao, Jinge, Belovs, Aleksandrs +2 · 2 citations
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Physics (quant-ph)
13. On learning linear functions from subset and its applications in quantum computing
    2018/06/25 by Gábor Ivanyos, Anupam Prakash, Ivanyos, Gábor +3 · 1 citation
    Computer Science · #Cryptography and Data Security #Coding theory and cryptography #Complexity and Algorithms in Graphs
14. Beyond Bell sampling: stabilizer state learning and quantum pseudorandomness lower bounds on qudits
    2024/05/10 by Allcock, Jonathan, Doriguello, Joao F., Ivanyos, Gábor +1 · 1 citation
    #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Physics (quant-ph)
15. Polynomial Time Algorithms for Integer Programming and Unbounded Subset Sum in the Total Regime
    2024/07/07 by Divesh Aggarwal, Aggarwal, Divesh, Antoine Joux +5 · 1 citation
    Computer Science · Engineering · #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Search Problems #Scheduling and Optimization Algorithms