相关论文: The Iterative Unitary Matrix Multiply Method and I…
Quantum Monte Carlo (QMC) methods are often used to calculate properties of many body quantum systems. The main cost of many QMC methods, for example the variational Monte Carlo (VMC) method, is in constructing a sequence of Slater matrices…
Here we revisit the quantum phase estimation (QPE) algorithm, and devise an iterative method to improve the precision of QPE with propagators over a variety of time spans. For a given propagator and a certain eigenstate as input, QPE with…
Presented here is a matrix inversion method utilizing quantum searching algorithm. In this method, huge Hilbert space as a whole spanned by myriad of eigen states is searched and evaluated efficiently by sequential reduction in dimension…
We propose a quantum algorithm for finding eigenvalues of non-unitary matrices. We show how to construct, through interactions in a quantum system and projective measurements, a non-Hermitian or non-unitary matrix and obtain its eigenvalues…
Quantum annealing is a method developed to solve combinatorial optimization problems by utilizing quantum bits. Solving such problems corresponds to minimizing a cost function defined over binary variables. However, in many practical cases,…
We present an approach of constructing invariants under local unitary transformations for multipartite quantum systems. The invariants constructed in this way can be complement to that in [Science 340 (2013) 1205-1208]. Detailed examples…
A matrix balanced version of the Recursive Centered T Matrix Algorithm (RCTMA) applicable to systems possessing resonant inter-particle couplings is presented. Possible domains of application include systems containing interacting localized…
The study of quantum resonances in the chaotic atom-optics kicked rotor system is of interest from two different perspectives. In quantum chaos, it marks out the regime of resonant quantum dynamics in which the atomic cloud displays…
We examine the physical implementation of a discrete time quantum walk with a four-dimensional coin. Our quantum walker is a photon moving repeatedly through a time delay loop, with time being our position space. The quantum coin is…
A numerical matrix methodology is applied to quantum problems with periodic potentials. The procedure consists essentially in replacing the true potential by an alternative one, restricted by an infinite square well, and in expressing the…
While Nuclear Magnetic Resonance (NMR) techniques are unlikely to lead to a large scale quantum computer they are well suited to investigating basic phenomena and developing new techniques. Indeed it is likely that many existing NMR…
We report the realization of a nuclear magnetic resonance computer with three quantum bits that simulates an adiabatic quantum optimization algorithm. Adiabatic quantum algorithms offer new insight into how quantum resources can be used to…
We study processes with unstable particles in intermediate time-like states. It is shown that the amplitudes squared of such processes factor exactly in the framework of the model of unstable particles with continuous masses. Decay widths…
We present a generalized equations-of-motion method that efficiently calculates energy spectra and matrix elements for algebraic models. The method is applied to a 5-dimensional quartic oscillator that exhibits a quantum phase transition…
Quantum algorithms for computing classical nonlinear maps are widely known for toy problems but might not suit potential applications to realistic physics simulations. Here, we propose how to compute a general differentiable invertible…
Traditional numerical methods for calculating matrix eigenvalues are prohibitively expensive for high-dimensional problems. Iterative random sparsification methods allow for the estimation of a single dominant eigenvalue at reduced cost by…
We show that deterministic quantum computing with one qubit (DQC1) can be experimentally implemented with a spatial light modulator, using the polarization and the transverse spatial degrees of freedom of light. The scheme allows the…
Using the multilayer convolutional neural network (CNN), we can detect the quantum phases in random electron systems, and phase diagrams of two and higher dimensional Anderson transitions and quantum percolations as well as disordered…
The synthesis of a quantum circuit consists in decomposing a unitary matrix into a series of elementary operations. In this paper, we propose a circuit synthesis method based on the QR factorization via Householder transformations. We…
Algorithm unrolling methods have proven powerful for solving the regularized least squares problem in computational magnetic resonance imaging (MRI). These approaches unfold an iterative algorithm with a fixed number of iterations,…