2 citations · 2 across the 6 of their papers we have counts for
5 papers · 1 filter
Constant Factor Analysis of Optimal Quantum Linear Solvers in Practice
Pedro C. S. Costa, Alexander M. Dalzell, Dong An +1
Optimal quantum linear equation solvers provide complexity , where is the condition number and is the allowable error. The optimal solver using a discrete ad…
Unitary Quantum Cellular Automata for Density Classification
Pedro C. S. Costa, Yuval R. Sanders, Pedro Paulo Balbi +1
We investigate the density classification task (DCT) -- determining the majority bit in a one-dimensional binary lattice -- within a quantum cellular automaton (CA) framework. Whil…
Large time-step discretisation of adiabatic quantum dynamics
Dong An, Pedro C. S. Costa, Dominic W. Berry
Adiabatic quantum computing is a general framework for preparing eigenstates of Hamiltonians on quantum devices. However, its digital implementation requires an efficient Hamiltoni…
Assessing Quantum and Classical Approaches to Combinatorial Optimization: Testing Quadratic Speed-ups for Heuristic Algorithms
Pedro C. S. Costa, Mauro E. S. Morales, Dong An +1
Many recent investigations conclude, based on asymptotic complexity analyses, that quantum computers could accelerate combinatorial optimization (CO) tasks relative to a purely cla…
Quantum Linear System Solvers: A Survey of Algorithms and Applications
Mauro E. S. Morales, Lirandë Pira, Philipp Schleich +7
Solving linear systems of equations plays a fundamental role in numerous computational problems from different fields of science. The widespread use of numerical methods to solve t…