Fetching the paper…
Reading the bibliography…
Analyzing large sparse electrical networks is a fundamental task in physics, electrical engineering and computer science.
A lower bound for the smallest eigenvalue of the laplacian
Jeff Cheeger · 1970
Earlier work this paper cites.
Random walks and electric networks
Peter G. Doyle and J. Laurie Snell · 1984
Earlier work this paper cites.
Algorithms for quantum computation: Discrete logarithms and factoring
Peter W. Shor · 1994
Earlier work this paper cites.
Quantum measurements and the abelian stabilizer problem
Alexei Y. Kitaev · 1995
Earlier work this paper cites.
Universal quantum simulators
Seth Lloyd · 1996
Earlier work this paper cites.
The electrical resistance of a graph captures its commute and cover times
Ashok K Chandra, Prabhakar Raghavan, Walter L Ruzzo, Roman Smolensky, and Prasoon Tiwari · 1996
Earlier work this paper cites.
Simulation of many-body fermi systems on a universal quantum computer
Daniel S. Abrams and Seth Lloyd · 1997
Earlier work this paper cites.
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Peter W. Shor · 1997
Earlier work this paper cites.
Spectral graph theory
Fan R. K. Chung · 1997
Earlier work this paper cites.
Quantum algorithms revisited
Richard Cleve, Artur Ekert, Chiara Macchiavello, and Michele Mosca · 1998
Earlier work this paper cites.
Limit on the speed of quantum computation in determining parity
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Michael Sipser · 1998
Earlier work this paper cites.
Quantum lower bounds by polynomials
Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, and Ronald de Wolf · 2001
Earlier work this paper cites.
Quantum amplitude amplification and estimation
Gilles Brassard, Peter Hoyer, Michele Mosca, and Alain Tapp · 2002
Earlier work this paper cites.
Adiabatic quantum state generation and statistical zero knowledge
Dorit Aharonov and Amnon Ta-Shma · 2003
Earlier work this paper cites.
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
Daniel A. Spielman and Shang-Hua Teng · 2004
Earlier work this paper cites.
Quantum speed-up of markov chain based algorithms
Mario Szegedy · 2004
Earlier work this paper cites.
Fast quantum algorithms for computing the unit group and class group of a number field
Sean Hallgren · 2005
Earlier work this paper cites.
Fixed-point quantum search
Lov K. Grover · 2005
Earlier work this paper cites.
Synthesis of quantum-logic circuits
Vivek V. Shende, Stephen S. Bullock, and Igor L. Markov · 2006
Earlier work this paper cites.
Efficient quantum algorithms for simulating sparse hamiltonians
Dominic W. Berry, Graeme Ahokas, Richard Cleve, and Barry C. Sanders · 2007
Earlier work this paper cites.
Polynomial-time quantum algorithms for pell’s equation and the principal ideal problem
Sean Hallgren · 2007
Cited alongside, same era.
Quantum walk algorithm for element distinctness
Andris Ambainis · 2007
Cited alongside, same era.
Quantum algorithms for the triangle problem
Frédéric Magniez, Miklos Santha, and Mario Szegedy · 2007
Cited alongside, same era.
Quantum algorithm for linear systems of equations
Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd · 2009
Cited alongside, same era.
Span programs and quantum query complexity: The general adversary bound is nearly tight for every boolean function
Ben W. Reichardt · 2009
Cited alongside, same era.
Fast amplification of qma
Daniel Nagaj, Pawel Wocjan, and Yong Zhang · 2009
Cited alongside, same era.
A local spectral method for graphs: With applications to improving graph partitions and exploring data graphs locally
Michael W. Mahoney, Lorenzo Orecchia, and Nisheeth K. Vishnoi · 2012
Later among the works it cites.
Max cut and the smallest eigenvalue
Luca Trevisan · 2012
Later among the works it cites.
A new approach to computing maximum flows using electrical flows
Yin Tat Lee, Satish Rao, and Nikhil Srivastava · 2013
Closest in time.
Navigating central path with electrical flows: From flows to matchings, and back
Aleksander Madry · 2013
Closest in time.
Time-efficient quantum walks for 3-distinctness
Aleksandrs Belovs, Andrew M. Childs, Stacey Jeffery, Robin Kothari, and Frédéric Magniez · 2013
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Quantum algorithms for algebraic problems
Andrew M. Childs and Wim van Dam · 2010
Cited alongside, same era.
Graph sparsification by effective resistances
Daniel A. Spielman and Nikhil Srivastava · 2011
Cited alongside, same era.
Spectral sparsification of graphs
Daniel A. Spielman and Shang-Hua Teng · 2011
Cited alongside, same era.
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
Paul Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman, and Shang-Hua Teng · 2011
Cited alongside, same era.
Search via quantum walk
Frédéric Magniez, Ashwin Nayak, Jérémie Roland, and Miklos Santha · 2011
Cited alongside, same era.
Reflections for quantum query algorithms
Ben W. Reichardt · 2011
Cited alongside, same era.
Aleksandrs Belovs · 2013
Closest in time.
On the power of non-adaptive learning graphs
Aleksandrs Belovs and Ansis Rosmanis · 2014
Closest in time.
Nearly linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems
Daniel A. Spielman and Shang-Hua Teng · 2014
Closest in time.
Exponential improvement in precision for simulating sparse hamiltonians
Dominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, and Rolando D. Somma · 2014
Closest in time.
Multiway spectral partitioning and higher-order cheeger inequalities
James R. Lee, Shayan Oveis Gharan, and Luca Trevisan · 2014
Closest in time.
Faster spectral sparsification and numerical algorithms for sdd matrices
Ioannis Koutis, Alex Levin, and Richard Peng · 2015
Closest in time.
Fast generation of random spanning trees and the effective resistance metric
Aleksander Madry, Damian Straszak, and Jakub Tarnawski · 2015
Closest in time.
Nand-trees, average choice complexity, and effective resistance
Stacey Jeffery and Shelby Kimmel · 2015
Closest in time.
Quantum walk speedup of backtracking algorithms
Ashley Montanaro · 2015
Closest in time.
Quantum linear systems algorithm with exponentially improved dependence on precision
Andrew M Childs, Robin Kothari, and Rolando D Somma · 2015
Closest in time.
Approximate span programs
Tsuyoshi Ito and Stacey Jeffery · 2016
Closest in time.
Extended learning graphs for triangle finding
Titouan Carette, Mathieu Laurière, and Frédéric Magniez · 2016
Closest in time.
Oscillatory localization of quantum walks analyzed by classical electric circuits
Andris Ambainis, Krišj ānis Prūsis, Jevg ēnijs Vihrovs, and Thomas G. Wong · 2016
Closest in time.
Quantum algorithms and the finite element method
Ashley Montanaro and Sam Pallister · 2016
Closest in time.