Related papers: Filtering states with total spin on a quantum comp…
Spin qubits in semiconductor quantum dots represent a prominent family of solid-state qubits in the effort to build a quantum computer. They are formed when electrons or holes are confined in a static potential well in a semiconductor,…
We propose an approach to reconstruct two-electron spin qubit states in semiconductor quantum dots by employing tomographic techniques. This procedure exploits the combination of fast gate operations on electron spins trapped in dots and…
To gain deeper insight into the dynamics of complex quantum systems we need a quantum leap in computer simulations. We can not translate quantum behaviour arising with superposition states or entanglement efficiently into the classical…
The phase-space quasi-probability distribution formalism for representing quantum states provides practical tools for various applications in quantum optics such as identifying the nonclassicality of quantum states. We study filter…
In this paper, we consider the generalized measurement where one particular quantum signal is unambiguously extracted from a set of non-commutative quantum signals and the other signals are filtered out. Simple expressions for the maximum…
Fermions are fundamental particles which obey seemingly bizarre quantum-mechanical principles, yet constitute all the ordinary matter that we inhabit. As such, their study is heavily motivated from both fundamental and practical incentives.…
A general scheme to perform universal quantum computation within decoherence-free subspaces (DFSs) of a system's Hilbert space is presented. This scheme leads to the first fault-tolerant realization of universal quantum computation on DFSs…
We describe a simulation method for a quantum spin model of a generic, general purpose quantum computer. The use of this quantum computer simulator is illustrated through several implementations of Grover's database search algorithm. Some…
Algorithmic cooling can be used to find correlated states of many-body quantum systems. It is based on quantum circuits that perform nonunitary operations, whose implementation can be challenging on near-term quantum computers. In this work…
We study the motion of a charged quantum particle, constrained on the surface of a cylinder, in the presence of a radial magnetic field. When the spin of the particle is neglected, the system essentially reduces to an infinite family of…
Gibbs states (i.e., thermal states) can be used for several applications such as quantum simulation, quantum machine learning, quantum optimization, and the study of open quantum systems. Moreover, semi-definite programming, combinatorial…
We discuss the state tomography of a fixed qubit (a spin-1/2 target particle), which is in general in a mixed state, through 1D scattering of a probe qubit off the target. Two strategies are presented, by making use of different degrees of…
The quantum Fourier transform (QFT) plays an important role in many known quantum algorithms such as Shor's algorithm for prime factorisation. In this paper we show that the QFT algorithm can, on a restricted set of input states, be…
Tensor network theory and quantum simulation are respectively the key classical and quantum computing methods in understanding quantum many-body physics. Here, we introduce the framework of hybrid tensor networks with building blocks…
A new method of preparing the pseudo-pure state of a spin system for quantum computation in liquid nuclear magnetic resonance (NMR) was put forward and demonstrated experimentally. Applying appropriately connected line-selective pulses…
In quantum computing, knowing the symmetries a given system or state obeys or disobeys is often useful. For example, Hamiltonian symmetries may limit allowed state transitions or simplify learning parameters in machine learning…
Quantum computers have the potential to solve certain interesting problems significantly faster than classical computers. To exploit the power of a quantum computation it is necessary to perform inter-qubit operations and generate entangled…
This paper describes an algorithmic system called SQT for the computer simulation of a wide class of quantum experiments on entangled particles. SQT maintains a hidden internal state for each particle and it provides an initialization…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…
States in quantum field theory (QFT) are represented by many-particle wave functions, such that a state describing n particles depends on n spacetime positions. Since a general state is a superposition of states with different numbers of…