The QUISA (Quantum Information, Simulation and Algorithms) Research Centre, hosted at The University of Western Australia, aims to foster collaboration and entrepreneurship, bringing together academic staff, research students, government and industrial partners to develop innovative quantum solutions to tackle otherwise intractable problems and complex phenomena.

@article{Zhou2017,

title = {Quantum Fourier transform in computational basis},

author = {S S Zhou and T Loke and J A Izaac and J B Wang},

url = {https://doi.org/10.1007/s11128-017-1515-0},

doi = {10.1007/s11128-017-1515-0},

issn = {1573-1332},

year  = {2017},

date = {2017-02-10},

urldate = {2017-02-10},

journal = {Quantum Information Processing (IF 2.349)},

volume = {16},

number = {3},

pages = {82},

abstract = {The quantum Fourier transform, with exponential speed-up compared to the classical fast Fourier transform, has played an important role in quantum computation as a vital part of many quantum algorithms (most prominently, Shor's factoring algorithm). However, situations arise where it is not sufficient to encode the Fourier coefficients within the quantum amplitudes, for example in the implementation of control operations that depend on Fourier coefficients. In this paper, we detail a new quantum scheme to encode Fourier coefficients in the computational basis, with fidelity $$1 - backslashdelta $$1-$delta$and digit accuracy $$backslashepsilon $$ϵfor each Fourier coefficient. Its time complexity depends polynomially on $$backslashlog (N)$$log(N), where N is the problem size, and linearly on $$1/backslashdelta $$1/$delta$and $$1/backslashepsilon $$1/ϵ. We also discuss an application of potential practical importance, namely the simulation of circulant Hamiltonians.},

keywords = {},

pubstate = {published},

tppubtype = {article}

}

@article{FALLOON2017162,

title = {QSWalk: A Mathematica package for quantum stochastic walks on arbitrary graphs},

author = {Peter E Falloon and Jeremy Rodriguez and Jingbo B Wang},

url = {http://www.sciencedirect.com/science/article/pii/S0010465517301029},

doi = {https://doi.org/10.1016/j.cpc.2017.03.014},

issn = {0010-4655},

year  = {2017},

date = {2017-01-01},

urldate = {2017-01-01},

journal = {Computer Physics Communications (IF 4.390)},

volume = {217},

pages = {162 - 170},

abstract = {We present a Mathematica package, QSWalk, to simulate the time evaluation of Quantum Stochastic Walks (QSWs) on arbitrary directed and weighted graphs. QSWs are a generalization of continuous time quantum walks that incorporate both coherent and incoherent dynamics and as such, include both quantum walks and classical random walks as special cases. The incoherent component allows for quantum walks along directed graph edges. The dynamics of QSWs are expressed using the Lindblad formalism, originally developed for open quantum systems, which frames the problem in the language of density matrices. For a QSW on a graph of N vertices, we have a sparse superoperator in an N2-dimensional space, which can be solved efficiently using the built-in MatrixExp function in Mathematica. We illustrate the use of the QSWalk package through several example case studies. Program summary Program Title: QSWalk.m Program Files doi: http://dx.doi.org/10.17632/8rwd3j9zhk.1 Licensing provisions: GNU General Public License 3 (GPL) Programming language: Mathematica. Nature of problem: The QSWalk package provides a method for simulating quantum stochastic walks on arbitrary (directed/undirected, weighted/unweighted) graphs. Solution method: For an N-vertex graph, the solution of a quantum stochastic walk can be expressed as an N2×N2 sparse matrix exponential. The QSWalk package makes use of Mathematica’s sparse linear algebra routines to solve this efficiently. Restrictions: The size of graphs that can be treated is constrained by available memory.},

keywords = {},

pubstate = {published},

tppubtype = {article}

}

@article{qiang2016efficientb,

title = {Efficient quantum walk on a quantum processor},

author = {Xiaogang Qiang and Thomas Loke and Ashley Montanaro and Kanin Aungskunsiri and Xiaoqi Zhou and Jeremy L O’Brien and Jingbo B Wang and Jonathan CF Matthews},

url = {https://www.nature.com/articles/ncomms11511.pdf?origin=ppub},

doi = {10.1038/ncomms11511},

year  = {2017},

date = {2017-01-01},

urldate = {2017-01-01},

journal = {Nature communications (IF 14.920)},

volume = {7},

number = {1},

pages = {1--6},

publisher = {Nature Publishing Group},

abstract = {The random walk formalism is used across a wide range of applications, from modelling share

prices to predicting population genetics. Likewise, quantum walks have shown much potential

as a framework for developing new quantum algorithms. Here we present explicit efficient

quantum circuits for implementing continuous-time quantum walks on the circulant class of

graphs. These circuits allow us to sample from the output probability distributions of quantum

walks on circulant graphs efficiently. We also show that solving the same sampling problem

for arbitrary circulant quantum circuits is intractable for a classical computer, assuming

conjectures from computational complexity theory. This is a new link between

continuous-time quantum walks and computational complexity theory and it indicates a

family of tasks that could ultimately demonstrate quantum supremacy over classical

computers. As a proof of principle, we experimentally implement the proposed quantum

circuit on an example circulant graph using a two-qubit photonics quantum processor.},

keywords = {},

pubstate = {published},

tppubtype = {article}

}

@article{SWADDLE20173391,

title = {Generating three-qubit quantum circuits with neural networks},

author = {Michael Swaddle and Lyle Noakes and Harry Smallbone and Liam Salter and Jingbo Wang},

url = {http://www.sciencedirect.com/science/article/pii/S0375960117308009},

doi = {https://doi.org/10.1016/j.physleta.2017.08.043},

issn = {0375-9601},

year  = {2017},

date = {2017-01-01},

urldate = {2017-01-01},

journal = {Physics Letters A (IF 2.066)},

volume = {381},

number = {39},

pages = {3391 - 3395},

abstract = {A new method for compiling quantum algorithms is proposed and tested for a three qubit system. The proposed method is to decompose a unitary matrix U, into a product of simpler Uj via a neural network. These Uj can then be decomposed into product of known quantum gates. Key to the effectiveness of this approach is the restriction of the set of training data generated to paths which approximate minimal normal subRiemannian geodesics, as this removes unnecessary redundancy and ensures the products are unique. The two neural networks are shown to work effectively, each individually returning low loss values on validation data after relatively short training periods. The two networks are able to return coefficients that are sufficiently close to the true coefficient values to validate this method as an approach for generating quantum circuits. There is scope for more work in scaling this approach for larger quantum systems.},

keywords = {},

pubstate = {published},

tppubtype = {article}

}

@article{Loke_2017,

title = {Efficient quantum circuits for continuous-time quantum walks on composite graphs},

author = {T Loke and J B Wang},

url = {https://doi.org/10.1088/1751-8121/aa53a9},

doi = {10.1088/1751-8121/aa53a9},

year  = {2017},

date = {2017-01-01},

urldate = {2017-01-01},

journal = {Journal of Physics A: Mathematical and Theoretical (IF 2.132)},

volume = {50},

number = {5},

pages = {055303},

publisher = {IOP Publishing},

abstract = {In this paper, we investigate the simulation of continuous-time quantum walks on specific classes of graphs, for which it is possible to fast-forward the time-evolution operator to achieve constant-time simulation complexity and to perform the simulation exactly, i.e. , while maintaining efficiency. In particular, we discuss two classes of composite graphs, commuting graphs and Cartesian product of graphs, that contain classes of graphs which can be simulated in this fashion. This allows us to identify new families of graphs that we can efficiently simulate in a quantum circuit framework, providing practical and explicit means to explore quantum-walk based algorithms in laboratories.},

keywords = {},

pubstate = {published},

tppubtype = {article}

}

@article{doi:10.1098/rsos.160906,

title = {Efficient quantum circuits for dense circulant and circulant like operators},

author = {S S Zhou and J B Wang},

url = {https://royalsocietypublishing.org/doi/abs/10.1098/rsos.160906},

doi = {10.1098/rsos.160906},

year  = {2017},

date = {2017-01-01},

journal = {Royal Society Open Science},

volume = {4},

number = {5},

pages = {160906},

abstract = {Circulant matrices are an important family of operators, which have a wide range of applications in science and engineering-related fields. They are, in general, non-sparse and non-unitary. In this paper, we present efficient quantum circuits to implement circulant operators using fewer resources and with lower complexity than existing methods. Moreover, our quantum circuits can be readily extended to the implementation of Toeplitz, Hankel and block circulant matrices. Efficient quantum algorithms to implement the inverses and products of circulant operators are also provided, and an example application in solving the equation of motion for cyclic systems is discussed.},

keywords = {},

pubstate = {published},

tppubtype = {article}

}

@article{LOKE201764,

title = {Efficient quantum circuits for Szegedy quantum walks},

author = {T Loke and J B Wang},

url = {http://www.sciencedirect.com/science/article/pii/S0003491617301124},

doi = {https://doi.org/10.1016/j.aop.2017.04.006},

issn = {0003-4916},

year  = {2017},

date = {2017-01-01},

urldate = {2017-01-01},

journal = {Annals of Physics (IF 2.730)},

volume = {382},

pages = {64 - 84},

abstract = {A major advantage in using Szegedy’s formalism over discrete-time and continuous-time quantum walks lies in its ability to define a unitary quantum walk by quantizing a Markov chain on a directed or weighted graph. In this paper, we present a general scheme to construct efficient quantum circuits for Szegedy quantum walks that correspond to classical Markov chains possessing transformational symmetry in the columns of the transition matrix. In particular, the transformational symmetry criteria do not necessarily depend on the sparsity of the transition matrix, so this scheme can be applied to non-sparse Markov chains. Two classes of Markov chains that are amenable to this construction are cyclic permutations and complete bipartite graphs, for which we provide explicit efficient quantum circuit implementations. We also prove that our scheme can be applied to Markov chains formed by a tensor product. We also briefly discuss the implementation of Markov chains based on weighted interdependent networks. In addition, we apply this scheme to construct efficient quantum circuits simulating the Szegedy walks used in the quantum Pagerank algorithm for some classes of non-trivial graphs, providing a necessary tool for experimental demonstration of the quantum Pagerank algorithm.},

keywords = {},

pubstate = {published},

tppubtype = {article}

}