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

Frontiers in Optics

Novel Photonic Quantum Computing and Quantum Simulation

Philip John Walther, Lee A. Rozema

Published Jan 1, 2015• 0 citations
Publisher

Abstract

I will present experimental results for the superposition of quantum gates enabling significant computational speed-ups. I will also present the quantum simulation of two XY-interacting spins and discuss the current status of new photonic quantum technology.
DOI
10.1364/fio.2015.fw5a.1

Related papers

Quantum photonics for computation and simulation

Jacob M. Taylor

I will discuss recent advances towards implementation of nonlinear photonic devices for quantum information processing and quantum simulation of topological phases of matter, using approaches from circuit QED and silicon-on-insulator technologies.

Frontiers in Optics•Jan 1, 2012•0 citations

Observable-driven speed-ups in quantum simulations

Wenjun Yu, Jue Xu, Qi Zhao

Quantum simulation represents a cornerstone application for quantum computers, offering the potential to solve classically intractable problems in physics, chemistry, and materials science. Despite being one of the most accessible simulation methods, the product formula encounters challenges due to the pessimistic gate count estimation. In this work, we elucidate how observable knowledge can accelerate quantum simulations. By focusing on specific knowledge of observables, we reduce product-formula simulation errors and gate counts in both short-time and arbitrary-time scenarios. For short-time simulations, we deliberately design and tailor product formulas to achieve size-independent errors for local and certain global observables. In arbitrary-time simulations, we reveal that Pauli-summation structured observables generally reduce average errors with a typically quadratic error reduction. Our advanced error analyses, supported by numerical studies, indicate improved gate count estimation. We anticipate that the explored speed-ups can pave the way for efficiently realizing quantum simulations and demonstrating advantages on near-term quantum devices. The promise of quantum simulation is challenged by resource estimates that far exceed the capabilities of current devices. This work shows that tailoring simulations, especially product-formula methods, to the specific observable being measured provides significant speed-ups, including size-independent errors and quadratic reductions in gate counts.

arXiv:2407.14497•Communications Physics•Aug 19, 2025•4 citations

Advances in photonic quantum information science

John Rarity

This talk will review recent advances in pair photon sources, multiphoton interference and deterministic entanglement generation commenting on prospects for scalable quantum computation.

European Conference on Optical Communication•Sep 1, 2014•0 citations

Programming gate-based hardware quantum computers for music

Alexis Kirke

There have been significant attempts previously to use the equations of quantum mechanics for generating sound, and to sonify simulated quantum processes. For new forms of computation to be utilized in computer music, eventually hardware must be utilized. This has rarely happened with quantum computer music. One reason for this is that it is currently not easy to get access to such hardware. A second is that the hardware available requires some understanding of quantum computing theory. This paper moves forward the process by utilizing two hardware quantum computation systems: IBMQASM v1.1 and a D-Wave 2X. It also introduces the ideas behind the gate-based IBM system, in a way hopefully more accessible to computerliterate readers. This is a presentation of the first hybrid quantum computer algorithm, involving two hardware machines. Although neither of these algorithms explicitly utilize the promised quantum speed-ups, they are a vital first step in introducing QC to the musical field. The article also introduces some key quantum computer algorithms and discusses their possible future contribution to computer music.

Muzikologija•Jan 1, 2018•3 citations

Comparison of container-based platforms for quantum computing simulation

Ginés Carrascal, Guillermo Botella, Alberto Antonio Del Barrio

Quantum Computing allows for substantial speed-ups e.g. for integer factorization or database search, compared to conventional computation. However, since real quantum computers are an emerging technology, a significant amount of research in this domain still relies on simulations of quantum computations on conventional machines. This paper proposes a containerized environment to simulate quantum circuits, making this environment quick and easy to share within research teams. Also test the environment implementing an arithmetic circuit (Vedral’s adder) and compares the performance of two of the current more used environments: IBM QISKit and Google Cirq.

•Jan 1, 2020•0 citations

Photonic Quantum Computing

Mark G. Thompson

Quantum computing is set to revolutionize information technologies. In this talk I will outline the photonics approach to quantum computing, introducing the silicon photonic quantum circuit and highlighting approaches to manufacturability and scalability.

Conference on Lasers and Electro-Optics•Jan 1, 2020•0 citations
Quantum simulation represents a cornerstone application for quantum computers, offering the potential to solve classically intractable problems in physics, chemistry, and materials science. Despite being one of the most accessible simulation methods, the product formula encounters challenges due to the pessimistic gate count estimation. In this work, we elucidate how observable knowledge can accelerate quantum simulations. By focusing on specific knowledge of observables, we reduce product-formula simulation errors and gate counts in both short-time and arbitrary-time scenarios. For short-time simulations, we deliberately design and tailor product formulas to achieve size-independent errors for local and certain global observables. In arbitrary-time simulations, we reveal that Pauli-summation structured observables generally reduce average errors with a typically quadratic error reduction. Our advanced error analyses, supported by numerical studies, indicate improved gate count estimation. We anticipate that the explored speed-ups can pave the way for efficiently realizing quantum simulations and demonstrating advantages on near-term quantum devices. The promise of quantum simulation is challenged by resource estimates that far exceed the capabilities of current devices. This work shows that tailoring simulations, especially product-formula methods, to the specific observable being measured provides significant speed-ups, including size-independent errors and quadratic reductions in gate counts.
There have been significant attempts previously to use the equations of quantum mechanics for generating sound, and to sonify simulated quantum processes. For new forms of computation to be utilized in computer music, eventually hardware must be utilized. This has rarely happened with quantum computer music. One reason for this is that it is currently not easy to get access to such hardware. A second is that the hardware available requires some understanding of quantum computing theory. This paper moves forward the process by utilizing two hardware quantum computation systems: IBMQASM v1.1 and a D-Wave 2X. It also introduces the ideas behind the gate-based IBM system, in a way hopefully more accessible to computerliterate readers. This is a presentation of the first hybrid quantum computer algorithm, involving two hardware machines. Although neither of these algorithms explicitly utilize the promised quantum speed-ups, they are a vital first step in introducing QC to the musical field. The article also introduces some key quantum computer algorithms and discusses their possible future contribution to computer music.
Quantum Computing allows for substantial speed-ups e.g. for integer factorization or database search, compared to conventional computation. However, since real quantum computers are an emerging technology, a significant amount of research in this domain still relies on simulations of quantum computations on conventional machines. This paper proposes a containerized environment to simulate quantum circuits, making this environment quick and easy to share within research teams. Also test the environment implementing an arithmetic circuit (Vedral’s adder) and compares the performance of two of the current more used environments: IBM QISKit and Google Cirq.