Related papers: Permutation-invariant quantum circuits
Quantum Computing offers a potentially powerful new method for performing Machine Learning. However, several Quantum Machine Learning techniques have been shown to exhibit poor generalisation as the number of qubits increases. We address…
We propose a scheme to restore spatial symmetry of Hamiltonian in the variational-quantum-eigensolver (VQE) algorithm for which the quantum circuit structures used usually break the Hamiltonian symmetry. The symmetry-adapted VQE scheme…
Reversing unitary operations is a key task in quantum computing and quantum control. In this work, we introduce and develop the framework of shadow unitary inversion, a relaxed variant of unitary inversion in which the goal is to reproduce…
Given a differential equation with infinite-dimensional symmetry pseudo-group it is shown, using an example, that it is generally not possible to construct enough joint invariants to form an invariant numerical scheme of the equation. To…
We show how to construct path integrals for quantum mechanical systems where the space of configurations is a general non-compact symmetric space. Associated with this path integral is a perturbation theory which respects the global…
Parametric quantum circuits play a crucial role in the performance of many variational quantum algorithms. To successfully implement such algorithms, one must design efficient quantum circuits that sufficiently approximate the solution…
Many standard linear algebra problems can be solved on a quantum computer by using recently developed quantum linear algebra algorithms that make use of block encodings and quantum eigenvalue/singular value transformations. A block encoding…
The variational quantum-classical algorithms are the most promising approach for achieving quantum advantage on near-term quantum simulators. Among these methods, the variational quantum eigensolver has attracted a lot of attention in…
Using the circulant symmetry of a Hamiltonian describing three qubits, we realize the quantum Fourier transform. This symmetry allows us to construct a set of eigenvectors independently on the magnitude of physical parameters involved in…
This is a self-contained review on the theory of quantum group and its applications to modern physics. A brief introduction is given to the Yang-Baxter equation in integrable quantum field theory and lattice statistical physics. The quantum…
Quantum maps are fundamental to quantum information theory and open quantum systems. Covariant or weakly symmetric quantum maps, in particular, play a key role in defining quantum evolutions that respect thermodynamics, establish free…
Quadratic Unconstrained Binary Optimization (QUBO) is a standard NP-hard optimization problem. Recently, it has gained renewed interest through quantum computing, as QUBOs directly reduce to the Ising model, on which quantum annealing…
The permutation group $S_N$ has a quantum analogue $S_N^+$, which is infinite at $N\geq4$. We review the known facts regarding $S_N^+$, and notably its easiness property, Weingarten calculus, and the isomorphism $S_4^+=SO_3^{-1}$ and its…
The fastest quantum algorithms (for the solution of classical computational tasks) known so far are basically variations of the hidden subgroup problem with {$f(U[x])=f(x)$}. Following a discussion regarding which tasks might be solved…
We discuss three applications of efficient quantum algorithms to determining properties of permutations and group automorphisms. The first uses the Bernstein-Vazirani algorithm to determine an unknown homomorphism from $Z_{p-1}^{m}$ to…
We give a path integral construction of the quantum mechanical partition function for gauged finite groups. Our construction gives the quantization of a system of $d$, $N\times N$ matrices invariant under the adjoint action of the symmetric…
We introduce the concept of quantum supermap, describing the most general transformation that maps an input quantum operation into an output quantum operation. Since quantum operations include as special cases quantum states, effects, and…
Two different algorithms are presented for generating a quantum circuit realization of a matrix representing a permutation on $2^n$ letters. All circuits involve $n$ qubits and only use multi--controlled Toffoli gates. The first algorithm…
The SWAP gate has become an integral feature of quantum circuit architectures and is designed to permute the states of two qubits through the use of the well-known controlled-NOT gate. We consider the question of whether a two-qudit quantum…
Recently, there has been increasing interest in designing schemes for quantum computations that are robust against errors. Although considerable research has been devoted to developing quantum error correction schemes, much less attention…