相关论文: Operator-Schmidt decomposition of the quantum Four…
Solving a Poisson equation is generally reduced to solving a linear system with a coefficient matrix $A$ of entries $a_{ij}$, $i,j=1,2,...,n$, from the discretized Poisson equation. Although the variational quantum algorithms are promising…
Contents 1. Creation and annihilation operators for the system of indistinguishable particles 1.1 The permutation group and the states of a system of indistinguishable particles 1.2 Dimension of the Hilbert space of a system of…
The general scheme of data compression using the quantum noiseless coding theorem of Schumacher is dicussed for general quantum sources. When the Hilbert space of the quantum source is decomposable into orthogonal subspaces, one can first…
We present a general, systematic, and efficient method for decomposing any given exponential operator of bosonic mode operators, describing an arbitrary multi-mode Hamiltonian evolution, into a set of universal unitary gates. Although our…
We study symmetric tensor decompositions, i.e. decompositions of the input symmetric tensor T of order 3 as sum of r 3rd-order tensor powers of u_i where u_i are vectors in \C^n. In order to obtain efficient decomposition algorithms, it is…
We propose an approach to the quantum-classical correspondence based on a deformation of the momentum and kinetic operators of quantum mechanics. Making use of the factorization method, we construct classical versions of the momentum and…
When two or more subsystems of a quantum system interact with each other they can become entangled. In this case the individual subsystems can no longer be described as pure quantum states. For systems with only 2 subsystems this…
The three-input TOFFOLI gate is the workhorse of circuit synthesis for classical logic operations on quantum data, e.g., reversible arithmetic circuits. In physical implementations, however, TOFFOLI gates are decomposed into six CNOT gates…
In order to build a large scale quantum computer, one must be able to correct errors extremely fast. We design a fast decoding algorithm for topological codes to correct for Pauli errors and erasure and combination of both errors and…
A family of infinite-dimensional irreducible $*$-representations on $\mathcal{H}\simeq L^2(\mathbb{R})\otimes\mathbb{C}^N$ is defined for a quantum-deformed Lorentz algebra $\mathscr{U}_{\bf q}(sl_2)\otimes \mathscr{U}_{\widetilde{\bf…
In this work we propose a novel numerical approach to decompose general quantum programs in terms of single- and two-qubit quantum gates with a $CNOT$ gate count very close to the current theoretical lower bounds. In particular, it turns…
We introduce two efficient algorithms for computing the partial Fourier transforms in one and two dimensions. Our study is motivated by the wave extrapolation procedure in reflection seismology. In both algorithms, the main idea is to…
Feynman's prescription for a quantum simulator was to find a hamitonian for a system that could serve as a computer. P\'olya and Hilbert conjecture was to demonstrate Riemann's hypothesis through the spectral decomposition of hermitian…
The best deterministic unconditionally proven integer factorization algorithms have exponential running time complexities of O(N^(1/4)) arithmetic operations, and conditional on the Riemann hypothesis, there is a deterministic algorithm of…
The non-standard quantum deformation of the (trivially) extended sl(2,R) algebra is used to construct a new quantum deformation of the two-photon algebra h_6 and its associated quantum universal R-matrix. A deformed one-boson representation…
Let $\lambda$ be a primitive root of unity of order $\ell$. We introduce a family of finite-dimensional algebras $\{\mathcal{D}_{\lambda,N}(\mathfrak{sl}_2)\}_{N\in\mathbb{N}_0}$ over the complex numbers, such that…
Physical quark-number charges of dyons are determined, via a formula which generalizes that of Witten for the electric charge, in N=2 supersymmetric theories with $SU(2) \times U(1)^{N_f} $ gauge group. The quark numbers of the massless…
A recurrence scheme is presented to decompose an $n$-qubit unitary gate to the product of no more than $N(N-1)/2$ single qubit gates with small number of controls, where $N = 2^n$. Detailed description of the recurrence steps and formulas…
Current proposals for quantum compilers require the synthesis and optimization of linear reversible circuits and among them CNOT circuits. Since these circuits represent a significant part of the cost of running an entire quantum circuit,…
Unitary decomposition is a widely used method to map quantum algorithms to an arbitrary set of quantum gates. Efficient implementation of this decomposition allows for translation of bigger unitary gates into elementary quantum operations,…