相关论文: A Systematic Algorithm for Quantum Boolean Circuit…
In parity quantum computing, multi-qubit logical gates are implemented by single-qubit rotations on a suitably encoded state involving auxiliary qubits. Consequently, there is a correspondence between qubit count and the size of the native…
Variational quantum algorithms dominate contemporary gate-based quantum enhanced optimisation, eigenvalue estimation and machine learning. Here we establish the quantum computational universality of variational quantum computation by…
We generalize quantum circuits for the Toffoli gate presented by Selinger and Jones for functionally controlled NOT gates, i.e., $X$ gates controlled by arbitrary $n$-variable Boolean functions. Our constructions target the gate set…
This paper describes a novel approach to emulate a universal quantum computer with a wholly classical system, one that uses a signal of bounded duration and amplitude to represent an arbitrary quantum state. The signal may be of any…
The implementation of a quantum computer requires the realization of a large number of N-qubit unitary operations which represent the possible oracles or which are part of the quantum algorithm. Until now there are no standard ways to…
Quantum computers process information with the laws of quantum mechanics. Current quantum hardware is noisy, can only store information for a short time, and is limited to a few quantum bits, i.e., qubits, typically arranged in a planar…
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,…
Quantum computers leverage the principles of quantum mechanics to do computation with a potential advantage over classical computers. While a single classical computer transforms one particular binary input into an output after applying one…
Optimal implementation of quantum gates is crucial for designing a quantum computer. We consider the matrix representation of an arbitrary multiqubit gate. By ordering the basis vectors using the Gray code, we construct the quantum circuit…
The quantum Fourier transform (QFT) is a ubiquitous quantum operation that is used in numerous quantum computing applications. The major obstacle to constructing a QFT circuit is that numerous elementary gates are required. Among the…
Before executing a quantum algorithm, one must first decompose the algorithm into machine-level instructions compatible with the architecture of the quantum computer, a process known as quantum compiling. There are many different quantum…
We propose a new physical approach for encoding and processing of quantum information in ensembles of multi-level quantum systems, where the different bits are not carried by individual particles but associated with the collective…
Constructing appropriate unitary matrix operators for new quantum algorithms and finding the minimum cost gate sequences for the implementation of these unitary operators is of fundamental importance in the field of quantum information and…
Unitary operations are the building blocks of quantum programs. Our task is to design effcient or optimal implementations of these unitary operations by employing the intrinsic physical resources of a given n-qubit system. The most common…
In existing general-purpose architectures for surface-code-based fault-tolerant quantum computers, the cost of a quantum computation is determined by the circuit volume, i.e., the number of qubits multiplied by the number of non-Clifford…
A quantum computer consists of a set of quantum bits upon which operations called gates are applied to perform computations. In order to perform quantum algorithms, physicists would like to design arbitrary gates to apply to quantum bits.…
We describe the construction of quantum gates (unitary operators) from boolean functions and give a number of applications. Both non-reversible and reversible boolean functions are considered. The construction of the Hamilton operator for a…
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…
With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability $p$. The…
Most quantum computer realizations require the ability to apply local fields and tune the couplings between qubits, in order to realize single bit and two bit gates which are necessary for universal quantum computation. We present a scheme…