Related papers: Basis Optimization Renormalization Group for Quant…
A simple example is used to show that renormalization group limit cycles of effective quantum theories can be studied in a new way. The method is based on the similarity renormalization group procedure for Hamiltonians. The example contains…
In this note we point out the fact that the proper conceptual setting of quantum computation is the theory of Linear Time Invariant systems. To convince readers of the utility of the approach, we introduce a new model of computation based…
The performance of computational methods for many-body physics and chemistry is strongly dependent on the choice of basis used to cast the problem; hence, the search for better bases and similarity transformations is important for progress…
Reducing the complexity of quantum algorithms to treat quantum chemistry problems is essential to demonstrate an eventual quantum advantage of Noisy-Intermediate Scale Quantum (NISQ) devices over their classical counterpart. Significant…
Simulation of quantum dynamics is a grand challenge of computational physics. In this work we investigate methods for reducing the demands of such simulation by identifying reduced-order models for dynamics generated by parameterized…
In some cases the state of a quantum system with a large number of subsystems can be approximated efficiently by the density matrix renormalization group, which makes use of redundancies in the description of the state. Here we show that…
We propose a new Real Space Renormalization Group transformation useful for Monte Carlo calculations in theories with global or local symmetries. From relaxation arguments we define the block-spin transformation with two tunable free…
The recently proposed excitonic renormalization framework presents an alternative ansatz to elec- tronic structure theory of weakly interacting fragments. It makes use of absolutely localized orbitals and correlated states evaluated on…
Topological quantum error-correcting codes are defined by geometrically local checks on a two-dimensional lattice of quantum bits (qubits), making them particularly well suited for fault-tolerant quantum information processing. Here, we…
A block spin renormalization group approach is proposed for the dynamical triangulation formulation of quantum gravity in arbitrary dimensions. Renormalization group flow diagrams are presented for the three-dimensional and four-dimensional…
We present quantum algorithms, for Hamiltonians of linear combinations of local unitary operators, for Hamiltonian matrix-vector products and for preconditioning with the inverse of shifted reduced Hamiltonian operator that contributes to…
In this report, we propose a novel quantum diagonalization algorithm based on the optimization of variational quantum circuits. Diagonalizing a quantum state is a fundamental yet computationally challenging task in quantum information…
Spaces of constant curvature and their motion groups are described most naturally in Cartesian basis. All these motion groups also known as CK groups are obtained from orthogonal group by contractions and analytical continuations. On the…
Recently double-bracket quantum algorithms have been proposed as a way to compile circuits for approximating eigenstates. Physically, they consist of appropriately composing evolutions under an input Hamiltonian together with diagonal…
It is proposed to map the quantum information qubit not to individual spin 1/2 states, but to the collective spin states being eigenfunctions of the Hamiltonian including spin-spin interactions, which may be not small. Such an approach…
As applied to quantum theories, the program of renormalization is successful for `renormalizable models' but fails for `nonrenormalizable models'. After some conceptual discussion and analysis, an enhanced program of renormalization is…
A fundamental challenge in quantum physics is determining the ground-state properties of many-body systems. Whereas standard approaches, such as variational calculations, consist of writing down a wave function ansatz and minimizing over…
We describe quantum many--body systems in terms of projected entangled--pair states, which naturally extend matrix product states to two and more dimensions. We present an algorithm to determine correlation functions in an efficient way. We…
We introduce a class of variational states to describe quantum many-body systems. This class generalizes matrix product states which underly the density-matrix renormalization group approach by combining them with weighted graph states.…
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 of matrix inversion: it efficiently inverts differential…