Related papers: A mathematical model for a universal digital quant…
We present an architecture of QCPU(Quantum Central Processing Unit), based on the discrete quantum gate set, that can be programmed to approximate any n-qubit computation in a deterministic fashion. It can be built efficiently to implement…
Simulating quantum physics with a device which itself is quantum mechanical, a notion Richard Feynman originated, would be an unparallelled computational resource. However, the universal quantum simulation of fermionic systems is daunting…
Quantum computing with qudits, quantum systems with $d > 2$ levels, offers a powerful extension beyond qubits, expanding the computational possibilities of quantum systems, allowing the simplification of the implementation of several…
The steadily growing research interest in quantum computing - together with the accompanying technological advances in the realization of quantum hardware - fuels the development of meaningful real-world applications, as well as…
We present an algorithm for efficiently approximating of qubit unitaries over gate sets derived from totally definite quaternion algebras. It achieves $\varepsilon$-approximations using circuits of length $O(\log(1/\varepsilon))$, which is…
We propose an effective realization of a complete set of elementary quantum gates in the solid-state quantum computer based on the multi-atomic coherent (MAC-) ensembles in the QED cavity. Here, we use the two-ensemble qubit encoding and…
Rydberg atom arrays offer flexible geometries of strongly-interacting neutral atoms, which are useful for many quantum applications such as quantum simulation and quantum computation. Here we consider a gate-based quantum computing scheme…
Quantum computing technologies promise to revolutionize calculations in many areas of physics, chemistry, and data science. Their power is expected to be especially pronounced for problems where direct analogs of a quantum system under…
In recent years, the quantum computing community has seen an explosion of novel methods to implement non-trivial quantum computations on near-term hardware. An important direction of research has been to decompose an arbitrary entangled…
We investigate the utility of geometric (Clifford) algebras (GA) methods in two specific applications to quantum information science. First, using the multiparticle spacetime algebra (MSTA, the geometric algebra of a relativistic…
An examination of the concept of using classical degrees of freedom to drive the evolution of quantum computers is given. Specifically, when externally generated, coherent states of the electromagnetic field are used to drive transitions…
Parametrized quantum optical circuits are a class of quantum circuits in which the carriers of quantum information are photons and the gates are optical transformations. Classically optimizing these circuits is challenging due to the…
Recent studies have been spurred on by the promise of advanced quantum computing technology, which has led to the development of quantum computer simulations on classical hardware. Grover's quantum search algorithm is one of the well-known…
A digital quantum simulator is an envisioned quantum device that can be pro- grammed to efficiently simulate any other local system. We demonstrate and investigate the digital approach to quantum simulation in a system of trapped ions.…
Grover's algorithm is one of the pioneering demonstrations of the advantages of quantum computing over its classical counterpart, providing - at most - a quadratic speed-up over the classical solution for unstructured database search. The…
A quantum algorithm is a set of instructions for a quantum computer, however, unlike algorithms in classical computer science their results cannot be guaranteed. A quantum system can undergo two types of operation, measurement and quantum…
We present an efficient algorithm for twirling a multi-qudit quantum state. The algorithm can be used for approximating the twirling operation in an ensemble of physical systems in which the systems cannot be individually accessed. It can…
The improved quantum scheduling algorithm proposed by Grover has been generalized using the generalized quantum search algorithm, in which a unitary operator replaces the Walsh-Hadamard transform, and $\pi/2$ phase rotations replace the…
We propose a hybrid quantum-classical approach to model continuous classical probability distributions using a variational quantum circuit. The architecture of the variational circuit consists of two parts: a quantum circuit employed to…
The use of vectorial parameterization to create geometrical representations in computational models has a large number of applications. One particular application is the calculation of the 3D rotational motion of rigid bodies, that could be…