Presentation + Paper
19 July 2022 Quantum programming paradigms: boson sampling vs qubit gates
Author Affiliations +
Abstract
Quantum technology and its application in quantum computing has been gaining relevance and making incredible strides in the achievement of practical implementations of this new form of hardware acceleration. However, in order to really succeed as a computational choice in the many application fields — from science to economy—, the devices need to be programmable and within reach to non-quantum users. There are multiple approaches to solve the quantum computing riddle. This paper looks at two of them, Boson sampling and qubit gate-based quantum accelerators, and compares their implementation and programmability of a common problem: the maximum clique problem.
Conference Presentation
© (2022) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Sonia Lopez Alarcon and Andrew Haverly "Quantum programming paradigms: boson sampling vs qubit gates", Proc. SPIE 12243, Photonics for Quantum 2022, 1224304 (19 July 2022); https://doi.org/10.1117/12.2637882
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Bosons

Quantum communications

Quantum computing

Computer programming

Computing systems

Diffusers

Interferometers

RELATED CONTENT

Generation of high-dimensional photonic entanglement
Proceedings of SPIE (August 01 2021)
Data fusion in entangled networks of quantum sensors
Proceedings of SPIE (May 02 2017)
Finite temperature quantum logic
Proceedings of SPIE (May 12 2006)
Finite temperature quantum algorithm and majorization
Proceedings of SPIE (March 27 2008)
Quantum computation based on linear optics
Proceedings of SPIE (September 13 2002)

Back to Top