Noisy intermediate-scale quantum algorithms

K Bharti, A Cervera-Lierta, TH Kyaw, T Haug… - Reviews of Modern …, 2022 - APS
A universal fault-tolerant quantum computer that can efficiently solve problems such as
integer factorization and unstructured database search requires millions of qubits with low …

The resurgence of the linear optics quantum interferometer—recent advances & applications

SH Tan, PP Rohde - Reviews in Physics, 2019 - Elsevier
Linear optics has seen a resurgence for applications in quantum information processing
owing to its miniaturisation on-chip, and increase in production efficiency and quality of …

Applications of near-term photonic quantum computers: software and algorithms

TR Bromley, JM Arrazola, S Jahangiri… - Quantum Science …, 2020 - iopscience.iop.org
Gaussian boson sampling (GBS) is a near-term platform for photonic quantum computing.
Recent efforts have led to the discovery of GBS algorithms with applications to graph-based …

Universal quantum circuits for quantum chemistry

JM Arrazola, O Di Matteo, N Quesada, S Jahangiri… - Quantum, 2022 - quantum-journal.org
Universal gate sets for quantum computing have been known for decades, yet no universal
gate set has been proposed for particle-conserving unitaries, which are the operations of …

The Goldilocks principle of learning unitaries by interlacing fixed operators with programmable phase shifters on a photonic chip

K Zelaya, M Markowitz, MA Miri - Scientific Reports, 2024 - nature.com
Programmable photonic integrated circuits represent an emerging technology that
amalgamates photonics and electronics, paving the way for light-based information …

Efficient decomposition of unitary matrices in quantum circuit compilers

AM Krol, A Sarkar, I Ashraf, Z Al-Ars, K Bertels - Applied Sciences, 2022 - mdpi.com
Unitary decomposition is a widely used method to map quantum algorithms to an arbitrary
set of quantum gates. Efficient implementation of this decomposition allows for the …

Quantum geometry beyond projective single bands

A Bouhon, A Timmel, RJ Slager - arxiv preprint arxiv:2303.02180, 2023 - arxiv.org
The past few years have seen a revived interest in quantum geometrical characterizations of
band structures due to the rapid development of topological insulators and semi-metals …

The complexity of bipartite Gaussian boson sampling

D Grier, DJ Brod, JM Arrazola… - Quantum, 2022 - quantum-journal.org
Gaussian boson sampling is a model of photonic quantum computing that has attracted
attention as a platform for building quantum devices capable of performing tasks that are out …

Exact simulation of Gaussian boson sampling in polynomial space and exponential time

N Quesada, JM Arrazola - Physical Review Research, 2020 - APS
We introduce an exact classical algorithm for simulating Gaussian boson sampling (GBS).
The complexity of the algorithm is exponential in the number of photons detected, which is …

Matrix decompositions in quantum optics: Takagi/Autonne, Bloch–Messiah/Euler, Iwasawa, and Williamson

M Houde, W McCutcheon… - Canadian Journal of …, 2024 - cdnsciencepub.com
In this tutorial, we summarize four important matrix decompositions commonly used in
quantum optics, namely the Takagi/Autonne, Bloch–Messiah/Euler, Iwasawa, and …