Transformation of Quantum States in Quantum Computation

2011 ◽  
Vol 80-81 ◽  
pp. 276-278
Author(s):  
Jun Lu

Quantum computation is based on transformation of quantum states. Quantum bits are two-level quantum systems, and as the simplest elementary building blocks for a quantum computer, they provide a convenient labeling for pairs of states and their physical realizations. Closed quantum systems evolve unitarily as determined by their Hamiltonians, but to perform quantum computation one must be able to control the Hamiltonian to effect an arbitrary selection from a universal family of unitary transformations.

2009 ◽  
Vol 07 (06) ◽  
pp. 1053-1203 ◽  
Author(s):  
ROBERT RAUßENDORF

In this thesis, we describe the one-way quantum computer [Formula: see text], a scheme of universal quantum computation that consists entirely of one-qubit measurements on a highly entangled multiparticle state, i.e. the cluster state. We prove the universality of the [Formula: see text], describe the underlying computational model and demonstrate that the [Formula: see text] can be operated fault-tolerantly. In Sec. 2, we show that the [Formula: see text] can be regarded as a simulator of quantum logic networks. In this way, we prove the universality and establish the link to the network model — the common model of quantum computation. We also indicate that the description of the [Formula: see text] as a network simulator is not adequate in every respect. In Sec. 3, we derive the computational model underlying the [Formula: see text], which is very different from the quantum logic network model. The [Formula: see text] has no quantum input, no quantum output and no quantum register, and the unitary gates from some universal set are not the elementary building blocks of [Formula: see text] quantum algorithms. Further, all information that is processed with the [Formula: see text] is the outcomes of one-qubit measurements and thus processing of information exists only at the classical level. The [Formula: see text] is nevertheless quantum-mechanical, as it uses a highly entangled cluster state as the central physical resource. In Sec. 4, we show that there exist nonzero error thresholds for fault-tolerant quantum computation with the [Formula: see text]. Further, we outline the concept of checksums in the context of the [Formula: see text], which may become an element in future practical and adequate methods for fault-tolerant [Formula: see text] computation.


2005 ◽  
Vol 77 (2) ◽  
pp. 201-222 ◽  
Author(s):  
Belita Koiller ◽  
Xuedong Hu ◽  
Rodrigo B. Capaz ◽  
Adriano S. Martins ◽  
Sankar Das Sarma

Silicon-based quantum-computer architectures have attracted attention because of their promise for scalability and their potential for synergetically utilizing the available resources associated with the existing Si technology infrastructure. Electronic and nuclear spins of shallow donors (e.g. phosphorus) in Si are ideal candidates for qubits in such proposals due to the relatively long spin coherence times. For these spin qubits, donor electron charge manipulation by external gates is a key ingredient for control and read-out of single-qubit operations, while shallow donor exchange gates are frequently invoked to perform two-qubit operations. More recently, charge qubits based on tunnel coupling in P+2 substitutional molecular ions in Si have also been proposed. We discuss the feasibility of the building blocks involved in shallow donor quantum computation in silicon, taking into account the peculiarities of silicon electronic structure, in particular the six degenerate states at the conduction band edge. We show that quantum interference among these states does not significantly affect operations involving a single donor, but leads to fast oscillations in electron exchange coupling and on tunnel-coupling strength when the donor pair relative position is changed on a lattice-parameter scale. These studies illustrate the considerable potential as well as the tremendous challenges posed by donor spin and charge as candidates for qubits in silicon.


Author(s):  
Todd A. Brun

