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

Conference on Lasers and Electro-Optics

Generating virtual non-Gaussian state via quasi-probability simulation

Shaohua Hu, Ray‐Kuang Lee

Published Jan 1, 2025• 0 citations
Publisher

Abstract

In this work, we employ quasi-probability simulation to generate the complex non-Gaussian state, e.g., number state and the Gottesman-Kitaev-Preskill state, from the state, which is relatively easy to prepare.
DOI
10.1364/cleo_at.2025.jps200_8

Related papers

Generating virtual non-Gaussian state via quasi-probability simulation

Shaohua Hu, Ray‐Kuang Lee

Photonics for Quantum (PfQ)•Jun 13, 2025•0 citations

Arbitrary Gottesman-Kitaev-Preskill state synthesizer

Kan Takase, Kosuke Fukui, Akito Kawasaki +4 more

We propose the first all-optical method for generating arbitrary Gottesman-Kitaev-Preskill states, which fills in the largest missing piece of practical optical quantum computing.

Frontiers in Optics•Jan 1, 2022•0 citations

Efficient simulation of Gottesman-Kitaev-Preskill states with Gaussian circuits

Cameron Calcluth, Alessandro Ferraro, Giulia Ferrini

We study the classical simulatability of Gottesman-Kitaev-Preskill (GKP) states in combination with arbitrary displacements, a large set of symplectic operations and homodyne measurements. For these types of circuits, neither continuous-variable theorems based on the non-negativity of quasi-probability distributions nor discrete-variable theorems such as the Gottesman-Knill theorem can be employed to assess the simulatability. We first develop a method to evaluate the probability density function corresponding to measuring a single GKP state in the position basis following arbitrary squeezing and a large set of rotations. This method involves evaluating a transformed Jacobi theta function using techniques from analytic number theory. We then use this result to identify two large classes of multimode circuits which are classically efficiently simulatable and are not contained by the GKP encoded Clifford group. Our results extend the set of circuits previously known to be classically efficiently simulatable.

arXiv:2203.11182•Quantum•Dec 1, 2022•25 citations

Photon-Number-Resolving Detection for Viable Gottesman-Kitaev-Preskill State Preparation

Miller Eaton, Rajveer Nehra, Olivier Pfister

We include photon-number-resolving detection in “photon catalysis” and apply it to generating non-Gaussian quantum states, including perfectly displaced single-photon states, high-fidelity squeezed cat and Gottesman-Kitaev-Preskill states.

Frontiers in Optics•Jan 1, 2019•1 citation

Quantum Random Number Generator with Programmable Probability Distributions

Lac Nguyen, Patrick Rehain, Yong Meng Sua +1 more

We present a method of generating quantum random numbers with arbitrarily defined probability distributions featuring high dimensionality and post-processing free, for significantly improved Monte-Carlo simulations and data analyses.

Frontiers in Optics•Jan 1, 2018•0 citations

Employing online quantum random number generators for generating truly random quantum states in Mathematica

Jarosław Adam Miszczak

arXiv:1208.3970•Computer Physics Communications•Aug 24, 2012•11 citations
We study the classical simulatability of Gottesman-Kitaev-Preskill (GKP) states in combination with arbitrary displacements, a large set of symplectic operations and homodyne measurements. For these types of circuits, neither continuous-variable theorems based on the non-negativity of quasi-probability distributions nor discrete-variable theorems such as the Gottesman-Knill theorem can be employed to assess the simulatability. We first develop a method to evaluate the probability density function corresponding to measuring a single GKP state in the position basis following arbitrary squeezing and a large set of rotations. This method involves evaluating a transformed Jacobi theta function using techniques from analytic number theory. We then use this result to identify two large classes of multimode circuits which are classically efficiently simulatable and are not contained by the GKP encoded Clifford group. Our results extend the set of circuits previously known to be classically efficiently simulatable.