Related papers: Efficient implementation of Quantum circuits with …
Protein folding processes are a vital aspect of molecular biology that is hard to simulate with conventional computers. Quantum algorithms have been proven superior for certain problems and may help tackle this complex life science…
The mapping of fermionic states onto qubit states, as well as the mapping of fermionic Hamiltonian into quantum gates enables us to simulate electronic systems with a quantum computer. Benefiting the understanding of many-body systems in…
We consider recent works on the simulation of quantum circuits using the formalism of matrix product states and the formalism of contracting tensor networks. We provide simplified direct proofs of many of these results, extending an…
This paper introduces an efficient quantum computing method for reducing special graphs in the context of the graph coloring problem. The special graphs considered include both symmetric and non-symmetric graphs where the axis passes…
We perform optimal-control-theory calculations to determine the minimum number of two-qubit CNOT gates needed to perform quantum state preparation and unitary operator synthesis for few-qubit systems. By considering all possible gate…
It is known that it is possible to encode a logical qubit over many physical qubits such that it is immune to the effects of collective decoherence, and it is possible to perform universal quantum computation using these `decoherence-free'…
We provide a simple framework for the synthesis of quantum circuits based on a numerical optimization algorithm. This algorithm is used in the context of the trapped-ions technology. We derive theoretical lower bounds for the number of…
A conception of virtual quantum information bit - virtual qubit - is introduced. It is shown by means of virtual qubit representation that four states of a single quantum particle is enough for implementation of full set of the gates, which…
The current noisy intermediate-scale quantum (NISQ) era is characterized by substantial errors and noise, which limit the practical feasibility of deep, many-qubit circuits. To address these constraints, quantum circuit cutting has emerged…
Today's devices for quantum computing are still far from implementing useful and powerful quantum algorithms. Decoherence and the wish to resist the effects of errors in a system of quantum bits incurs a lot of overhead in the number of…
The quantum permutation algorithm provides computational speed-up over classical algorithms in determining the parity of a given cyclic permutation. For its $n$-qubit implementations, the number of required quantum gates scales…
When scaling up quantum processors in a cryogenic environment, it is desirable to limit the number of qubit drive lines going into the cryostat, since fewer lines makes cooling of the system more manageable and the need for complicated…
We construct a minimal robust controlled-NOT gate with an Ising-type interaction by which elementary two-qubit gates are implemented. It is robust against inaccuracy of the coupling strength and the obtained quantum circuits are constructed…
The speed of elementary quantum gates ultimately sets the limit on the speed at which quantum circuits can operate. For a fixed physical interaction strength between two qubits, the speed of any two-qubit gate is limited even with…
The engineering of quantum devices has reached the stage where we now have small scale quantum processors containing multiple interacting qubits within them. Simple quantum circuits have been demonstrated and scaling up to larger numbers is…
Advances in recent years have made it possible to explore quantum dots as a viable technology for scalable quantum information processing. Charge qubits for example can be realized in the lowest bound states of coupled quantum dots and the…
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…
Optimal implementation of quantum gates is crucial for designing a quantum computer. The necessary condition for optimal construction of a two-qubit unitary operation is obtained. It can be proved that the B gate is the unique gate that can…
Quantum computers provide a fundamentally new computing paradigm that promises to revolutionize our ability to solve broad classes of problems. Surprisingly, the basic mathematical structures of gate-based quantum computing, such as unitary…
Within the general context of the architecture in quantum computer design, this paper aims is to provide a general strategy to obtain a block-matrix representation of quantum gates applied to qubits placed in arbitrary positions over an…