Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Phil's Algorithm

Richard J. Lipton, Kenneth W. Regan

Published Jan 1, 2014• 0 citations
OpenAlex

Abstract

This chapter contains sections titled: 7.1 The Algorithm, 7.2 The Analysis, 7.3 An Example, 7.4 A Two-Qubit Example, 7.5 Phil Measures Up, 7.6 Quantum Mazes versus Circuits versus Matrices, 7.7 Problems, 7.8 Summary and Notes

Related papers

Grover's Algorithm

Richard J. Lipton, Kenneth W. Regan

This chapter contains sections titled: 13.1 Two Vectors, 13.2 The Algorithm, 13.3 The Analysis, 13.4 The General Case, with k Unknown, 13.5 Grover Approximate Counting, 13.6 Problems, 13.7 Summary and Notes

•Jan 1, 2014•0 citations

Quantum Computation and BQP

Richard J. Lipton, Kenneth W. Regan

This chapter contains sections titled: 16.1 The Class BQP, 16.2 Equations, Solutions, and Complexity, 16.3 A Circuit Labeling Algorithm, 16.4 Sum-Over-Paths and Polynomial Roots, 16.5 The Additive Polynomial Simulation, 16.6 Bounding BQP, 16.7 Problems, 16.8 Summary and Notes

•Jan 1, 2014•0 citations

Boolean Functions, Quantum Bits, and Feasibility

Richard J. Lipton, Kenneth W. Regan

This chapter contains sections titled: 4.1 Feasible Boolean Functions, 4.2 An Example, 4.3 Quantum Representation of Boolean Arguments, 4.4 Quantum Feasibility, 4.5 Problems, 4.6 Summary and Notes

•Jan 1, 2014•0 citations

The Deutsch-Jozsa Algorithm

Richard J. Lipton, Kenneth W. Regan

This chapter contains sections titled: 9.1 The Algorithm, 9.2 The Analysis, 9.3 Problems, 9.4 Summary and Notes

•Jan 1, 2014•0 citations

Lecture Notes on Quantum Algorithms

Muhammad Faryad

These notes begin in Chapter 1 with a review of linear algebra and the postulates of quantum mechanics, leading to an explanation of single- and multi-qubit gates. Chapter 2 explores the challenge of constructing arbitrary quantum states from given initial states, and introduces circuits for building oracles. Chapter 3 presents foundational algorithms such as entanglement creation, quantum teleportation, Deutsch-Jozsa, Bernstein-Vazirani, and Simon's algorithm. Chapters 4 and 5 cover algorithms based on the quantum Fourier transform, including phase estimation, period finding, factoring, and logarithm computation. These chapters also include complexity analysis and detailed quantum circuits suitable for implementation in code. Chapter 6 introduces Grover's algorithm for quantum search and amplitude amplification, including its realization via Hamiltonian simulation and a method for derandomization. Chapter 7 discusses basic techniques for Hamiltonian simulation, such as Lie-Trotter decomposition, sparse Hamiltonians, and the linear combination of unitaries. It also provides example circuits for simulating Hamiltonians expressed as linear combinations of Pauli operators. Chapter 8 introduces variational quantum algorithms, and Chapter 9 presents an algorithm for simulating fermionic many-particle systems, with an emphasis on molecular Hamiltonians. It also outlines the key transformations needed to map a molecular Hamiltonian to a form suitable for simulation on a quantum computer.

arXiv:2507.11565•Jul 14, 2025•0 citations

Deutsch's Algorithm

Richard J. Lipton, Kenneth W. Regan

This chapter contains sections titled: 8.1 The Algorithm, 8.2 The Analysis, 8.3 Superdense Coding and Teleportation, 8.4 Problems, 8.5 Summary and Notes

•Jan 1, 2014•0 citations
These notes begin in Chapter 1 with a review of linear algebra and the postulates of quantum mechanics, leading to an explanation of single- and multi-qubit gates. Chapter 2 explores the challenge of constructing arbitrary quantum states from given initial states, and introduces circuits for building oracles. Chapter 3 presents foundational algorithms such as entanglement creation, quantum teleportation, Deutsch-Jozsa, Bernstein-Vazirani, and Simon's algorithm. Chapters 4 and 5 cover algorithms based on the quantum Fourier transform, including phase estimation, period finding, factoring, and logarithm computation. These chapters also include complexity analysis and detailed quantum circuits suitable for implementation in code. Chapter 6 introduces Grover's algorithm for quantum search and amplitude amplification, including its realization via Hamiltonian simulation and a method for derandomization. Chapter 7 discusses basic techniques for Hamiltonian simulation, such as Lie-Trotter decomposition, sparse Hamiltonians, and the linear combination of unitaries. It also provides example circuits for simulating Hamiltonians expressed as linear combinations of Pauli operators. Chapter 8 introduces variational quantum algorithms, and Chapter 9 presents an algorithm for simulating fermionic many-particle systems, with an emphasis on molecular Hamiltonians. It also outlines the key transformations needed to map a molecular Hamiltonian to a form suitable for simulation on a quantum computer.