arXiv subjects

James Dborin

Publications and source records attributed to James Dborin.

6 recordsLinked to original sources

arXiv2022

Simulating groundstate and dynamical quantum phase transitions on a superconducting quantum computer

We optimise a translationally invariant, sequential quantum circuit on a superconducting quantum device to simulate the groundstate of the quantum Ising model through its quantum critical point. We further demonstrate how the dynamical quantum critical point found in quenches of this model across its quantum critical point can be simulated. Our approach avoids finite-size scaling effects by using sequential quantum circuits inspired by infinite matrix product states. We provide efficient circuits and a variety of error mitigation strategies to implement, optimise and time-evolve these states.

quant-ph↗

arXiv2022

Improvements to Gradient Descent Methods for Quantum Tensor Network Machine Learning

Tensor networks have demonstrated significant value for machine learning in a myriad of different applications. However, optimizing tensor networks using standard gradient descent has proven to be difficult in practice. Tensor networks suffer from initialization problems resulting in exploding or vanishing gradients and require extensive hyperparameter tuning. Efforts to overcome these problems usually depend on specific network architectures, or ad hoc prescriptions. In this paper we address the problems of initialization and hyperparameter tuning, making it possible to train tensor networks using established machine learning techniques. We introduce a `copy node' method that successfully initializes arbitrary tensor networks, in addition to a gradient based regularization technique for bond dimensions. We present numerical results that show that the combination of techniques presented here produces quantum inspired tensor network models with far fewer parameters, while improving generalization performance.

cs.LG↗

arXiv2021

Optimal local unitary encoding circuits for the surface code

The surface code is a leading candidate quantum error correcting code, owing to its high threshold, and compatibility with existing experimental architectures. Bravyi et al. (2006) showed that encoding a state in the surface code using local unitary operations requires time at least linear in the lattice size $L$, however the most efficient known method for encoding an unknown state, introduced by Dennis et al. (2002), has $O(L^2)$ time complexity. Here, we present an optimal local unitary encoding circuit for the planar surface code that uses exactly $2L$ time steps to encode an unknown state in a distance $L$ planar code. We further show how an $O(L)$ complexity local unitary encoder for the toric code can be found by enforcing locality in the $O(\log L)$-depth non-local renormalisation encoder. We relate these techniques by providing an $O(L)$ local unitary circuit to convert between a toric code and a planar code, and also provide optimal encoders for the rectangular, rotated and 3D surface codes. Furthermore, we show how our encoding circuit for the planar code can be used to prepare fermionic states in the compact mapping, a recently introduced fermion to qubit mapping that has a stabiliser structure similar to that of the surface code and is particularly efficient for simulating the Fermi-Hubbard model.

quant-ph↗

arXiv2021

Matrix Product State Pre-Training for Quantum Machine Learning

Hybrid Quantum-Classical algorithms are a promising candidate for developing uses for NISQ devices. In particular, Parametrised Quantum Circuits (PQCs) paired with classical optimizers have been used as a basis for quantum chemistry and quantum optimization problems. Training PQCs relies on methods to overcome the fact that the gradients of PQCs vanish exponentially in the size of the circuits used. Tensor network methods are being increasingly used as a classical machine learning tool, as well as a tool for studying quantum systems. We introduce a circuit pre-training method based on matrix product state machine learning methods, and demonstrate that it accelerates training of PQCs for both supervised learning, energy minimization, and combinatorial optimization.

quant-ph↗

arXiv2021

Parallel Quantum Simulation of Large Systems on Small Quantum Computers

Tensor networks permit computational and entanglement resources to be concentrated in interesting regions of Hilbert space. Implemented on NISQ machines they allow simulation of quantum systems that are much larger than the computational machine itself. This is achieved by parallelising the quantum simulation. Here, we demonstrate this in the simplest case; an infinite, translationally invariant quantum spin chain. We provide Cirq and Qiskit code that translate infinite, translationally invariant matrix product state (iMPS) algorithms to finite-depth quantum circuit machines, allowing the representation, optimisation and evolution arbitrary one-dimensional systems. Illustrative simulated output of these codes for achievable circuit sizes is given.

quant-ph↗

arXiv2020

Automatic Post-selection by Ancillae Thermalisation

Tasks such as classification of data and determining the groundstate of a Hamiltonian cannot be carried out through purely unitary quantum evolution. Instead, the inherent non-unitarity of the measurement process must be harnessed. Post-selection and its extensions provide a way to do this. However they make inefficient use of time resources -- a typical computation might require $O(2^m)$ measurements over $m$ qubits to reach a desired accuracy. We propose a method inspired by the eigenstate thermalisation hypothesis, that harnesses the induced non-linearity of measurement on a subsystem. Post-selection on $m$ ancillae qubits is replaced with tracing out $O(\log\epsilon / \log(1-p))$ (where p is the probability of a successful measurement) to attain the same accuracy as the post-selection circuit. We demonstrate this scheme on the quantum perceptron and phase estimation algorithm. This method is particularly advantageous on current quantum computers involving superconducting circuits.

quant-ph↗