4 papers
Quantum state isomorphism problems for groups
Alexandru Gheorghiu, Dale Jacobs, Saeed Mehraban +1
We study the computational complexity of quantum state isomorphism problems under group actions: given two quantum circuits that prepare pure or mixed states, decide whether the tw…
Energy, Bosons and Computational Complexity
Dorian Rudolph, Arsalan Motamedi, Dhruva Sambrani +4
We investigate the role of energy, i.e. average photon number, as a resource in the computational complexity of bosonic systems. We show three sets of results: (1. Energy growth ra…
The stellar decomposition of Gaussian quantum states
Arsalan Motamedi, Yuan Yao, Kasper Nielsen +4
We introduce the stellar decomposition, a novel method for characterizing non-Gaussian states produced by photon-counting measurements on Gaussian states. Given an -mode Gau…
Bosonic Quantum Computational Complexity
Ulysse Chabaud, Michael Joseph, Saeed Mehraban +1
Quantum computing involving physical systems with continuous degrees of freedom, such as the quantum states of light, has recently attracted significant interest. However, a well-d…