相关论文: Using a quantum computer to investigate quantum ch…
A conception of virtual quantum information bit - virtual qubit - is introduced. It is shown by means of virtual qubit representation that four states of a single quantum particle is enough for implementation of full set of the gates, which…
The one-way quantum computer (QCc) is a universal scheme of quantum computation consisting only of one-qubit measurements on a particular entangled multi-qubit state, the cluster state. The computational model underlying the QCc is…
Compiling a high-level quantum circuit down to a low-level description that can be executed on state-of-the-art quantum computers is a crucial part of the software stack for quantum computing. One step in compiling a quantum circuit to some…
We study an array of graphene nano sheets that form a two-dimensional S = 1/2 Kagome spin lattice used for quantum computation. The edge states of the graphene nano sheets are used to form quantum dots to confine electrons and perform the…
A Quantum Computer is a new type of computer which can solve problems such as factoring and database search very efficiently. The usefulness of a quantum computer is limited by the effect of two different types of errors, decoherence and…
We examine the conjecture that entropy production in subsystems of a given system can be used as a dynamical criterion for quantum chaos in the latter. Numerical results are presented for finite dimensional spin systems as also for the…
Semiconductors, a significant type of material in the information era, are becoming more and more powerful in the field of quantum information. In the last decades, semiconductor quantum computation was investigated thoroughly across the…
Quantum process tomography conventionally uses a multitude of initial quantum states and then performs state tomography on the process output. Here we propose and study an alternative approach which requires only a single (or few) known…
A proof of quantumness is a method for provably demonstrating (to a classical verifier) that a quantum device can perform computational tasks that a classical device with comparable resources cannot. Providing a proof of quantumness is the…
We study quantum maps displaying spectral statistics intermediate between Poisson and Wigner-Dyson. It is shown that they can be simulated on a quantum computer with a small number of gates, and efficiently yield information about fidelity…
Quantized integrable systems can be made to perform universal quantum computation by the application of a global time-varying control. The action-angle variables of the integrable system function as qubits or qudits, which can be coupled…
The development of quantum computing systems has been a staple of academic research since the mid-1990s when the first proposal for physical platforms were proposed using Nuclear Magnetic Resonance and Ion-Trap hardware. These first…
This article is a short introduction to and review of the cluster-state model of quantum computation, in which coherent quantum information processing is accomplished via a sequence of single-qubit measurements applied to a fixed quantum…
We propose a formalism which makes the chaos to be quantized. Quantum mechanical equation is derived for describing the chaos for a particle moving in an electromagnetic field.
Approximate controllability for a quantum system on a graph using as control parameters boundary conditions will be proven. This establishes a first theoretical proof of the feasibility of the quantum control at the boundary paradigm. A…
While quantum computers promise significant advantages, the complexity of quantum algorithms remains a major technological obstacle. We have developed and demonstrated an architecture-independent technique that simplifies adding control…
Quantum walk has been regarded as a primitive to universal quantum computation. By using the operations required to describe the single particle discrete-time quantum walk on a position space we demonstrate the realization of the universal…
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.
We show that the Quantum State Distinguishability (QSD), which is a QSZK-complete problem, and the Quantum Circuit Distinguishability (QCD), which is a QIP-complete problem, can be solved by the verifier who can perform only single-qubit…
Recently it was found that the dynamics in a Heisenberg spin-chain subjected to a sequence of periodic pulses from an external, parabolic, magnetic field can have a close correspondence with the quantum kicked rotor (QKR). The QKR is a key…