Related papers: A dynamical implementation of canonical second qua…
Quantum computers are promising tools for the simulation of many-body systems, and among those, QCD stands out by its rich phenomenology. Every simulation starts with a codification, and here we succently review a newly developed compact…
Contents 1. Creation and annihilation operators for the system of indistinguishable particles 1.1 The permutation group and the states of a system of indistinguishable particles 1.2 Dimension of the Hilbert space of a system of…
In this work, we present a quantum algorithm for ground-state energy calculations of periodic solids on error-corrected quantum computers. The algorithm is based on the sparse qubitization approach in second quantization and developed for…
A practical method is developed to deal with the second quantization of the many-body system containing the composite particles. In our treatment, the modes associated with composite particles are regarded approximately as independent ones…
Simulating molecules is believed to be one of the early-stage applications for quantum computers. Current state-of-the-art quantum computers are limited in size and coherence, therefore optimizing resources to execute quantum algorithms is…
Quantum chemistry simulations on a quantum computer suffer from the overhead needed for encoding the fermionic problem in a bosonic system of qubits. By exploiting the block diagonality of a fermionic Hamiltonian, we show that the number of…
Any unitary transformation of quantum computational networks is explicitly decomposed, in an exact and unified form, into a sequence of a limited number of one-qubit quantum gates and the two-qubit diagonal gates that have diagonal unitary…
The ability of implementing quantum operations plays fundamental role in manipulating quantum systems. Creation and annihilation operators which transform a quantum state to another by adding or subtracting a particle are crucial of…
A quantum computer directly manipulates information stored in the state of quantum mechanical systems. The available operations have many attractive features but also underly severe restrictions, which complicate the design of quantum…
Quantum computers, which take advantage of the superposition and entanglement of physical states, could outperform their classical counterparts in solving problems with technological impact, such as factoring large numbers and searching…
Implementing a qubit quantum computer in continuous-variable systems conventionally requires the engineering of specific interactions according to the encoding basis states. In this work, we present a unified formalism to conduct universal…
We show in detail how the Jordan-Wigner transformation can be used to simulate any fermionic many-body Hamiltonian on a quantum computer. We develop an algorithm based on appropriate qubit gates that takes a general fermionic Hamiltonian,…
Time evolution of quantum systems is of interest in physics, in chemistry, and, more recently, in computer science. Quantum computers are suggested as one route to propagating quantum systems far more efficiently than ordinary numerical…
One of the traditional ways of introducing bosons and fermions is through creation-annihilation algebras. Historically, these have been associated with emission and absorption processes at the quantum level and are characteristic of the…
Quantum computing uses the physical principles of very small systems to develop computing platforms which can solve problems that are intractable on conventional supercomputers. There are challenges not only in building the required…
We propose an iterative algorithm to simulate the dynamics generated by any $n$-qubit Hamiltonian. The simulation entails decomposing the unitary time evolution operator $U$ (unitary) into a product of different time-step unitaries. The…
In conventional quantum mechanics, quantum no-deleting and no-cloning theorems indicate that two different and nonorthogonal states cannot be perfectly and deterministically deleted and cloned, respectively. Here, we investigate the quantum…
Variational quantum algorithms are promising applications of noisy intermediate-scale quantum (NISQ) computers. These algorithms consist of a number of separate prepare-and-measure experiments that estimate terms in a Hamiltonian. The…
A new model of quantum computation is considered, in which the connections between gates are programmed by the state of a quantum register. This new model of computation is shown to be more powerful than the usual quantum computation, e. g.…
Quantum computing not only holds the potential to solve long-standing problems in quantum physics, but also to offer speed-ups across a broad spectrum of other fields. However, due to the noise and the limited scale of current quantum…