
A faster hafnian formula for complex matrices and its benchmarking on the Titan supercomputer
May 2018
We introduce new and simple algorithms for the calculation of the number of perfect matchings of complex weighted, undirected graphs with and without loops.
READ MORE [+] 
Implementing quantum algorithms is essential for quantum computation. We study the implementation of three quantum algorithms by performing homodyne measurements on a twodimensional…
READ MORE [+] 
Financial derivatives are contracts that can have a complex payoff dependent upon underlying benchmark assets. In this work, we present a quantum algorithm for the Monte Carlo pricing of financial derivatives.
READ MORE [+] 
Quantum generative adversarial learning
April 2018
Generative adversarial networks (GANs) represent a powerful tool for classical machine learning: a generator tries to create statistics for data that mimics those of a true data set, while a discriminator tries to discriminate between the true and fake data.
READ MORE [+] 
Quantum generative adversarial networks
April 2018
Quantum machine learning is expected to be one of the first potential generalpurpose applications of nearterm quantum devices. A major recent breakthrough in classical machine learning is the notion of generative adversarial training, where…
READ MORE [+] 
We introduce Strawberry Fields, an opensource quantum programming architecture for lightbased quantum computers.
READ MORE [+] 
Boson sampling devices are a prime candidate for exhibiting quantum supremacy, yet their application
READ MORE [+]
for solving problems of practical interest is less well understood. Here we show that Gaussian
boson sampling (GBS) can be used… 
Hard optimization problems are often approached by finding approximate solutions. Here, we highlight the concept of proportional sampling and discuss how it can be used to improve the performance of stochastic algorithms for optimization.
READ MORE [+] 
The basic idea of quantum computing is surprisingly similar to that of kernel methods in machine learning, namely to efficiently perform computations in an intractably large Hilbert space.
READ MORE [+] 
ON states as resource units for universal quantum computation with photonic architectures
February 2018
Universal quantum computation using photonic systems requires gates whose Hamiltonians are beyond quadratic in the quadrature operators. Proposals to implement such gates usually require intricate preparation of nonGaussian states…
READ MORE [+] 
In this work, we decompose the timeevolution of the BoseHubbard model into a sequence of logic gates that can be implemented on a continuousvariable photonic quantum computer.
READ MORE [+] 
We introduce an efficient scheme to correct errors due to the finite squeezing effects in continuousvariable cluster states. Specifically, we consider the typical situation where the class of algorithms consists of input states that are known.
READ MORE [+] 
Quantum supremacy and highdimensional integration
December 2017
We establish a connection between continuousvariable quantum computing and highdimensional integration by showing that the outcome probabilities of continuousvariable instantaneous quantum polynomial (CVIQP) circuits…
READ MORE [+] 
A famously hard graph problem with a broad range of applications is computing the number of perfect matchings, that is the number of unique and complete pairings of the vertices of a graph.
READ MORE [+] 
A Quantum Hopfield Neural Network
October 2017
Quantum computing allows for the potential of significant advancements in both the speed and the capacity of widelyused machine learning techniques.
READ MORE [+]