90 citations · 180 across the 6 of their papers we have counts for
6 papers · 1 filter
Exact and approximate continuous-variable gate decompositions
Timjan Kalajdzievski, Nicolás Quesada
We gather and examine in detail gate decomposition techniques for continuous-variable quantum computers and also introduce some new techniques which expand on these methods. Both e…
Efficient sampling from shallow Gaussian quantum-optical circuits with local interactions
Haoyu Qi, Diego Cifuentes, Kamil Brádler +3
We prove that a classical computer can efficiently sample from the photon-number probability distribution of a Gaussian state prepared by using an optical circuit that is shallow a…
Exact gate decompositions for photonic quantum computing
Timjan Kalajdzievski, Juan Miguel Arrazola
We propose a method for decomposing continuous-variable operations into a universal gate set, without the use of any approximations. We fully characterize a set of transformations…
Quantum algorithm for non-homogeneous linear partial differential equations
Juan Miguel Arrazola, Timjan Kalajdzievski, Christian Weedbrook +1
We describe a quantum algorithm for preparing states that encode solutions of non-homogeneous linear partial differential equations. The algorithm is a continuous-variable version…
Continuous-variable gate decomposition for the Bose-Hubbard model
Timjan Kalajdzievski, Christian Weedbrook, Patrick Rebentrost
In this work, we decompose the time-evolution of the Bose-Hubbard model into a sequence of logic gates that can be implemented on a continuous-variable photonic quantum computer. W…
Absolutely covert quantum communication
Kamil Bradler, Timjan Kalajdzievski, George Siopsis +1
We present truly ultimate limits on covert quantum communication by exploiting quantum-mechanical properties of the Minkowski vacuum in the quantum field theory framework. Our main…