Related papers: Quantum circuit synthesis for fermionic excitation…
In general, a quantum circuit is constructed with elementary gates, such as one-qubit gates and CNOT gates. It is possible, however, to speed up the execution time of a given circuit by merging those elementary gates together into larger…
Superconducting circuit quantisation conventionally starts from classical Euler-Lagrange circuit equations-of-motion. Invoking the correspondence principle yields a canonically quantised circuit description of circuit dynamics over a…
Shallow, CNOT-efficient quantum circuits are crucial for performing accurate computational chemistry simulations on current noisy quantum hardware. Here, we explore the usefulness of non-iterative energy corrections, based on the method of…
Using a Fermi-Bose mixture of ultra-cold atoms in an optical lattice, we construct a quantum simulator for a U(1) gauge theory coupled to fermionic matter. The construction is based on quantum links which realize continuous gauge symmetry…
We describe a simple formalism for generating classes of quantum circuits that are classically efficiently simulatable and show that the efficient simulation of Clifford circuits (Gottesman-Knill theorem) and of matchgate circuits…
We use a random search technique to find quantum gate sequences that implement perfect quantum state preparation or unitary operator synthesis with arbitrary targets. This approach is based on the recent discovery that there is a large…
Introducing an active space approximation is inevitable for the quantum computations of chemical systems. However, this approximation ignores the electron correlations related to non-active orbitals. Here, we propose a computational method…
The Wigner function, which provides a phase-space description of quantum systems, has various applications in quantum mechanics, quantum kinetic theory, quantum optics, radiation transport and others. The concept of Wigner function has been…
Compiling quantum circuits to account for hardware restrictions is an essential part of the quantum computing stack. Circuit compilation allows us to adapt algorithm descriptions into a sequence of operations supported by real quantum…
Renormalization group ideas and effective operators are used to efficiently determine localized unitaries for preparing the ground states of non-interacting scalar field theories on digital quantum devices. With these methods, classically…
The unitary coupled cluster (UCC) approximation is one of the more promising wave-function ans\"atze for electronic structure calculations on quantum computers via the variational quantum eigensolver algorithm. However, for large systems…
Fermion-to-qubit mappings play a crucial role in representing fermionic interactions on a quantum computer. Efficient mappings translate fermionic modes of a system to qubit interactions with a high degree of locality while using few…
We present an equation generator algorithm that utilizes second-quantized operators in normal order with respect to a correlated or non-correlated reference and the corresponding Wick theorem. The algorithm proposed here, written with…
Random unitaries are an important resource for quantum information processing. While their universal properties have been thoroughly analyzed, it is not known what happens to these properties when the unitaries are sampled on the…
Entanglement between the constituents of a quantum system is an essential resource in the implementation of many quantum processes and algorithms. Indeed, universal quantum computation is possible by measuring individual qubits comprising…
Quantum computing offers a promising platform to address the computational challenges inherent in quantum chemistry, and particularly in valence bond (VB) methods, which are chemically appealing but suffer from high computational cost due…
We investigate quantum phase transitions and quantum coherence in a quantum compass chain under an alternating transverse magnetic field. The model can be analytically solved by the Jordan-Wigner transformation and this solution shows that…
In recent years, applications of quantum simulation have been developed to study properties of strongly interacting theories. This has been driven by two factors: on the one hand, needs from theorists to have access to physical observables…
Many quantum algorithms rely on a quality initial state for optimal performance. Preparing an initial state for specific applications can considerably reduce the cost of probabilistic algorithms such as the well studied quantum phase…
We show that quantum computation circuits with coherent states as the logical qubits can be constructed using very simple linear networks, conditional measurements and coherent superposition resource states.