相关论文: Quantum adders: on the structural link between the…

Feature selection is a common step in many ranking, classification, or prediction tasks and serves many purposes. By removing redundant or noisy features, the accuracy of ranking or classification can be improved and the computational cost…

We study the achievements of quantum circuits comprised of several one- and two-qubit gates. Quantum process matrices are determined for the basic one- and two-qubit gate operations and concatenated to yield the process matrix of the…

Topological quantum computation may provide a robust approach for encoding and manipulating information utilizing the topological properties of anyonic quasi-particle excitations. We develop an efficient means to map between dense and…

We introduce superposition-based quantum networks composed of (i) the classical perceptron model of multilayered, feedforward neural networks and (ii) the algebraic model of evolving reticular quantum structures as described in quantum…

Each year, the gap between theoretical proposals and experimental endeavours to create quantum computers gets smaller, driven by the promise of fundamentally faster algorithms and quantum simulations. This occurs by the combination of…

We present quantum circuits for comparison and increment operations that achieve an asymptotically optimal gate count of $\Theta(n)$ and depth of $\Theta(\log n)$ over the Clifford+Toffoli gate set, while using a provably minimal number of…

I give analytical estimates and numerical simulation results for the performance of Kitaev's 2d topological error-correcting codes. By providing methods for the execution of an encoded three-qubit Toffoli gate, I complete a universal gate…

Lloyd et al. were first to demonstrate the promise of quantum algorithms for computing Betti numbers, a way to characterize topological features of data sets. Here, we propose, analyze, and optimize an improved quantum algorithm for…

The decomposition of complex quantum operations into experimentally feasible gate sets has been a central challenge since the early development of quantum computing. The multi-controlled Toffoli (MCT) gate is a key example, with…

Multiplication over binary fields is a crucial operation in quantum algorithms designed to solve the discrete logarithm problem for elliptic curve defined over $GF(2^n)$. In this paper, we present an algorithm for constructing quantum…

We present two deterministic schemes for constructing a CNOT gate and a Toffoli gate on photon-atom and photon-atom-atom hybrid quantum systems assisted by bad cavities, respectively. They are achieved by cavity-assisted photon scattering…

We introduce three compact graph states that can be used to perform a measurement-based Toffoli gate. Given a weighted graph of six, seven or eight qubits, we show that success probabilities of 1/4, 1/2 and 1 respectively can be achieved.…

The paper explores the basic geometrical properties of the observables characterizing two-qubit systems by employing a novel projective ring geometric approach. After introducing the basic facts about quantum complementarity and maximal…

A theory of principal bundles possessing quantum structure groups and classical base manifolds is presented. Structural analysis of such quantum principal bundles is performed. A differential calculus is constructed, combining differential…

Though quantum algorithm acts as an important role in quantum computation science, not only for providing a great vision for solving classically unsolvable problems, but also due to the fact that it gives a potential way of understanding…

Quantum computing, leveraging the principles of quantum mechanics, has been found to significantly enhance computational capabilities in principle, in some cases beyond classical computing limits. This paper explores quantum computing's…

There are two important, and potentially interconnecting, avenues to the realisation of large-scale quantum algorithms: improvement of the hardware, and reduction of resource requirements demanded by algorithm components. In focusing on the…

Quantum compiling, a process that decomposes the quantum algorithm into a series of hardware-compatible commands or elementary gates, is of fundamental importance for quantum computing. We introduce an efficient algorithm based on deep…

The paper presents a systematic study and implementation of a reconfigurable combinatorial multi-operand adder for use in Deep Learning systems. The size of carry changes with the number of operands and hence a reliable algorithm to…

We propose a scheme to achieve quantum computation with neutral atoms whose interactions are catalyzed by single photons. Conditional quantum gates, including an $N$-atom Toffoli gate and nonlocal gates on remote atoms, are obtained through…