Quantum error correction is a set of methods to protect quantum information—that is, quantum states—from unwanted environmental interactions (decoherence) and other forms of noise. The information is stored in a quantum error-correcting code, which is a subspace in a larger Hilbert space. This code is designed so that the most common errors move the state into an error space orthogonal to the original code space while preserving the information in the state. It is possible to determine whether an error has occurred by a suitable measurement and to apply a unitary correction that returns the state to the code space without measuring (and hence disturbing) the protected state itself. In general, codewords of a quantum code are entangled states. No code that stores information can protect against all possible errors; instead, codes are designed to correct a specific error set, which should be chosen to match the most likely types of noise. An error set is represented by a set of operators that can multiply the codeword state. Most work on quantum error correction has focused on systems of quantum bits, or qubits, which are two-level quantum systems. These can be physically realized by the states of a spin-1/2 particle, the polarization of a single photon, two distinguished levels of a trapped atom or ion, the current states of a microscopic superconducting loop, or many other physical systems. The most widely used codes are the stabilizer codes, which are closely related to classical linear codes. The code space is the joint +1 eigenspace of a set of commuting Pauli operators on n qubits, called stabilizer generators; the error syndrome is determined by measuring these operators, which allows errors to be diagnosed and corrected. A stabilizer code is characterized by three parameters [[n,k,d]], where n is the number of physical qubits, k is the number of encoded logical qubits, and d is the minimum distance of the code (the smallest number of simultaneous qubit errors that can transform one valid codeword into another). Every useful code has n>k; this physical redundancy is necessary to detect and correct errors without disturbing the logical state. Quantum error correction is used to protect information in quantum communication (where quantum states pass through noisy channels) and quantum computation (where quantum states are transformed through a sequence of imperfect computational steps in the presence of environmental decoherence to solve a computational problem). In quantum computation, error correction is just one component of fault-tolerant design. Other approaches to error mitigation in quantum systems include decoherence-free subspaces, noiseless subsystems, and dynamical decoupling.


Quantum ◽  
2019 ◽  
Vol 3 ◽  
pp. 115 ◽  
Author(s):  
Jim Bryan ◽  
Samuel Leutheusser ◽  
Zinovy Reichstein ◽  
Mark Van Raamsdonk

For a multipart quantum system, a locally maximally entangled (LME) state is one where each elementary subsystem is maximally entangled with its complement. This paper is a sequel to~[J. Bryan, Z. Reichstein and M. Van Raamsdonk, Existence of Locally Maximally Entangled Quantum States via Geometric Invariant Theory, Ann. Henri Poincaré 19 (2018), no. 8, 2491-2511. MR3830220], which gives necessary and sufficient conditions for a system to admit LME states in terms of its subsystem dimensions(d1,d2,…,dn), and computes the dimension of the spaceSLME/Kof LME states up to local unitary transformations for all non-empty cases. Here we provide a pedagogical overview and physical interpretation of the underlying mathematics that leads to these results and give a large class of explicit constructions for LME states. In particular, we construct all LME states for tripartite systems with subsystem dimensions(2,A,B)and give a general representation-theoretic construction for a special class of stabilizer LME states. The latter construction provides a common framework for many known LME states. Our results have direct implications for the problem of characterizing SLOCC equivalence classes of quantum states, since points inSLME/Kcorrespond to natural families of SLOCC classes. Finally, we give the dimension of the stabilizer subgroupS⊂SL⁡(d1,C)×⋯×SL⁡(dn,C)for a generic state in an arbitrary multipart system and identify all cases where this stabilizer is trivial.


Technologies ◽  
2021 ◽  
Vol 10 (1) ◽  
pp. 1
Author(s):  
Dimitrios Ntalaperas ◽  
Nikos Konofaos

In this paper, we introduce a novel coding scheme, which allows single quantum systems to encode multi-qubit registers. This allows for more efficient use of resources and the economy in designing quantum systems. The scheme is based on the notion of encoding logical quantum states using the charge degree of freedom of the discrete energy spectrum that is formed by introducing impurities in a semiconductor material. We propose a mechanism of performing single qubit operations and controlled two-qubit operations, providing a mechanism for achieving these operations using appropriate pulses generated by Rabi oscillations. The above architecture is simulated using the Armonk single qubit quantum computer of IBM to encode two logical quantum states into the energy states of Armonk’s qubit and using custom pulses to perform one and two-qubit quantum operations.


2021 ◽  
Vol 20 (7) ◽  
Author(s):  
Ismail Ghodsollahee ◽  
Zohreh Davarzani ◽  
Mariam Zomorodi ◽  
Paweł Pławiak ◽  
Monireh Houshmand ◽  
...  

