Efficient quantum circuits for diagonal unitaries without ancillas

DOI10.1088/1367-2630/16/3/033040zbMath1451.81156arXiv1306.3991OpenAlexW3105971113MaRDI QIDQ5143192

Alán Aspuru-Guzik, Jonathan Welch, Sarah Mostame, Daniel Greenbaum

Publication date: 11 January 2021

Published in: New Journal of Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.3991

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum gates (81P65)

Related Items (8)

Efficient and scalable quantum walk algorithms via the quantum Fourier transform ⋮ Quantum circuits for discrete-time quantum walks with position-dependent coin operator ⋮ Programmable quantum simulation by dynamic Hamiltonian engineering ⋮ A quantum walk-assisted approximate algorithm for bounded NP optimisation problems ⋮ Vibration analysis of cyclic symmetrical systems by quantum algorithms ⋮ Boolean satisfiability in quantum compilation ⋮ The theory of variational hybrid quantum-classical algorithms ⋮ Quantum algorithm for learning secret strings and its experimental demonstration

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum Computation and Quantum Information
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• On the Product of Semi-Groups of Operators
• Function Approximation by Walsh Series
• Simulating quantum systems on a quantum computer
• Upper Bounds on Walsh Transforms

This page was built for publication: Efficient quantum circuits for diagonal unitaries without ancillas