Related papers: Exterior calculus and fermionic quantum computatio…
Two cluster algorithms, based on constructing and flipping loops, are presented for worldline quantum Monte Carlo simulations of fermions and are tested on the one-dimensional repulsive Hubbard model. We call these algorithms the loop-flip…
Computations with a future quantum computer will be implemented through the operations by elementary quantum gates. It is now well known that the collection of 1-bit and 2-bit quantum gates are universal for quantum computation, i.e., any…
We reformulate quantum computation in terms of Lagrangian (sum-over-path) formalism, in contrast to the widely used Hamiltonian (unitary gate) formulation. We exemplify this formalism with some widely-studied models, including the standard…
Based on an idea that spatial separation of charge states can enhance quantum coherence, we propose a scheme for quantum computation with quantum bit (qubit) constructed from two coupled quantum dots. Quantum information is stored in…
Ordinary differential equations have an arithmetic analogue in which functions are replaced by numbers and the derivation operator is replaced by a Fermat quotient operator. In this survey we explain the main motivations, constructions,…
We introduce a trichromatic graphical calculus for quantum computing. The generators represent three complementary observables that are treated on equal footing, hence reflecting the symmetries of the Bloch sphere. We derive the Euler angle…
An adiabatic cyclic evolution of control parameters of a quantum system ends up with a holonomic operation on the system, determined entirely by the geometry in the parameter space. The operation is given either by a simple phase factor (a…
Quantum computing using two-dimensional NMR has recently been described using scalar coupling evolution technique [J. Chem. Phys.,109,10603 (1998)]. In the present paper, we describe two-dimensional NMR quantum computing with the help of…
The operator algebra of fermionic modes is isomorphic to that of qubits, the difference between them is twofold: the embedding of subalgebras corresponding to mode subsets and multiqubit subsystems on the one hand, and the parity…
A functional partial differential equation is set for the proper graphs generating functional of QED in external electromagnetic fields. This equation leads to the evolution of the proper graphs with the external field amplitude and the…
As quantum computing technology improves and quantum computers with a small but non-trivial number of N > 100 qubits appear feasible in the near future the question of possible applications of small quantum computers gains importance. One…
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…
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.…
Construction of explicit quantum circuits follows the notion of the "standard circuit model" introduced in the solid and profound analysis of elementary gates providing quantum computation. Nevertheless the model is not always optimal (e.g.…
Mapping fermionic operators to qubit operators is an essential step for simulating fermionic systems on a quantum computer. We investigate how the choice of such a mapping interacts with the underlying qubit connectivity of the quantum…
Numerical simulations of numerous quantum systems suffer from the notorious sign problem. Meron-cluster algorithms lead to an efficient solution of sign problems for both fermionic and bosonic models. Here we apply the meron concept to…
An explicit algorithm for calculating the optimized Euler angles for both qubit state transfer and gate engineering given two arbitary fixed Hamiltonians is presented. It is shown how the algorithm enables us to efficiently implement single…
In this paper, we develop a new classical simulation of quantum bit (qubit) by use of analog components in order to be able to simulate the quantum properties such as the superposition of states. As part of this new approach, we have also…
Quantum devices may overcome limitations of classical computers in studies of nuclear structure functions and parton Wigner distributions of protons and nuclei. In this talk, we discuss a worldline approach to compute nuclear structure…
This paper introduces a symbolic calculus to evaluate the output signals at the target line(s) of quantum computing subcircuits using controlled negations and controlled-Q gates, where Q represents the k-th root of [0 1; 1 0], the unitary…