AbstractAs quantum computation grows, the number of qubits involved in a given quantum computer increases. But due to the physical limitations in the number of qubits of a single quantum device, the computation should be performed in a distributed system. In this paper, a new model of quantum computation based on the matrix representation of quantum circuits is proposed. Then, using this model, we propose a novel approach for reducing the number of teleportations in a distributed quantum circuit. The proposed method consists of two phases: the pre-processing phase and the optimization phase. In the pre-processing phase, it considers the bi-partitioning of quantum circuits by Non-Dominated Sorting Genetic Algorithm (NSGA-III) to minimize the number of global gates and to distribute the quantum circuit into two balanced parts with equal number of qubits and minimum number of global gates. In the optimization phase, two heuristics named Heuristic I and Heuristic II are proposed to optimize the number of teleportations according to the partitioning obtained from the pre-processing phase. Finally, the proposed approach is evaluated on many benchmark quantum circuits. The results of these evaluations show an average of 22.16% improvement in the teleportation cost of the proposed approach compared to the existing works in the literature.


2021 ◽  
Vol 4 (1) ◽  
Author(s):  
S. Leontica ◽  
F. Tennie ◽  
T. Farrow

AbstractSimulating the behaviour of complex quantum systems is impossible on classical supercomputers due to the exponential scaling of the number of quantum states with the number of particles in the simulated system. Quantum computers aim to break through this limit by using one quantum system to simulate another quantum system. Although in their infancy, they are a promising tool for applied fields seeking to simulate quantum interactions in complex atomic and molecular structures. Here, we show an efficient technique for transpiling the unitary evolution of quantum systems into the language of universal quantum computation using the IBM quantum computer and show that it is a viable tool for compiling near-term quantum simulation algorithms. We develop code that decomposes arbitrary 3-qubit gates and implement it in a quantum simulation first for a linear ordered chain to highlight the generality of the approach, and second, for a complex molecule. We choose the Fenna-Matthews-Olsen (FMO) photosynthetic protein because it has a well characterised Hamiltonian and presents a complex dissipative system coupled to a noisy environment that helps to improve the efficiency of energy transport. The method can be implemented in a broad range of molecular and other simulation settings.


2011 ◽  
Vol 18 (5) ◽  
pp. 563-572 ◽  
Author(s):  
G. Balasis ◽  
C. Papadimitriou ◽  
I. A. Daglis ◽  
A. Anastasiadis ◽  
I. Sandberg ◽  
...  

Abstract. The dynamics of complex systems are founded on universal principles that can be used to describe disparate problems ranging from particle physics to economies of societies. A corollary is that transferring ideas and results from investigators in hitherto disparate areas will cross-fertilize and lead to important new results. In this contribution, we investigate the existence of a universal behavior, if any, in solar flares, magnetic storms, earthquakes and pre-seismic electromagnetic (EM) emissions, extending the work recently published by Balasis et al. (2011a). A common characteristic in the dynamics of the above-mentioned phenomena is that their energy release is basically fragmentary, i.e. the associated events are being composed of elementary building blocks. By analogy with earthquakes, the magnitude of the magnetic storms, solar flares and pre-seismic EM emissions can be appropriately defined. Then the key question we can ask in the frame of complexity is whether the magnitude distribution of earthquakes, magnetic storms, solar flares and pre-fracture EM emissions obeys the same law. We show that these apparently different extreme events, which occur in the solar-terrestrial system, follow the same energy distribution function. The latter was originally derived for earthquake dynamics in the framework of nonextensive Tsallis statistics.


2016 ◽  
Vol 18 (22) ◽  
pp. 14795-14804 ◽  
Author(s):  
Chavdar Slavov ◽  
Chong Yang ◽  
Luca Schweighauser ◽  
Chokri Boumrifak ◽  
Andreas Dreuw ◽  
...  

We have investigated the ultrafast dynamics of o-, m- and p-bisazobenzenes, which represent elementary building blocks for photoswitchable multiazobenzene nanostructures.


2001 ◽  
pp. 451-490
Author(s):  
Yorick Hardy ◽  
Willi-Hans Steeb

Sign in / Sign up

Export Citation Format

Share Document