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

Springer eBooks

Making Sound with Light: Sound Synthesis with a Photonic Quantum Computer

Eduardo Reck Miranda, Paul Finlay, Tom Lubowe

Published Jan 1, 2022• 0 citations
Publisher
DOI
10.1007/978-3-031-13909-3_16

Related papers

Experiments in Sound and Music Quantum Computing

Alexis Kirke, Eduardo Reck Miranda

Springer eBooks•Jan 1, 2017•9 citations

Quantum synth

Omar Costa Hamido, Giovanni Amedeo Cirillo, Edoardo Giusto

In this paper we present the Quantum Synth project, an interface between Qiskit and Max for controlling sound synthesis parameters encoded on the basis states of a quantum computer. This sound synthesis is obtained from the potential measured outcomes of a quantum circuit. The effects of using fundamental quantum operations as found in the Bell circuit, for the generation of entangled states, and the Grover's search algorithm have been demonstrated. The interface has been designed to be used by music performers and composers in their creative process, and as a resource to both learn Quantum Computing and analyze the intrinsic noise of real quantum hardware.

Audio Mostly Conference (AM)•Sep 15, 2020•13 citations

Quantum state synthesis: relation with decision complexity classes and impossibility of error reduction

Hugo Delavenne, François Le Gall

This work investigates the relationships between quantum state synthesis complexity classes (a recent concept in computational complexity that focuses on the complexity of preparing quantum states) and traditional decision complexity classes. We especially investigate the role of the \emph{synthesis error parameter}, which characterizes the quality of the synthesis in quantum state synthesis complexity classes.We first show that in the high synthesis error regime, collapse of synthesis classes implies collapse of the equivalent decision classes. For more reasonable synthesis error, we then show a similar relationships for $\BQP$ and $\QCMA$. Finally, we show that for quantum state synthesis classes it is in general impossible to improve the quality of the synthesis: unlike the completeness and soundness parameters (which can be improved via repetition), the synthesis error cannot be reduced, even with arbitrary computational power.

Quantum Information and Computation•Sep 1, 2024•0 citations

Quantum photonic processors: towards quantum computing with light

Caterina Taballione, F. H. B. Somhorst

Emerging Applications in Silicon Photonics•Jan 11, 2023•0 citations

Towards the Photonic Quantum Computer

Yong‐Su Kim, Heedeuk Shin, Joonsuk Huh

Physics and High Technology•Mar 31, 2019•0 citations

Quantum State Synthesis: Relation with Decision Complexity Classes and Impossibility of Synthesis Error Reduction

Hugo Delavenne, François Le Gall

This work investigates the relationships between quantum state synthesis complexity classes (a recent concept in computational complexity that focuses on the complexity of preparing quantum states) and traditional decision complexity classes. We especially investigate the role of the synthesis error parameter, which characterizes the quality of the synthesis in quantum state synthesis complexity classes. We first show that in the high synthesis error regime, collapse of synthesis classes implies collapse of the equivalent decision classes. For more reasonable synthesis error, we then show a similar relationships for BQP and QCMA. Finally, we show that for quantum state synthesis classes it is in general impossible to improve the quality of the synthesis: unlike the completeness and soundness parameters (which can be improved via repetition), the synthesis error cannot be reduced, even with arbitrary computational power.

arXiv:2407.02907•Jul 3, 2024•0 citations
In this paper we present the Quantum Synth project, an interface between Qiskit and Max for controlling sound synthesis parameters encoded on the basis states of a quantum computer. This sound synthesis is obtained from the potential measured outcomes of a quantum circuit. The effects of using fundamental quantum operations as found in the Bell circuit, for the generation of entangled states, and the Grover's search algorithm have been demonstrated. The interface has been designed to be used by music performers and composers in their creative process, and as a resource to both learn Quantum Computing and analyze the intrinsic noise of real quantum hardware.
This work investigates the relationships between quantum state synthesis complexity classes (a recent concept in computational complexity that focuses on the complexity of preparing quantum states) and traditional decision complexity classes. We especially investigate the role of the \emph{synthesis error parameter}, which characterizes the quality of the synthesis in quantum state synthesis complexity classes.We first show that in the high synthesis error regime, collapse of synthesis classes implies collapse of the equivalent decision classes. For more reasonable synthesis error, we then show a similar relationships for $\BQP$ and $\QCMA$. Finally, we show that for quantum state synthesis classes it is in general impossible to improve the quality of the synthesis: unlike the completeness and soundness parameters (which can be improved via repetition), the synthesis error cannot be reduced, even with arbitrary computational power.
This work investigates the relationships between quantum state synthesis complexity classes (a recent concept in computational complexity that focuses on the complexity of preparing quantum states) and traditional decision complexity classes. We especially investigate the role of the synthesis error parameter, which characterizes the quality of the synthesis in quantum state synthesis complexity classes. We first show that in the high synthesis error regime, collapse of synthesis classes implies collapse of the equivalent decision classes. For more reasonable synthesis error, we then show a similar relationships for BQP and QCMA. Finally, we show that for quantum state synthesis classes it is in general impossible to improve the quality of the synthesis: unlike the completeness and soundness parameters (which can be improved via repetition), the synthesis error cannot be reduced, even with arbitrary computational power.