scientific article
From MaRDI portal
Publication:3002797
DOI10.4086/toc.2008.v004a008zbMath1213.68284arXivquant-ph/0702144OpenAlexW2120560473MaRDI QIDQ3002797
Jeffrey Goldstone, Sam Gutmann, Edward Farhi
Publication date: 24 May 2011
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0702144
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (only showing first 100 items - show all)
Quantum walk on the line through potential barriers ⋮ Challenges of adiabatic quantum evaluation of NAND trees ⋮ Leveraging special-purpose hardware for local search heuristics ⋮ Spatial search by continuous-time quantum walk with multiple marked vertices ⋮ The improved evolution paths to speedup quantum evolution ⋮ A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs ⋮ QUANTUM WALKS ON NECKLACES AND MIXING ⋮ Perfect state transfer in Laplacian quantum walk ⋮ Quantum state transfer in coronas ⋮ The walker speaks its graph: global and nearly-local probing of the tunnelling amplitude in continuous-time quantum walks ⋮ Path-integral solution of the one-dimensional Dirac quantum cellular automaton ⋮ Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas ⋮ From the quantum approximate optimization algorithm to a quantum alternating operator ansatz ⋮ \textit{pyCTQW}: a continuous-time quantum walk simulator on distributed memory computers ⋮ A dynamical system induced by quantum walk ⋮ Breaking the Minsky--Papert Barrier for Constant-Depth Circuits ⋮ Laplacian versus adjacency matrix in quantum walk search ⋮ Path-sum solution of the Weyl quantum walk in 3 + 1 dimensions ⋮ Quantum approximate optimization of the long-range Ising model with a trapped-ion quantum simulator ⋮ Generation of thermofield double states and critical ground states with a quantum computer ⋮ A strong direct product theorem for quantum query complexity ⋮ Quantum simulation of quantum field theories as quantum chemistry ⋮ History dependent quantum random walks as quantum lattice gas automata ⋮ Quantum walk and its application domains: a systematic review ⋮ Benchmarking quantum processors with a single qubit ⋮ Weyl, Dirac and Maxwell quantum cellular automata ⋮ Benchmarking the quantum approximate optimization algorithm ⋮ Pieceable fault tolerant conversion between 5-qubit code and 7-CSS code ⋮ Incoherent quantum algorithm dynamics of an open system with near-term devices ⋮ On the universality of the quantum approximate optimization algorithm ⋮ Search on vertex-transitive graphs by lackadaisical quantum walk ⋮ On the relationship between continuous- and discrete-time quantum walk ⋮ Quantum algorithm for preparing the ground state of a physical system through multi-step quantum resonant transitions ⋮ Experimental pairwise entanglement estimation for an \(N\)-qubit system. A machine learning approach for programming quantum hardware ⋮ Overview: recent development and applications of reduction and lackadaisicalness techniques for spatial search quantum walk in the near term ⋮ Decoherence dynamics estimation for superconducting gate-model quantum computers ⋮ Impact of graph structures for QAOA on maxcut ⋮ Amplitude estimation via maximum likelihood on noisy quantum computer ⋮ Quantum k-community detection: algorithm proposals and cross-architectural evaluation ⋮ Benchmarking the performance of portfolio optimization with QAOA ⋮ Quantum Bayesian inference for parameter estimation using quantum generative model ⋮ Quantum algorithm for the advection-diffusion equation simulated with the lattice Boltzmann method ⋮ Lower bounds on circuit depth of the quantum approximate optimization algorithm ⋮ A GNN-based predictor for quantum architecture search ⋮ On the efficiency of quantum algorithms for Hamiltonian simulation ⋮ A subgradient approach for constrained binary optimization via quantum adiabatic evolution ⋮ Probabilistic nonunitary gate in imaginary time evolution ⋮ Equivalence of Szegedy's and coined quantum walks ⋮ Probability distributions for Markov chain based quantum walks ⋮ Electric circuit induced by quantum walk ⋮ EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS ⋮ Open quantum random walks ⋮ Intricacies of quantum computational paths ⋮ Efficient diabatic quantum algorithm in number factorization ⋮ Exciton propagation via quantum walks based on non-Hermitian coin flip operations ⋮ Quantum Query Algorithms are Completely Bounded Forms. ⋮ Algorithmic Polynomials ⋮ Quantum algorithm design: techniques and applications ⋮ Quantum Query Algorithms Are Completely Bounded Forms ⋮ How to build the thermofield double state ⋮ An automated deductive verification framework for circuit-building quantum programs ⋮ A novel ant colony optimization strategy for the quantum circuit compilation problem ⋮ A quantum walk-assisted approximate algorithm for bounded NP optimisation problems ⋮ A class of time-energy uncertainty relations for time-dependent Hamiltonians ⋮ Variational Quantum Eigensolver and Its Applications ⋮ Green's function approach for quantum graphs: an overview ⋮ Quantum walks: a comprehensive review ⋮ Asymptotic behavior of quantum walks with spatio-temporal coin fluctuations ⋮ Fourier concentration from shrinkage ⋮ Universal state transfer on graphs ⋮ The QWalk simulator of quantum walks ⋮ The excitonic qubit on a star graph: dephasing-limited coherent motion ⋮ Unnamed Item ⋮ Pretty good state transfer on Cayley graphs over dihedral groups ⋮ Quantum approaches to graph colouring ⋮ Superlinear Advantage for Exact Quantum Algorithms ⋮ Quantum algorithms for algebraic problems ⋮ Perfect state transfer on weighted abelian Cayley graphs ⋮ Algorithms and lower bounds for de morgan formulas of low-communication leaf gates ⋮ A conditional generative model based on quantum circuit and classical optimization ⋮ Quantum branch-and-bound algorithm and its application to the travelling salesman problem ⋮ Levinson's theorem for graphs ⋮ Disordered quantum walks in one lattice dimension ⋮ Classical symmetries and the quantum approximate optimization algorithm ⋮ Toward a quantum computing algorithm to quantify classical and quantum correlation of system states ⋮ Empirical performance bounds for quantum approximate optimization ⋮ A quantum genetic algorithm for optimization problems on the Bloch sphere ⋮ Simplifying continuous-time quantum walks on dynamic graphs ⋮ Unconstrained binary models of the travelling salesman problem variants for quantum optimization ⋮ Spatial search on Johnson graphs by continuous-time quantum walk ⋮ Quantifying the uncertainty and global sensitivity of quantum computations on experimental hardware ⋮ Quadratic and higher-order unconstrained binary optimization of railway rescheduling for quantum computing ⋮ Quantum circuit design for objective function maximization in gate-model quantum computers ⋮ Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem ⋮ Benchmarking advantage and D-wave 2000Q quantum annealers with exact cover problems ⋮ Fast-QTrain: an algorithm for fast training of variational classifiers ⋮ Levinson's theorem for graphs II ⋮ State stabilization for gate-model quantum computers ⋮ A hybrid classical-quantum algorithm for digital image processing ⋮ Quantum approximate optimization algorithm for Bayesian network structure learning
This page was built for publication:
