Related papers: Arithmetic Circuits for Multilevel Qudits Based on…
Various physical constraints limit the number of qubits that can be implemented in a single quantum processor, and thus it is necessary to connect multiple quantum processors via quantum interconnects. While several compiler implementations…
Executing quantum algorithms over distributed quantum systems requires quantum circuits to be divided into sub-circuits which communicate via entanglement-based teleportation. Naively mapping circuits to qubits over multiple quantum…
Quantum mechanics requires the operation of quantum computers to be unitary, and thus makes it important to have general techniques for developing fast quantum algorithms for computing unitary transforms. A quantum routine for computing a…
We describe an architecture based on a processing 'core' where multiple qubits interact perpetually, and a separate 'store' where qubits exist in isolation. Computation consists of single qubit operations, swaps between the store and the…
We study the computation power of lattices composed of two dimensional systems (qubits) on which translationally invariant global two-qubit gates can be performed. We show that if a specific set of 6 global two qubit gates can be performed,…
We show, within the circuit model, how any quantum computation can be efficiently performed using states with only real amplitudes (a result known within the Quantum Turing Machine model). This allows us to identify a 2-qubit (in fact…
Quantum circuit simulators have a long tradition of exploiting massive hardware parallelism. Most of the times, parallelism has been supported by special purpose libraries tailored specifically for the quantum circuits. Quantum circuit…
A fundamental step of any quantum algorithm is the preparation of qubit registers in a suitable initial state. Often qubit registers represent a discretization of continuous variables and the initial state is defined by a multivariate…
Qutrit (or ternary) structures arise naturally in many quantum systems, particularly in certain non-abelian anyon systems. We present efficient circuits for ternary reversible and quantum arithmetics. Our main result is the derivation of…
Low depth measurement-based quantum computation with qudits ($d$-level systems) is investigated and a precise relationship between this powerful model and qudit quantum circuits is derived in terms of computational depth and size…
Specific quantum algorithms exist to-in theory-break elliptic curve cryptographic protocols. Implementing these algorithms requires designing quantum circuits that perform elliptic curve arithmetic. To accurately judge a cryptographic…
Quantum computation architecture based on $d$-level systems, or qudits, has attracted considerable attention recently due to their enlarged Hilbert space. Extensive theoretical and experimental studies have addressed aspects of algorithms…
Universal quantum computation can be realised using both continuous-time and discrete-time quantum walks. We present a version based on single particle discrete-time quantum walk to realize multi-qubit computation tasks. The scalability of…
The multisilce method is an important algorithm for electron diffraction and image simulations in transmission electron microscopy. We have proposed a quantum algorithm of the multislice method based on quantum circuit model previously. In…
Simulating many-body fermionic systems in conventional qubit-based quantum computers poses significant challenges due to the overheads associated with the encoding of fermionic statistics in qubits, leading to the proposal of native…
The notion of universal quantum computation can be generalized to multi-level qudits, which offer advantages in resource usage and algorithmic efficiencies. Trapped ions, which are pristine and well-controlled quantum systems, offer an…
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…
Recently proposed implementations of quantum computer suffer from unavoidable interaction between quantum bits depending upon data being written in them. Novel procedure of avoiding multiqubit errors arising due to uncontrollable…
We present a formalism for encoding the logical basis of a qubit into subspaces of multiple physical levels. The need for this multilevel encoding arises naturally in situations where the speed of quantum operations exceeds the limits…
Quantum circuits for basic image processing functions such as bilinear interpolation are required to implement image processing algorithms on quantum computers. In this work, we propose quantum circuits for the bilinear interpolation of…