Cluster State Quantum Computation

DTIC Science & Technology

2014-02-01

information of relevance to the transformation. We define the fidelity as the probability that the desired target gate ATar has been faithfully...implemented on the computational modes given a successful measurement of the ancilla modes: 2 , (3) since Tr ( ATar † ATar )=2Mc for a properly normalized...photonic gates The optimization method we have developed maximizes the success probability S for a given target transformation ATar , for given

Acausal measurement-based quantum computing

NASA Astrophysics Data System (ADS)

Morimae, Tomoyuki

2014-07-01

In measurement-based quantum computing, there is a natural "causal cone" among qubits of the resource state, since the measurement angle on a qubit has to depend on previous measurement results in order to correct the effect of by-product operators. If we respect the no-signaling principle, by-product operators cannot be avoided. Here we study the possibility of acausal measurement-based quantum computing by using the process matrix framework [Oreshkov, Costa, and Brukner, Nat. Commun. 3, 1092 (2012), 10.1038/ncomms2076]. We construct a resource process matrix for acausal measurement-based quantum computing restricting local operations to projective measurements. The resource process matrix is an analog of the resource state of the standard causal measurement-based quantum computing. We find that if we restrict local operations to projective measurements the resource process matrix is (up to a normalization factor and trivial ancilla qubits) equivalent to the decorated graph state created from the graph state of the corresponding causal measurement-based quantum computing. We also show that it is possible to consider a causal game whose causal inequality is violated by acausal measurement-based quantum computing.

The small stellated dodecahedron code and friends.

PubMed

Conrad, J; Chamberland, C; Breuckmann, N P; Terhal, B M

2018-07-13

We explore a distance-3 homological CSS quantum code, namely the small stellated dodecahedron code, for dense storage of quantum information and we compare its performance with the distance-3 surface code. The data and ancilla qubits of the small stellated dodecahedron code can be located on the edges respectively vertices of a small stellated dodecahedron, making this code suitable for three-dimensional connectivity. This code encodes eight logical qubits into 30 physical qubits (plus 22 ancilla qubits for parity check measurements) in contrast with one logical qubit into nine physical qubits (plus eight ancilla qubits) for the surface code. We develop fault-tolerant parity check circuits and a decoder for this code, allowing us to numerically assess the circuit-based pseudo-threshold.This article is part of a discussion meeting issue 'Foundations of quantum mechanics and their impact on contemporary society'. © 2018 The Authors.

Additive Classical Capacity of Quantum Channels Assisted by Noisy Entanglement.

PubMed

Zhuang, Quntao; Zhu, Elton Yechao; Shor, Peter W

2017-05-19

We give a capacity formula for the classical information transmission over a noisy quantum channel, with separable encoding by the sender and limited resources provided by the receiver's preshared ancilla. Instead of a pure state, we consider the signal-ancilla pair in a mixed state, purified by a "witness." Thus, the signal-witness correlation limits the resource available from the signal-ancilla correlation. Our formula characterizes the utility of different forms of resources, including noisy or limited entanglement assistance, for classical communication. With separable encoding, the sender's signals across multiple channel uses are still allowed to be entangled, yet our capacity formula is additive. In particular, for generalized covariant channels, our capacity formula has a simple closed form. Moreover, our additive capacity formula upper bounds the general coherent attack's information gain in various two-way quantum key distribution protocols. For Gaussian protocols, the additivity of the formula indicates that the collective Gaussian attack is the most powerful.

Heat-bath algorithmic cooling with correlated qubit-environment interactions

NASA Astrophysics Data System (ADS)

Rodríguez-Briones, Nayeli A.; Li, Jun; Peng, Xinhua; Mor, Tal; Weinstein, Yossi; Laflamme, Raymond

2017-11-01

Cooling techniques are essential to understand fundamental thermodynamic questions of the low-energy states of physical systems, furthermore they are at the core of practical applications of quantum information science. In quantum computing, this controlled preparation of highly pure quantum states is required from the state initialization of most quantum algorithms to a reliable supply of ancilla qubits that satisfy the fault-tolerance threshold for quantum error correction. Heat-bath algorithmic cooling has been shown to purify qubits by controlled redistribution of entropy and multiple contact with a bath, not only for ensemble implementations but also for technologies with strong but imperfect measurements. In this paper, we show that correlated relaxation processes between the system and environment during rethermalization when we reset hot ancilla qubits, can be exploited to enhance purification. We show that a long standing upper bound on the limits of algorithmic cooling Schulman et al (2005 Phys. Rev. Lett. 94, 120501) can be broken by exploiting these correlations. We introduce a new tool for cooling algorithms, which we call ‘state-reset’, obtained when the coupling to the environment is generalized from individual-qubits relaxation to correlated-qubit relaxation. Furthermore, we present explicit improved cooling algorithms which lead to an increase of purity beyond all the previous work, and relate our results to the Nuclear Overhauser Effect.

Quantum Information Theory of Measurement

NASA Astrophysics Data System (ADS)

Glick, Jennifer Ranae

Quantum measurement lies at the heart of quantum information processing and is one of the criteria for quantum computation. Despite its central role, there remains a need for a robust quantum information-theoretical description of measurement. In this work, I will quantify how information is processed in a quantum measurement by framing it in quantum information-theoretic terms. I will consider a diverse set of measurement scenarios, including weak and strong measurements, and parallel and consecutive measurements. In each case, I will perform a comprehensive analysis of the role of entanglement and entropy in the measurement process and track the flow of information through all subsystems. In particular, I will discuss how weak and strong measurements are fundamentally of the same nature and show that weak values can be computed exactly for certain measurements with an arbitrary interaction strength. In the context of the Bell-state quantum eraser, I will derive a trade-off between the coherence and "which-path" information of an entangled pair of photons and show that a quantum information-theoretic approach yields additional insights into the origins of complementarity. I will consider two types of quantum measurements: those that are made within a closed system where every part of the measurement device, the ancilla, remains under control (what I will call unamplified measurements), and those performed within an open system where some degrees of freedom are traced over (amplified measurements). For sequences of measurements of the same quantum system, I will show that information about the quantum state is encoded in the measurement chain and that some of this information is "lost" when the measurements are amplified-the ancillae become equivalent to a quantum Markov chain. Finally, using the coherent structure of unamplified measurements, I will outline a protocol for generating remote entanglement, an essential resource for quantum teleportation and quantum cryptographic tasks.

Economical quantum cloning in any dimension

NASA Astrophysics Data System (ADS)

Durt, Thomas; Fiurášek, Jaromír; Cerf, Nicolas J.

2005-11-01

The possibility of cloning a d -dimensional quantum system without an ancilla is explored, extending on the economical phase-covariant cloning machine for qubits found in Phys. Rev. A 60, 2764 (1999). We prove the impossibility of constructing an economical version of the optimal universal 1→2 cloning machine in any dimension. We also show, using an ansatz on the generic form of cloning machines, that the d -dimensional 1→2 phase-covariant cloner, which optimally clones all balanced superpositions with arbitrary phases, can be realized economically only in dimension d=2 . The used ansatz is supported by numerical evidence up to d=7 . An economical phase-covariant cloner can nevertheless be constructed for d>2 , albeit with a slightly lower fidelity than that of the optimal cloner requiring an ancilla. Finally, using again an ansatz on cloning machines, we show that an economical version of the 1→2 Fourier-covariant cloner, which optimally clones the computational basis and its Fourier transform, is also possible only in dimension d=2 .

Effect of ancilla's structure on quantum error correction using the seven-qubit Calderbank-Shor-Steane code

NASA Astrophysics Data System (ADS)

Salas, P. J.; Sanz, A. L.

2004-05-01

In this work we discuss the ability of different types of ancillas to control the decoherence of a qubit interacting with an environment. The error is introduced into the numerical simulation via a depolarizing isotropic channel. The ranges of values considered are 10-4 ⩽ɛ⩽ 10-2 for memory errors and 3× 10-5 ⩽γ/7⩽ 10-2 for gate errors. After the correction we calculate the fidelity as a quality criterion for the qubit recovered. We observe that a recovery method with a three-qubit ancilla provides reasonably good results bearing in mind its economy. If we want to go further, we have to use fault tolerant ancillas with a high degree of parallelism, even if this condition implies introducing additional ancilla verification qubits.

Entanglement-Assisted Weak Value Amplification

NASA Astrophysics Data System (ADS)

Pang, Shengshi; Dressel, Justin; Brun, Todd A.

2014-07-01

Large weak values have been used to amplify the sensitivity of a linear response signal for detecting changes in a small parameter, which has also enabled a simple method for precise parameter estimation. However, producing a large weak value requires a low postselection probability for an ancilla degree of freedom, which limits the utility of the technique. We propose an improvement to this method that uses entanglement to increase the efficiency. We show that by entangling and postselecting n ancillas, the postselection probability can be increased by a factor of n while keeping the weak value fixed (compared to n uncorrelated attempts with one ancilla), which is the optimal scaling with n that is expected from quantum metrology. Furthermore, we show the surprising result that the quantum Fisher information about the detected parameter can be almost entirely preserved in the postselected state, which allows the sensitive estimation to approximately saturate the relevant quantum Cramér-Rao bound. To illustrate this protocol we provide simple quantum circuits that can be implemented using current experimental realizations of three entangled qubits.

Realization of Quantum Maxwell’s Demon with Solid-State Spins*

NASA Astrophysics Data System (ADS)

Wang, W.-B.; Chang, X.-Y.; Wang, F.; Hou, P.-Y.; Huang, Y.-Y.; Zhang, W.-G.; Ouyang, X.-L.; Huang, X.-Z.; Zhang, Z.-Y.; Wang, H.-Y.; He, L.; Duan, L.-M.

2018-04-01

Resolution of the century-long paradox on Maxwell's demon reveals a deep connection between information theory and thermodynamics. Although initially introduced as a thought experiment, Maxwell's demon can now be implemented in several physical systems, leading to intriguing test of information-thermodynamic relations. Here, we report experimental realization of a quantum version of Maxwell's demon using solid state spins where the information acquiring and feedback operations by the demon are achieved through conditional quantum gates. A unique feature of this implementation is that the demon can start in a quantum superposition state or in an entangled state with an ancilla observer. Through quantum state tomography, we measure the entropy in the system, demon, and the ancilla, showing the influence of coherence and entanglement on the result. A quantum implementation of Maxwell's demon adds more controllability to this paradoxical thermal machine and may find applications in quantum thermodynamics involving microscopic systems.

FAST TRACK COMMUNICATION: Reversible arithmetic logic unit for quantum arithmetic

NASA Astrophysics Data System (ADS)

Kirkedal Thomsen, Michael; Glück, Robert; Axelsen, Holger Bock

2010-09-01

This communication presents the complete design of a reversible arithmetic logic unit (ALU) that can be part of a programmable reversible computing device such as a quantum computer. The presented ALU is garbage free and uses reversible updates to combine the standard reversible arithmetic and logical operations in one unit. Combined with a suitable control unit, the ALU permits the construction of an r-Turing complete computing device. The garbage-free ALU developed in this communication requires only 6n elementary reversible gates for five basic arithmetic-logical operations on two n-bit operands and does not use ancillae. This remarkable low resource consumption was achieved by generalizing the V-shape design first introduced for quantum ripple-carry adders and nesting multiple V-shapes in a novel integrated design. This communication shows that the realization of an efficient reversible ALU for a programmable computing device is possible and that the V-shape design is a very versatile approach to the design of quantum networks.

Data Assimilation on a Quantum Annealing Computer: Feasibility and Scalability

NASA Astrophysics Data System (ADS)

Nearing, G. S.; Halem, M.; Chapman, D. R.; Pelissier, C. S.

2014-12-01

Data assimilation is one of the ubiquitous and computationally hard problems in the Earth Sciences. In particular, ensemble-based methods require a large number of model evaluations to estimate the prior probability density over system states, and variational methods require adjoint calculations and iteration to locate the maximum a posteriori solution in the presence of nonlinear models and observation operators. Quantum annealing computers (QAC) like the new D-Wave housed at the NASA Ames Research Center can be used for optimization and sampling, and therefore offers a new possibility for efficiently solving hard data assimilation problems. Coding on the QAC is not straightforward: a problem must be posed as a Quadratic Unconstrained Binary Optimization (QUBO) and mapped to a spherical Chimera graph. We have developed a method for compiling nonlinear 4D-Var problems on the D-Wave that consists of five steps: Emulating the nonlinear model and/or observation function using radial basis functions (RBF) or Chebyshev polynomials. Truncating a Taylor series around each RBF kernel. Reducing the Taylor polynomial to a quadratic using ancilla gadgets. Mapping the real-valued quadratic to a fixed-precision binary quadratic. Mapping the fully coupled binary quadratic to a partially coupled spherical Chimera graph using ancilla gadgets. At present the D-Wave contains 512 qbits (with 1024 and 2048 qbit machines due in the next two years); this machine size allows us to estimate only 3 state variables at each satellite overpass. However, QAC's solve optimization problems using a physical (quantum) system, and therefore do not require iterations or calculation of model adjoints. This has the potential to revolutionize our ability to efficiently perform variational data assimilation, as the size of these computers grows in the coming years.

Adiabatic quantum simulation of quantum chemistry.

PubMed

Babbush, Ryan; Love, Peter J; Aspuru-Guzik, Alán

2014-10-13

We show how to apply the quantum adiabatic algorithm directly to the quantum computation of molecular properties. We describe a procedure to map electronic structure Hamiltonians to 2-body qubit Hamiltonians with a small set of physically realizable couplings. By combining the Bravyi-Kitaev construction to map fermions to qubits with perturbative gadgets to reduce the Hamiltonian to 2-body, we obtain precision requirements on the coupling strengths and a number of ancilla qubits that scale polynomially in the problem size. Hence our mapping is efficient. The required set of controllable interactions includes only two types of interaction beyond the Ising interactions required to apply the quantum adiabatic algorithm to combinatorial optimization problems. Our mapping may also be of interest to chemists directly as it defines a dictionary from electronic structure to spin Hamiltonians with physical interactions.

Repetition code of 15 qubits

NASA Astrophysics Data System (ADS)

Wootton, James R.; Loss, Daniel

2018-05-01

The repetition code is an important primitive for the techniques of quantum error correction. Here we implement repetition codes of at most 15 qubits on the 16 qubit ibmqx3 device. Each experiment is run for a single round of syndrome measurements, achieved using the standard quantum technique of using ancilla qubits and controlled operations. The size of the final syndrome is small enough to allow for lookup table decoding using experimentally obtained data. The results show strong evidence that the logical error rate decays exponentially with code distance, as is expected and required for the development of fault-tolerant quantum computers. The results also give insight into the nature of noise in the device.

Sequential quantum cloning under real-life conditions

NASA Astrophysics Data System (ADS)

Saberi, Hamed; Mardoukhi, Yousof

2012-05-01

We consider a sequential implementation of the optimal quantum cloning machine of Gisin and Massar and propose optimization protocols for experimental realization of such a quantum cloner subject to the real-life restrictions. We demonstrate how exploiting the matrix-product state (MPS) formalism and the ensuing variational optimization techniques reveals the intriguing algebraic structure of the Gisin-Massar output of the cloning procedure and brings about significant improvements to the optimality of the sequential cloning prescription of Delgado [Phys. Rev. Lett.PRLTAO0031-900710.1103/PhysRevLett.98.150502 98, 150502 (2007)]. Our numerical results show that the orthodox paradigm of optimal quantum cloning can in practice be realized in a much more economical manner by utilizing a considerably lesser amount of informational and numerical resources than hitherto estimated. Instead of the previously predicted linear scaling of the required ancilla dimension D with the number of qubits n, our recipe allows a realization of such a sequential cloning setup with an experimentally manageable ancilla of dimension at most D=3 up to n=15 qubits. We also address satisfactorily the possibility of providing an optimal range of sequential ancilla-qubit interactions for optimal cloning of arbitrary states under realistic experimental circumstances when only a restricted class of such bipartite interactions can be engineered in practice.

Majorana fermion surface code for universal quantum computation

DOE PAGES

Vijay, Sagar; Hsieh, Timothy H.; Fu, Liang

2015-12-10

In this study, we introduce an exactly solvable model of interacting Majorana fermions realizing Z 2 topological order with a Z 2 fermion parity grading and lattice symmetries permuting the three fundamental anyon types. We propose a concrete physical realization by utilizing quantum phase slips in an array of Josephson-coupled mesoscopic topological superconductors, which can be implemented in a wide range of solid-state systems, including topological insulators, nanowires, or two-dimensional electron gases, proximitized by s-wave superconductors. Our model finds a natural application as a Majorana fermion surface code for universal quantum computation, with a single-step stabilizer measurement requiring no physicalmore » ancilla qubits, increased error tolerance, and simpler logical gates than a surface code with bosonic physical qubits. We thoroughly discuss protocols for stabilizer measurements, encoding and manipulating logical qubits, and gate implementations.« less

Experimental demonstration of selective quantum process tomography on an NMR quantum information processor

NASA Astrophysics Data System (ADS)

Gaikwad, Akshay; Rehal, Diksha; Singh, Amandeep; Arvind, Dorai, Kavita

2018-02-01

We present the NMR implementation of a scheme for selective and efficient quantum process tomography without ancilla. We generalize this scheme such that it can be implemented efficiently using only a set of measurements involving product operators. The method allows us to estimate any element of the quantum process matrix to a desired precision, provided a set of quantum states can be prepared efficiently. Our modified technique requires fewer experimental resources as compared to the standard implementation of selective and efficient quantum process tomography, as it exploits the special nature of NMR measurements to allow us to compute specific elements of the process matrix by a restrictive set of subsystem measurements. To demonstrate the efficacy of our scheme, we experimentally tomograph the processes corresponding to "no operation," a controlled-NOT (CNOT), and a controlled-Hadamard gate on a two-qubit NMR quantum information processor, with high fidelities.

Adiabatic Quantum Simulation of Quantum Chemistry

PubMed Central

Babbush, Ryan; Love, Peter J.; Aspuru-Guzik, Alán

2014-01-01

We show how to apply the quantum adiabatic algorithm directly to the quantum computation of molecular properties. We describe a procedure to map electronic structure Hamiltonians to 2-body qubit Hamiltonians with a small set of physically realizable couplings. By combining the Bravyi-Kitaev construction to map fermions to qubits with perturbative gadgets to reduce the Hamiltonian to 2-body, we obtain precision requirements on the coupling strengths and a number of ancilla qubits that scale polynomially in the problem size. Hence our mapping is efficient. The required set of controllable interactions includes only two types of interaction beyond the Ising interactions required to apply the quantum adiabatic algorithm to combinatorial optimization problems. Our mapping may also be of interest to chemists directly as it defines a dictionary from electronic structure to spin Hamiltonians with physical interactions. PMID:25308187

Application of a Resource Theory for Magic States to Fault-Tolerant Quantum Computing.

PubMed

Howard, Mark; Campbell, Earl

2017-03-03

Motivated by their necessity for most fault-tolerant quantum computation schemes, we formulate a resource theory for magic states. First, we show that robustness of magic is a well-behaved magic monotone that operationally quantifies the classical simulation overhead for a Gottesman-Knill-type scheme using ancillary magic states. Our framework subsequently finds immediate application in the task of synthesizing non-Clifford gates using magic states. When magic states are interspersed with Clifford gates, Pauli measurements, and stabilizer ancillas-the most general synthesis scenario-then the class of synthesizable unitaries is hard to characterize. Our techniques can place nontrivial lower bounds on the number of magic states required for implementing a given target unitary. Guided by these results, we have found new and optimal examples of such synthesis.

Quantum information processing by weaving quantum Talbot carpets

NASA Astrophysics Data System (ADS)

Farías, Osvaldo Jiménez; de Melo, Fernando; Milman, Pérola; Walborn, Stephen P.

2015-06-01

Single-photon interference due to passage through a periodic grating is considered in a novel proposal for processing D -dimensional quantum systems (quDits) encoded in the spatial degrees of freedom of light. We show that free-space propagation naturally implements basic single-quDit gates by means of the Talbot effect: an intricate time-space carpet of light in the near-field diffraction regime. By adding a diagonal phase gate, we show that a complete set of single-quDit gates can be implemented. We then introduce a spatially dependent beam splitter that allows for projective measurements in the computational basis and can be used for the implementation of controlled operations between two quDits. Universal quantum information processing can then be implemented with linear optics and ancilla photons via postselection and feed-forward following the original proposal of Knill-Laflamme and Milburn. Although we consider photons, our scheme should be directly applicable to a number of other physical systems. Interpretation of the Talbot effect as a quantum logic operation provides a beautiful and interesting way to visualize quantum computation through wave propagation and interference.

Composite quantum collision models

NASA Astrophysics Data System (ADS)

Lorenzo, Salvatore; Ciccarello, Francesco; Palma, G. Massimo

2017-09-01

A collision model (CM) is a framework to describe open quantum dynamics. In its memoryless version, it models the reservoir R as consisting of a large collection of elementary ancillas: the dynamics of the open system S results from successive collisions of S with the ancillas of R . Here, we present a general formulation of memoryless composite CMs, where S is partitioned into the very open system under study S coupled to one or more auxiliary systems {Si} . Their composite dynamics occurs through internal S -{Si} collisions interspersed with external ones involving {Si} and the reservoir R . We show that important known instances of quantum non-Markovian dynamics of S —such as the emission of an atom into a reservoir featuring a Lorentzian, or multi-Lorentzian, spectral density or a qubit subject to random telegraph noise—can be mapped on to such memoryless composite CMs.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Durt, Thomas; Fiurasek, Jaromir; Department of Optics, Palacky University, 17. listopadu 50, 77200 Olomouc

The possibility of cloning a d-dimensional quantum system without an ancilla is explored, extending on the economical phase-covariant cloning machine for qubits found in Phys. Rev. A 60, 2764 (1999). We prove the impossibility of constructing an economical version of the optimal universal 1{yields}2 cloning machine in any dimension. We also show, using an ansatz on the generic form of cloning machines, that the d-dimensional 1{yields}2 phase-covariant cloner, which optimally clones all balanced superpositions with arbitrary phases, can be realized economically only in dimension d=2. The used ansatz is supported by numerical evidence up to d=7. An economical phase-covariant clonermore » can nevertheless be constructed for d>2, albeit with a slightly lower fidelity than that of the optimal cloner requiring an ancilla. Finally, using again an ansatz on cloning machines, we show that an economical version of the 1{yields}2 Fourier-covariant cloner, which optimally clones the computational basis and its Fourier transform, is also possible only in dimension d=2.« less

Optimal ancilla-free Pauli+V circuits for axial rotations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Blass, Andreas; Bocharov, Alex; Gurevich, Yuri

We address the problem of optimal representation of single-qubit rotations in a certain unitary basis consisting of the so-called V gates and Pauli matrices. The V matrices were proposed by Lubotsky, Philips, and Sarnak [Commun. Pure Appl. Math. 40, 401–420 (1987)] as a purely geometric construct in 1987 and recently found applications in quantum computation. They allow for exceptionally simple quantum circuit synthesis algorithms based on quaternionic factorization. We adapt the deterministic-search technique initially proposed by Ross and Selinger to synthesize approximating Pauli+V circuits of optimal depth for single-qubit axial rotations. Our synthesis procedure based on simple SL{sub 2}(ℤ) geometrymore » is almost elementary.« less

Optimal single-shot strategies for discrimination of quantum measurements

NASA Astrophysics Data System (ADS)

Sedlák, Michal; Ziman, Mário

2014-11-01

We study discrimination of m quantum measurements in the scenario when the unknown measurement with n outcomes can be used only once. We show that ancilla-assisted discrimination procedures provide a nontrivial advantage over simple (ancilla-free) schemes for perfect distinguishability and we prove that inevitably m ≤n . We derive necessary and sufficient conditions of perfect distinguishability of general binary measurements. We show that the optimization of the discrimination of projective qubit measurements and their mixtures with white noise is equivalent to the discrimination of specific quantum states. In particular, the optimal protocol for discrimination of projective qubit measurements with fixed failure rate (exploiting maximally entangled test state) is described. While minimum-error discrimination of two projective qubit measurements can be realized without any need of entanglement, we show that discrimination of three projective qubit measurements requires a bipartite probe state. Moreover, when the measurements are not projective, the non-maximally entangled test states can outperform the maximally entangled ones. Finally, we rephrase the unambiguous discrimination of measurements as quantum key distribution protocol.

Constructive Method for Detecting the Information Backflow of Non-Markovian Dynamics.

PubMed

Bylicka, Bogna; Johansson, Markus; Acín, Antonio

2017-03-24

We investigate the relation between two approaches to the characterization of quantum Markovianity, divisibility and lack of information backflow. We show that a bijective dynamical map is completely positive divisible if and only if a monotonic nonincrease of distinguishability is observed for two equiprobable states of the evolving system and an ancilla. Moreover, our proof is constructive: given any such map that is not completely positive divisible, we give an explicit construction of two states that, when taken with the same a priori probability, exhibit information backflow. Finally, while an ancilla is necessary for the equivalence to hold in general, we show that it is always possible to witness the non-Markovianity of bijective maps without using any entanglement between the system and ancilla.

Efficient state initialization by a quantum spectral filtering algorithm

NASA Astrophysics Data System (ADS)

Fillion-Gourdeau, François; MacLean, Steve; Laflamme, Raymond

2017-04-01

An algorithm that initializes a quantum register to a state with a specified energy range is given, corresponding to a quantum implementation of the celebrated Feit-Fleck method. This is performed by introducing a nondeterministic quantum implementation of a standard spectral filtering procedure combined with an apodization technique, allowing for accurate state initialization. It is shown that the implementation requires only two ancilla qubits. A lower bound for the total probability of success of this algorithm is derived, showing that this scheme can be realized using a finite, relatively low number of trials. Assuming the time evolution can be performed efficiently and using a trial state polynomially close to the desired states, it is demonstrated that the number of operations required scales polynomially with the number of qubits. Tradeoffs between accuracy and performance are demonstrated in a simple example: the harmonic oscillator. This algorithm would be useful for the initialization phase of the simulation of quantum systems on digital quantum computers.

Collision models in quantum optics

NASA Astrophysics Data System (ADS)

Ciccarello, Francesco

2017-12-01

Quantum collision models (CMs) provide advantageous case studies for investigating major issues in open quantum systems theory, and especially quantum non-Markovianity. After reviewing their general definition and distinctive features, we illustrate the emergence of a CM in a familiar quantum optics scenario. This task is carried out by highlighting the close connection between the well-known input-output formalism and CMs. Within this quantum optics framework, usual assumptions in the CMs' literature - such as considering a bath of noninteracting yet initially correlated ancillas - have a clear physical origin.

Combining Topological Hardware and Topological Software: Color-Code Quantum Computing with Topological Superconductor Networks

NASA Astrophysics Data System (ADS)

Litinski, Daniel; Kesselring, Markus S.; Eisert, Jens; von Oppen, Felix

2017-07-01

We present a scalable architecture for fault-tolerant topological quantum computation using networks of voltage-controlled Majorana Cooper pair boxes and topological color codes for error correction. Color codes have a set of transversal gates which coincides with the set of topologically protected gates in Majorana-based systems, namely, the Clifford gates. In this way, we establish color codes as providing a natural setting in which advantages offered by topological hardware can be combined with those arising from topological error-correcting software for full-fledged fault-tolerant quantum computing. We provide a complete description of our architecture, including the underlying physical ingredients. We start by showing that in topological superconductor networks, hexagonal cells can be employed to serve as physical qubits for universal quantum computation, and we present protocols for realizing topologically protected Clifford gates. These hexagonal-cell qubits allow for a direct implementation of open-boundary color codes with ancilla-free syndrome read-out and logical T gates via magic-state distillation. For concreteness, we describe how the necessary operations can be implemented using networks of Majorana Cooper pair boxes, and we give a feasibility estimate for error correction in this architecture. Our approach is motivated by nanowire-based networks of topological superconductors, but it could also be realized in alternative settings such as quantum-Hall-superconductor hybrids.

Supersensitive ancilla-based adaptive quantum phase estimation

NASA Astrophysics Data System (ADS)

Larson, Walker; Saleh, Bahaa E. A.

2017-10-01

The supersensitivity attained in quantum phase estimation is known to be compromised in the presence of decoherence. This is particularly patent at blind spots—phase values at which sensitivity is totally lost. One remedy is to use a precisely known reference phase to shift the operation point to a less vulnerable phase value. Since this is not always feasible, we present here an alternative approach based on combining the probe with an ancillary degree of freedom containing adjustable parameters to create an entangled quantum state of higher dimension. We validate this concept by simulating a configuration of a Mach-Zehnder interferometer with a two-photon probe and a polarization ancilla of adjustable parameters, entangled at a polarizing beam splitter. At the interferometer output, the photons are measured after an adjustable unitary transformation in the polarization subspace. Through calculation of the Fisher information and simulation of an estimation procedure, we show that optimizing the adjustable polarization parameters using an adaptive measurement process provides globally supersensitive unbiased phase estimates for a range of decoherence levels, without prior information or a reference phase.

Generation and stabilization of Bell states via repeated projective measurements on a driven ancilla qubit

NASA Astrophysics Data System (ADS)

Magazzù, L.; Jaramillo, J. D.; Talkner, P.; Hänggi, P.

2018-06-01

A protocol is proposed to generate Bell states in two non-directly interacting qubits by means of repeated measurements of the state of a central ancilla connected to both qubits. An optimal measurement rate is found that minimizes the time to stably encode a Bell state in the target qubits, being of advantage in order to reduce detrimental effects from possible interactions with the environment. The quality of the entanglement is assessed in terms of the concurrence and the distance between the qubits state and the target Bell state is quantified by the fidelity.

Entanglement-assisted quantum convolutional coding

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wilde, Mark M.; Brun, Todd A.

2010-04-15

We show how to protect a stream of quantum information from decoherence induced by a noisy quantum communication channel. We exploit preshared entanglement and a convolutional coding structure to develop a theory of entanglement-assisted quantum convolutional coding. Our construction produces a Calderbank-Shor-Steane (CSS) entanglement-assisted quantum convolutional code from two arbitrary classical binary convolutional codes. The rate and error-correcting properties of the classical convolutional codes directly determine the corresponding properties of the resulting entanglement-assisted quantum convolutional code. We explain how to encode our CSS entanglement-assisted quantum convolutional codes starting from a stream of information qubits, ancilla qubits, and shared entangled bits.

Experimental demonstration of information to energy conversion in a quantum system at the Landauer limit.

PubMed

Peterson, J P S; Sarthour, R S; Souza, A M; Oliveira, I S; Goold, J; Modi, K; Soares-Pinto, D O; Céleri, L C

2016-04-01

Landauer's principle sets fundamental thermodynamical constraints for classical and quantum information processing, thus affecting not only various branches of physics, but also of computer science and engineering. Despite its importance, this principle was only recently experimentally considered for classical systems. Here we employ a nuclear magnetic resonance set-up to experimentally address the information to energy conversion in a quantum system. Specifically, we consider a three nuclear spins [Formula: see text] (qubits) molecule-the system, the reservoir and the ancilla-to measure the heat dissipated during the implementation of a global system-reservoir unitary interaction that changes the information content of the system. By employing an interferometric technique, we were able to reconstruct the heat distribution associated with the unitary interaction. Then, through quantum state tomography, we measured the relative change in the entropy of the system. In this way, we were able to verify that an operation that changes the information content of the system must necessarily generate heat in the reservoir, exactly as predicted by Landauer's principle. The scheme presented here allows for the detailed study of irreversible entropy production in quantum information processors.

Architecture Framework for Trapped-Ion Quantum Computer based on Performance Simulation Tool

NASA Astrophysics Data System (ADS)

Ahsan, Muhammad

The challenge of building scalable quantum computer lies in striking appropriate balance between designing a reliable system architecture from large number of faulty computational resources and improving the physical quality of system components. The detailed investigation of performance variation with physics of the components and the system architecture requires adequate performance simulation tool. In this thesis we demonstrate a software tool capable of (1) mapping and scheduling the quantum circuit on a realistic quantum hardware architecture with physical resource constraints, (2) evaluating the performance metrics such as the execution time and the success probability of the algorithm execution, and (3) analyzing the constituents of these metrics and visualizing resource utilization to identify system components which crucially define the overall performance. Using this versatile tool, we explore vast design space for modular quantum computer architecture based on trapped ions. We find that while success probability is uniformly determined by the fidelity of physical quantum operation, the execution time is a function of system resources invested at various layers of design hierarchy. At physical level, the number of lasers performing quantum gates, impact the latency of the fault-tolerant circuit blocks execution. When these blocks are used to construct meaningful arithmetic circuit such as quantum adders, the number of ancilla qubits for complicated non-clifford gates and entanglement resources to establish long-distance communication channels, become major performance limiting factors. Next, in order to factorize large integers, these adders are assembled into modular exponentiation circuit comprising bulk of Shor's algorithm. At this stage, the overall scaling of resource-constraint performance with the size of problem, describes the effectiveness of chosen design. By matching the resource investment with the pace of advancement in hardware technology, we find optimal designs for different types of quantum adders. Conclusively, we show that 2,048-bit Shor's algorithm can be reliably executed within the resource budget of 1.5 million qubits.

Simulating the performance of a distance-3 surface code in a linear ion trap

NASA Astrophysics Data System (ADS)

Trout, Colin J.; Li, Muyuan; Gutiérrez, Mauricio; Wu, Yukai; Wang, Sheng-Tao; Duan, Luming; Brown, Kenneth R.

2018-04-01

We explore the feasibility of implementing a small surface code with 9 data qubits and 8 ancilla qubits, commonly referred to as surface-17, using a linear chain of 171Yb+ ions. Two-qubit gates can be performed between any two ions in the chain with gate time increasing linearly with ion distance. Measurement of the ion state by fluorescence requires that the ancilla qubits be physically separated from the data qubits to avoid errors on the data due to scattered photons. We minimize the time required to measure one round of stabilizers by optimizing the mapping of the two-dimensional surface code to the linear chain of ions. We develop a physically motivated Pauli error model that allows for fast simulation and captures the key sources of noise in an ion trap quantum computer including gate imperfections and ion heating. Our simulations showed a consistent requirement of a two-qubit gate fidelity of ≥99.9% for the logical memory to have a better fidelity than physical two-qubit operations. Finally, we perform an analysis of the error subsets from the importance sampling method used to bound the logical error rates to gain insight into which error sources are particularly detrimental to error correction.

Out-of-time-ordered measurements as a probe of quantum dynamics

NASA Astrophysics Data System (ADS)

Bordia, Pranjal; Alet, Fabien; Hosur, Pavan

2018-03-01

Probing the out-of-equilibrium dynamics of quantum matter has gained renewed interest owing to immense experimental progress in artificial quantum systems. Dynamical quantum measures such as the growth of entanglement entropy and out-of-time-ordered correlators (OTOCs) have been shown to provide great insight by exposing subtle quantum features invisible to traditional measures such as mass transport. However, measuring them in experiments requires either identical copies of the system, an ancilla qubit coupled to the whole system, or many measurements on a single copy, thereby making scalability extremely complex and hence, severely limiting their potential. Here, we introduce an alternative quantity, the out-of-time-ordered measurement (OTOM), which involves measuring a single observable on a single copy of the system, while retaining the distinctive features of the OTOCs. We show, theoretically, that OTOMs are closely related to OTOCs in a doubled system with the same quantum statistical properties as the original system. Using exact diagonalization, we numerically simulate classical mass transport, as well as quantum dynamics through computations of the OTOC, the OTOM, and the entanglement entropy in quantum spin chain models in various interesting regimes (including chaotic and many-body localized systems). Our results demonstrate that an OTOM can successfully reveal subtle aspects of quantum dynamics hidden to classical measures and, crucially, provide experimental access to them.

Non-Gaussian operations on bosonic modes of light: Photon-added Gaussian channels

NASA Astrophysics Data System (ADS)

Sabapathy, Krishna Kumar; Winter, Andreas

2017-06-01

We present a framework for studying bosonic non-Gaussian channels of continuous-variable systems. Our emphasis is on a class of channels that we call photon-added Gaussian channels, which are experimentally viable with current quantum-optical technologies. A strong motivation for considering these channels is the fact that it is compulsory to go beyond the Gaussian domain for numerous tasks in continuous-variable quantum information processing such as entanglement distillation from Gaussian states and universal quantum computation. The single-mode photon-added channels we consider are obtained by using two-mode beam splitters and squeezing operators with photon addition applied to the ancilla ports giving rise to families of non-Gaussian channels. For each such channel, we derive its operator-sum representation, indispensable in the present context. We observe that these channels are Fock preserving (coherence nongenerating). We then report two examples of activation using our scheme of photon addition, that of quantum-optical nonclassicality at outputs of channels that would otherwise output only classical states and of both the quantum and private communication capacities, hinting at far-reaching applications for quantum-optical communication. Further, we see that noisy Gaussian channels can be expressed as a convex mixture of these non-Gaussian channels. We also present other physical and information-theoretic properties of these channels.

Noninvasive measurement of dynamic correlation functions

NASA Astrophysics Data System (ADS)

Uhrich, Philipp; Castrignano, Salvatore; Uys, Hermann; Kastner, Michael

2017-08-01

The measurement of dynamic correlation functions of quantum systems is complicated by measurement backaction. To facilitate such measurements we introduce a protocol, based on weak ancilla-system couplings, that is applicable to arbitrary (pseudo)spin systems and arbitrary equilibrium or nonequilibrium initial states. Different choices of the coupling operator give access to the real and imaginary parts of the dynamic correlation function. This protocol reduces disturbances due to the early-time measurements to a minimum, and we quantify the deviation of the measured correlation functions from the theoretical, unitarily evolved ones. Implementations of the protocol in trapped ions and other experimental platforms are discussed. For spin-1 /2 models and single-site observables we prove that measurement backaction can be avoided altogether, allowing for the use of ancilla-free protocols.

Generating multi-photon W-like states for perfect quantum teleportation and superdense coding

NASA Astrophysics Data System (ADS)

Li, Ke; Kong, Fan-Zhen; Yang, Ming; Ozaydin, Fatih; Yang, Qing; Cao, Zhuo-Liang

2016-08-01

An interesting aspect of multipartite entanglement is that for perfect teleportation and superdense coding, not the maximally entangled W states but a special class of non-maximally entangled W-like states are required. Therefore, efficient preparation of such W-like states is of great importance in quantum communications, which has not been studied as much as the preparation of W states. In this paper, we propose a simple optical scheme for efficient preparation of large-scale polarization-based entangled W-like states by fusing two W-like states or expanding a W-like state with an ancilla photon. Our scheme can also generate large-scale W states by fusing or expanding W or even W-like states. The cost analysis shows that in generating large-scale W states, the fusion mechanism achieves a higher efficiency with non-maximally entangled W-like states than maximally entangled W states. Our scheme can also start fusion or expansion with Bell states, and it is composed of a polarization-dependent beam splitter, two polarizing beam splitters and photon detectors. Requiring no ancilla photon or controlled gate to operate, our scheme can be realized with the current photonics technology and we believe it enable advances in quantum teleportation and superdense coding in multipartite settings.

Digital Quantum Simulation of Z2 Lattice Gauge Theories with Dynamical Fermionic Matter

NASA Astrophysics Data System (ADS)

Zohar, Erez; Farace, Alessandro; Reznik, Benni; Cirac, J. Ignacio

2017-02-01

We propose a scheme for digital quantum simulation of lattice gauge theories with dynamical fermions. Using a layered optical lattice with ancilla atoms that can move and interact with the other atoms (simulating the physical degrees of freedom), we obtain a stroboscopic dynamics which yields the four-body plaquette interactions, arising in models with (2 +1 ) and higher dimensions, without the use of perturbation theory. As an example we show how to simulate a Z2 model in (2 +1 ) dimensions.

Quantum Tomography via Compressed Sensing: Error Bounds, Sample Complexity and Efficient Estimators (Open Access, Publisher’s Version)

DTIC Science & Technology

2012-09-27

we require no entangling gates or ancillary systems for the procedure. In contrast with [19], our method is not restricted to processes that are...states, such as those recently developed for use with permutation-invariant states [60], matrix product states [61] or multi-scale entangled states [62...by adjoining an ancilla, preparing the maximally entangled state |ψ0〉, and applying E); then do compressed quantum state tomography on ρE ; see

Digital Quantum Simulation of Z_{2} Lattice Gauge Theories with Dynamical Fermionic Matter.

PubMed

Zohar, Erez; Farace, Alessandro; Reznik, Benni; Cirac, J Ignacio

2017-02-17

We propose a scheme for digital quantum simulation of lattice gauge theories with dynamical fermions. Using a layered optical lattice with ancilla atoms that can move and interact with the other atoms (simulating the physical degrees of freedom), we obtain a stroboscopic dynamics which yields the four-body plaquette interactions, arising in models with (2+1) and higher dimensions, without the use of perturbation theory. As an example we show how to simulate a Z_{2} model in (2+1) dimensions.

Optimal protocols for slowly driven quantum systems.

PubMed

Zulkowski, Patrick R; DeWeese, Michael R

2015-09-01

The design of efficient quantum information processing will rely on optimal nonequilibrium transitions of driven quantum systems. Building on a recently developed geometric framework for computing optimal protocols for classical systems driven in finite time, we construct a general framework for optimizing the average information entropy for driven quantum systems. Geodesics on the parameter manifold endowed with a positive semidefinite metric correspond to protocols that minimize the average information entropy production in finite time. We use this framework to explicitly compute the optimal entropy production for a simple two-state quantum system coupled to a heat bath of bosonic oscillators, which has applications to quantum annealing.

Programmable Quantum Photonic Processor Using Silicon Photonics

DTIC Science & Technology

2017-04-01

quantum information processing and quantum sensing, ranging from linear optics quantum computing and quantum simulation to quantum ...transformers have driven experimental and theoretical advances in quantum simulation, cluster-state quantum computing , all-optical quantum repeaters...neuromorphic computing , and other applications. In addition, we developed new schemes for ballistic quantum computation , new methods for

Efficient eigenvalue determination for arbitrary Pauli products based on generalized spin-spin interactions

NASA Astrophysics Data System (ADS)

Leibfried, D.; Wineland, D. J.

2018-03-01

Effective spin-spin interactions between ? qubits enable the determination of the eigenvalue of an arbitrary Pauli product of dimension N with a constant, small number of multi-qubit gates that is independent of N and encodes the eigenvalue in the measurement basis states of an extra ancilla qubit. Such interactions are available whenever qubits can be coupled to a shared harmonic oscillator, a situation that can be realized in many physical qubit implementations. For example, suitable interactions have already been realized for up to 14 qubits in ion traps. It should be possible to implement stabilizer codes for quantum error correction with a constant number of multi-qubit gates, in contrast to typical constructions with a number of two-qubit gates that increases as a function of N. The special case of finding the parity of N qubits only requires a small number of operations that is independent of N. This compares favorably to algorithms for computing the parity on conventional machines, which implies a genuine quantum advantage.

Achieving the Heisenberg limit in quantum metrology using quantum error correction.

PubMed

Zhou, Sisi; Zhang, Mengzhen; Preskill, John; Jiang, Liang

2018-01-08

Quantum metrology has many important applications in science and technology, ranging from frequency spectroscopy to gravitational wave detection. Quantum mechanics imposes a fundamental limit on measurement precision, called the Heisenberg limit, which can be achieved for noiseless quantum systems, but is not achievable in general for systems subject to noise. Here we study how measurement precision can be enhanced through quantum error correction, a general method for protecting a quantum system from the damaging effects of noise. We find a necessary and sufficient condition for achieving the Heisenberg limit using quantum probes subject to Markovian noise, assuming that noiseless ancilla systems are available, and that fast, accurate quantum processing can be performed. When the sufficient condition is satisfied, a quantum error-correcting code can be constructed that suppresses the noise without obscuring the signal; the optimal code, achieving the best possible precision, can be found by solving a semidefinite program.

Concrete resource analysis of the quantum linear-system algorithm used to compute the electromagnetic scattering cross section of a 2D target

NASA Astrophysics Data System (ADS)

Scherer, Artur; Valiron, Benoît; Mau, Siun-Chuon; Alexander, Scott; van den Berg, Eric; Chapuran, Thomas E.

2017-03-01

We provide a detailed estimate for the logical resource requirements of the quantum linear-system algorithm (Harrow et al. in Phys Rev Lett 103:150502, 2009) including the recently described elaborations and application to computing the electromagnetic scattering cross section of a metallic target (Clader et al. in Phys Rev Lett 110:250504, 2013). Our resource estimates are based on the standard quantum-circuit model of quantum computation; they comprise circuit width (related to parallelism), circuit depth (total number of steps), the number of qubits and ancilla qubits employed, and the overall number of elementary quantum gate operations as well as more specific gate counts for each elementary fault-tolerant gate from the standard set { X, Y, Z, H, S, T, { CNOT } }. In order to perform these estimates, we used an approach that combines manual analysis with automated estimates generated via the Quipper quantum programming language and compiler. Our estimates pertain to the explicit example problem size N=332{,}020{,}680 beyond which, according to a crude big-O complexity comparison, the quantum linear-system algorithm is expected to run faster than the best known classical linear-system solving algorithm. For this problem size, a desired calculation accuracy ɛ =0.01 requires an approximate circuit width 340 and circuit depth of order 10^{25} if oracle costs are excluded, and a circuit width and circuit depth of order 10^8 and 10^{29}, respectively, if the resource requirements of oracles are included, indicating that the commonly ignored oracle resources are considerable. In addition to providing detailed logical resource estimates, it is also the purpose of this paper to demonstrate explicitly (using a fine-grained approach rather than relying on coarse big-O asymptotic approximations) how these impressively large numbers arise with an actual circuit implementation of a quantum algorithm. While our estimates may prove to be conservative as more efficient advanced quantum-computation techniques are developed, they nevertheless provide a valid baseline for research targeting a reduction of the algorithmic-level resource requirements, implying that a reduction by many orders of magnitude is necessary for the algorithm to become practical.

Using hyperentanglement to enhance resolution, signal-to-noise ratio, and measurement time

NASA Astrophysics Data System (ADS)

Smith, James F.

2017-03-01

A hyperentanglement-based atmospheric imaging/detection system involving only a signal and an ancilla photon will be considered for optical and infrared frequencies. Only the signal photon will propagate in the atmosphere and its loss will be classical. The ancilla photon will remain within the sensor experiencing low loss. Closed form expressions for the wave function, normalization, density operator, reduced density operator, symmetrized logarithmic derivative, quantum Fisher information, quantum Cramer-Rao lower bound, coincidence probabilities, probability of detection, probability of false alarm, probability of error after M measurements, signal-to-noise ratio, quantum Chernoff bound, time-on-target expressions related to probability of error, and resolution will be provided. The effect of noise in every mode will be included as well as loss. The system will provide the basic design for an imaging/detection system functioning at optical or infrared frequencies that offers better than classical angular and range resolution. Optimization for enhanced resolution will be included. The signal-to-noise ratio will be increased by a factor equal to the number of modes employed during the hyperentanglement process. Likewise, the measurement time can be reduced by the same factor. The hyperentanglement generator will typically make use of entanglement in polarization, energy-time, orbital angular momentum and so on. Mathematical results will be provided describing the system's performance as a function of loss mechanisms and noise.

Entanglement-enhanced quantum metrology in a noisy environment

NASA Astrophysics Data System (ADS)

Wang, Kunkun; Wang, Xiaoping; Zhan, Xiang; Bian, Zhihao; Li, Jian; Sanders, Barry C.; Xue, Peng

2018-04-01

Quantum metrology overcomes standard precision limits and plays a central role in science and technology. Practically, it is vulnerable to imperfections such as decoherence. Here we demonstrate quantum metrology for noisy channels such that entanglement with ancillary qubits enhances the quantum Fisher information for phase estimation but not otherwise. Our photonic experiment covers a range of noise for various types of channels, including for two randomly alternating channels such that assisted entanglement fails for each noisy channel individually. We simulate noisy channels by implementing space-multiplexed dual interferometers with quantum photonic inputs. We demonstrate the advantage of entanglement-assisted protocols in a phase estimation experiment run with either a single-probe or multiprobe approach. These results establish that entanglement with ancillae is a valuable approach for delivering quantum-enhanced metrology. Our approach to entanglement-assisted quantum metrology via a simple linear-optical interferometric network with easy-to-prepare photonic inputs provides a path towards practical quantum metrology.

Scheme for implementing 1 → M symmetric economical phase-covariant telecloning based on quantum logic network

NASA Astrophysics Data System (ADS)

Zhou, Yan-Hui; Wang, Lei

2012-04-01

The quantum logic network to implement 1 → M symmetric economical phase-covariant telecloning is presented. The scheme includes two parts: the first part is used to create the telecloning channel and the second part to teleport the input state. The telecloning channel which works without ancilla is constructed by two kinds of elementary unitary transformations, single-qubit rotation and multiple-qubit controlled operation. The probability of success is 50%, which is the same with the scheme in [Meng, F.Y.; Zhu, A.D. J. Mod. Opt. 2009, 56, 1255-1259].

Precise single-qubit control of the reflection phase of a photon mediated by a strongly-coupled ancilla–cavity system

NASA Astrophysics Data System (ADS)

Motzoi, F.; Mølmer, K.

2018-05-01

We propose to use the interaction between a single qubit atom and a surrounding ensemble of three level atoms to control the phase of light reflected by an optical cavity. Our scheme employs an ensemble dark resonance that is perturbed by the qubit atom to yield a single-atom single photon gate. We show here that off-resonant excitation towards Rydberg states with strong dipolar interactions offers experimentally-viable regimes of operations with low errors (in the 10‑3 range) as required for fault-tolerant optical-photon, gate-based quantum computation. We also propose and analyze an implementation within microwave circuit-QED, where a strongly-coupled ancilla superconducting qubit can be used in the place of the atomic ensemble to provide high-fidelity coupling to microwave photons.

A new software-based architecture for quantum computer

NASA Astrophysics Data System (ADS)

Wu, Nan; Song, FangMin; Li, Xiangdong

2010-04-01

In this paper, we study a reliable architecture of a quantum computer and a new instruction set and machine language for the architecture, which can improve the performance and reduce the cost of the quantum computing. We also try to address some key issues in detail in the software-driven universal quantum computers.

Exploiting Many-Body Bus States for Multi-Qubit Entanglement

DTIC Science & Technology

2013-06-06

ancilla qubits . We studied electron-spin-photon coupling in a single-spin double quantum dot embedded in a superconducting stripline cavity. We... qubit to a superconducting stripline cavity,” Xuedong Hu, Yu-xi Liu, and Franco Nori, Phys. Rev. B 86, 035314 (2012). [9] “Controllable exchange...DARPA) EXPLOITING MANY-BODY BUS STATES FOR MULTI- QUBIT ENTANGLEMENT MARK FRIESEN UNIVERSITY OF WISCONSIN SYSTEM 06/06/2013 Final Report

Quantum steganography with large payload based on entanglement swapping of χ-type entangled states

NASA Astrophysics Data System (ADS)

Qu, Zhi-Guo; Chen, Xiu-Bo; Luo, Ming-Xing; Niu, Xin-Xin; Yang, Yi-Xian

2011-04-01

In this paper, we firstly propose a new simple method to calculate entanglement swapping of χ-type entangled states, and then present a novel quantum steganography protocol with large payload. The new protocol adopts entanglement swapping to build up the hidden channel within quantum secure direct communication with χ-type entangled states for securely transmitting secret messages. Comparing with the previous quantum steganographies, the capacity of the hidden channel is much higher, which is increased to eight bits. Meanwhile, due to the quantum uncertainty theorem and the no-cloning theorem its imperceptibility is proved to be great in the analysis, and its security is also analyzed in detail, which is proved that intercept-resend attack, measurement-resend attack, ancilla attack, man-in-the-middle attack or even Dos(Denial of Service) attack couldn't threaten it. As a result, the protocol can be applied in various fields of quantum communication.

Experimental Detection of Quantum Channel Capacities.

PubMed

Cuevas, Álvaro; Proietti, Massimiliano; Ciampini, Mario Arnolfo; Duranti, Stefano; Mataloni, Paolo; Sacchi, Massimiliano F; Macchiavello, Chiara

2017-09-08

We present an efficient experimental procedure that certifies nonvanishing quantum capacities for qubit noisy channels. Our method is based on the use of a fixed bipartite entangled state, where the system qubit is sent to the channel input. A particular set of local measurements is performed at the channel output and the ancilla qubit mode, obtaining lower bounds to the quantum capacities for any unknown channel with no need of quantum process tomography. The entangled qubits have a Bell state configuration and are encoded in photon polarization. The lower bounds are found by estimating the Shannon and von Neumann entropies at the output using an optimized basis, whose statistics is obtained by measuring only the three observables σ_{x}⊗σ_{x}, σ_{y}⊗σ_{y}, and σ_{z}⊗σ_{z}.

Quantum delayed-choice experiment with a single neutral atom.

PubMed

Li, Gang; Zhang, Pengfei; Zhang, Tiancai

2017-10-01

We present a proposal to implement a quantum delayed-choice (QDC) experiment with a single neutral atom, such as a rubidium or cesium atom. In our proposal, a Ramsey interferometer is adopted to observe the wave-like or particle-like behaviors of a single atom depending on the existence or absence of the second π/2-rotation. A quantum-controlled π/2-rotation on target atom is realized through a Rydberg-Rydberg interaction by another ancilla atom. It shows that a heavy neutral atom can also have a morphing behavior between the particle and the wave. The realization of the QDC experiment with such heavy neutral atoms not only is significant to understand the Bohr's complementarity principle in matter-wave and matter-particle domains but also has great potential on the quantum information process with neutral atoms.

Engineering multiphoton states for linear optics computation

NASA Astrophysics Data System (ADS)

Aniello, P.; Lupo, C.; Napolitano, M.; Paris, M. G. A.

2007-03-01

Transformations achievable by linear optical components allow to generate the whole unitary group only when restricted to the one-photon subspace of a multimode Fock space. In this paper, we address the more general problem of encoding quantum information by multiphoton states, and elaborating it via ancillary extensions, linear optical passive devices and photodetection. Our scheme stems in a natural way from the mathematical structures underlying the physics of linear optical passive devices. In particular, we analyze an economical procedure for mapping a fiducial 2-photon 2-mode state into an arbitrary 2-photon 2-mode state using ancillary resources and linear optical passive N-ports assisted by post-selection. We found that adding a single ancilla mode is enough to generate any desired target state. The effect of imperfect photodetection in post-selection is considered and a simple trade-off between success probability and fidelity is derived.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Williamson, Mark S.; Son Wonmin; Heaney, Libby

Recently, it was demonstrated by Son et al., Phys. Rev. Lett. 102, 110404 (2009), that a separable bipartite continuous-variable quantum system can violate the Clauser-Horne-Shimony-Holt (CHSH) inequality via operationally local transformations. Operationally local transformations are parametrized only by local variables; however, in order to allow violation of the CHSH inequality, a maximally entangled ancilla was necessary. The use of the entangled ancilla in this scheme caused the state under test to become dependent on the measurement choice one uses to calculate the CHSH inequality, thus violating one of the assumptions used in deriving a Bell inequality, namely, the free willmore » or statistical independence assumption. The novelty in this scheme however is that the measurement settings can be external free parameters. In this paper, we generalize these operationally local transformations for multipartite Bell inequalities (with dichotomic observables) and provide necessary and sufficient conditions for violation within this scheme. Namely, a violation of a multipartite Bell inequality in this setting is contingent on whether an ancillary system admits any realistic local hidden variable model (i.e., whether the ancilla violates the given Bell inequality). These results indicate that violation of a Bell inequality performed on a system does not necessarily imply that the system is nonlocal. In fact, the system under test may be completely classical. However, nonlocality must have resided somewhere, this may have been in the environment, the physical variables used to manipulate the system or the detectors themselves provided the measurement settings are external free variables.« less

Quantum Tomography via Compressed Sensing: Error Bounds, Sample Complexity and Efficient Estimators

DTIC Science & Technology

2012-09-27

particular, we require no entangling gates or ancillary systems for the procedure. In contrast with [19], our method is not restricted to processes that are...of states, such as those recently developed for use with permutation-invariant states [60], matrix product states [61] or multi-scale entangled states...process tomography: first prepare the Jamiołkowski state ρE (by adjoining an ancilla, preparing the maximally entangled state |ψ0, and applying E); then

Measuring Quantum Coherence with Entanglement.

PubMed

Streltsov, Alexander; Singh, Uttam; Dhar, Himadri Shekhar; Bera, Manabendra Nath; Adesso, Gerardo

2015-07-10

Quantum coherence is an essential ingredient in quantum information processing and plays a central role in emergent fields such as nanoscale thermodynamics and quantum biology. However, our understanding and quantitative characterization of coherence as an operational resource are still very limited. Here we show that any degree of coherence with respect to some reference basis can be converted to entanglement via incoherent operations. This finding allows us to define a novel general class of measures of coherence for a quantum system of arbitrary dimension, in terms of the maximum bipartite entanglement that can be generated via incoherent operations applied to the system and an incoherent ancilla. The resulting measures are proven to be valid coherence monotones satisfying all the requirements dictated by the resource theory of quantum coherence. We demonstrate the usefulness of our approach by proving that the fidelity-based geometric measure of coherence is a full convex coherence monotone, and deriving a closed formula for it on arbitrary single-qubit states. Our work provides a clear quantitative and operational connection between coherence and entanglement, two landmark manifestations of quantum theory and both key enablers for quantum technologies.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chen Qing; Department of Modern Physics, University of Science and Technology of China, Hefei 230026; Cheng Jianhua

In this paper we demonstrate that optimal 1{yields}M phase-covariant cloning quantum cloning is available via free dynamical evolution of spin networks. By properly designing the network and the couplings between spins, we show that optimal 1{yields}M phase-covariant cloning can be achieved if the initial state is prepared as a specific symmetric state. Especially, when M is an odd number, the optimal phase-covariant cloning can be achieved without ancillas. Moreover, we demonstrate that the same framework is capable for optimal 1{yields}2 universal cloning.

Advanced Materials for Quantum Computing

DTIC Science & Technology

2010-04-28

with Magnons co-PI: Leszek Malkinski w/ Postdoc Dr. Seong-Gi Min Project Name: Quantum Computing with Magnons 1. Brief Narrative: Quanta of...spinwaves called magnons can be used to exchange quantum information between solid state qubits. The project was driven by the concept of spiwave bus

Versatile microwave-driven trapped ion spin system for quantum information processing

PubMed Central

Piltz, Christian; Sriarunothai, Theeraphot; Ivanov, Svetoslav S.; Wölk, Sabine; Wunderlich, Christof

2016-01-01

Using trapped atomic ions, we demonstrate a tailored and versatile effective spin system suitable for quantum simulations and universal quantum computation. By simply applying microwave pulses, selected spins can be decoupled from the remaining system and, thus, can serve as a quantum memory, while simultaneously, other coupled spins perform conditional quantum dynamics. Also, microwave pulses can change the sign of spin-spin couplings, as well as their effective strength, even during the course of a quantum algorithm. Taking advantage of the simultaneous long-range coupling between three spins, a coherent quantum Fourier transform—an essential building block for many quantum algorithms—is efficiently realized. This approach, which is based on microwave-driven trapped ions and is complementary to laser-based methods, opens a new route to overcoming technical and physical challenges in the quest for a quantum simulator and a quantum computer. PMID:27419233

Research on Electrically Driven Single Photon Emitter by Diamond for Quantum Cryptography

DTIC Science & Technology

2015-03-24

by diamond for quantum cryptography 5a. CONTRACT NUMBER FA2386-14-1-4037 5b. GRANT NUMBE R Grant 14IOA093_144037 5c. PROGRAM ELEMENT...emerged as a highly competitive platform for applications in quantum cryptography , quantum computing, spintronics, and sensing or metrology...15. SUBJECT TERMS Diamond LED, Nitrogen Vacancy Complex, Quantum Computing, Quantum Cryptography , Single Spin Single Photon 16. SECURITY

Measurement-free implementations of small-scale surface codes for quantum-dot qubits

NASA Astrophysics Data System (ADS)

Ercan, H. Ekmel; Ghosh, Joydip; Crow, Daniel; Premakumar, Vickram N.; Joynt, Robert; Friesen, Mark; Coppersmith, S. N.

2018-01-01

The performance of quantum-error-correction schemes depends sensitively on the physical realizations of the qubits and the implementations of various operations. For example, in quantum-dot spin qubits, readout is typically much slower than gate operations, and conventional surface-code implementations that rely heavily on syndrome measurements could therefore be challenging. However, fast and accurate reset of quantum-dot qubits, without readout, can be achieved via tunneling to a reservoir. Here we propose small-scale surface-code implementations for which syndrome measurements are replaced by a combination of Toffoli gates and qubit reset. For quantum-dot qubits, this enables much faster error correction than measurement-based schemes, but requires additional ancilla qubits and non-nearest-neighbor interactions. We have performed numerical simulations of two different coding schemes, obtaining error thresholds on the orders of 10-2 for a one-dimensional architecture that only corrects bit-flip errors and 10-4 for a two-dimensional architecture that corrects bit- and phase-flip errors.

An entangled-light-emitting diode.

PubMed

Salter, C L; Stevenson, R M; Farrer, I; Nicoll, C A; Ritchie, D A; Shields, A J

2010-06-03

An optical quantum computer, powerful enough to solve problems so far intractable using conventional digital logic, requires a large number of entangled photons. At present, entangled-light sources are optically driven with lasers, which are impractical for quantum computing owing to the bulk and complexity of the optics required for large-scale applications. Parametric down-conversion is the most widely used source of entangled light, and has been used to implement non-destructive quantum logic gates. However, these sources are Poissonian and probabilistically emit zero or multiple entangled photon pairs in most cycles, fundamentally limiting the success probability of quantum computational operations. These complications can be overcome by using an electrically driven on-demand source of entangled photon pairs, but so far such a source has not been produced. Here we report the realization of an electrically driven source of entangled photon pairs, consisting of a quantum dot embedded in a semiconductor light-emitting diode (LED) structure. We show that the device emits entangled photon pairs under d.c. and a.c. injection, the latter achieving an entanglement fidelity of up to 0.82. Entangled light with such high fidelity is sufficient for application in quantum relays, in core components of quantum computing such as teleportation, and in entanglement swapping. The a.c. operation of the entangled-light-emitting diode (ELED) indicates its potential function as an on-demand source without the need for a complicated laser driving system; consequently, the ELED is at present the best source on which to base future scalable quantum information applications.

Single-photon emitting diode in silicon carbide.

PubMed

Lohrmann, A; Iwamoto, N; Bodrog, Z; Castelletto, S; Ohshima, T; Karle, T J; Gali, A; Prawer, S; McCallum, J C; Johnson, B C

2015-07-23

Electrically driven single-photon emitting devices have immediate applications in quantum cryptography, quantum computation and single-photon metrology. Mature device fabrication protocols and the recent observations of single defect systems with quantum functionalities make silicon carbide an ideal material to build such devices. Here, we demonstrate the fabrication of bright single-photon emitting diodes. The electrically driven emitters display fully polarized output, superior photon statistics (with a count rate of >300 kHz) and stability in both continuous and pulsed modes, all at room temperature. The atomic origin of the single-photon source is proposed. These results provide a foundation for the large scale integration of single-photon sources into a broad range of applications, such as quantum cryptography or linear optics quantum computing.

Scalable uniform construction of highly conditional quantum gates

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ivanov, Svetoslav S.; Vitanov, Nikolay V.

2011-08-15

We present a scalable uniform technique for the construction of highly conditional multiply-controlled-not quantum gates of trapped ion qubits, such as the Toffoli gate, without using ancilla states and circuits of an exorbitant number of concatenated one- and two-qubit gates. Apart from the initial dressing of the internal qubit states with vibrational phonons and the final restoration of the phonon ground state, our technique requires the application of just a single composite pulse on the target qubit and is applicable both in and outside the Lamb-Dicke regime. We design special narrowband composite pulses, which suppress all transitions but the conditionalmore » transition of the target qubit; moreover, these composite pulses significantly improve the spatial addressing selectivity.« less

Heats of Segregation of BCC Binaries from Ab Initio and Quantum Approximate Calculations

NASA Technical Reports Server (NTRS)

Good, Brian S.

2003-01-01

We compare dilute-limit segregation energies for selected BCC transition metal binaries computed using ab initio and quantum approximate energy methods. Ab initio calculations are carried out using the CASTEP plane-wave pseudopotential computer code, while quantum approximate results are computed using the Bozzolo-Ferrante-Smith (BFS) method with the most recent parameters. Quantum approximate segregation energies are computed with and without atomistic relaxation. Results are discussed within the context of segregation models driven by strain and bond-breaking effects. We compare our results with full-potential quantum calculations and with available experimental results.

Quantum computational complexity, Einstein's equations and accelerated expansion of the Universe

NASA Astrophysics Data System (ADS)

Ge, Xian-Hui; Wang, Bin

2018-02-01

We study the relation between quantum computational complexity and general relativity. The quantum computational complexity is proposed to be quantified by the shortest length of geodesic quantum curves. We examine the complexity/volume duality in a geodesic causal ball in the framework of Fermi normal coordinates and derive the full non-linear Einstein equation. Using insights from the complexity/action duality, we argue that the accelerated expansion of the universe could be driven by the quantum complexity and free from coincidence and fine-tunning problems.

Intertwined electron-nuclear motion in frustrated double ionization in driven heteronuclear molecules

NASA Astrophysics Data System (ADS)

Vilà, A.; Zhu, J.; Scrinzi, A.; Emmanouilidou, A.

2018-03-01

We study frustrated double ionization (FDI) in a strongly-driven heteronuclear molecule HeH+ and compare with H2. We compute the probability distribution of the sum of the final kinetic energies of the nuclei for strongly-driven HeH+. We find that this distribution has more than one peak for strongly-driven HeH+, a feature we do not find to be present for strongly-driven H2. Moreover, we compute the probability distribution of the principal quantum number n of FDI. We find that this distribution has several peaks for strongly-driven HeH+, while the respective distribution has one main peak and a ‘shoulder’ at lower principal quantum numbers n for strongly-driven H2. Surprisingly, we find this feature to be a clear signature of the intertwined electron-nuclear motion.

Generation of large scale GHZ states with the interactions of photons and quantum-dot spins

NASA Astrophysics Data System (ADS)

Miao, Chun; Fang, Shu-Dong; Dong, Ping; Yang, Ming; Cao, Zhuo-Liang

2018-03-01

We present a deterministic scheme for generating large scale GHZ states in a cavity-quantum dot system. A singly charged quantum dot is embedded in a double-sided optical microcavity with partially reflective top and bottom mirrors. The GHZ-type Bell spin state can be created and two n-spin GHZ states can be perfectly fused to a 2n-spin GHZ state with the help of n ancilla single-photon pulses. The implementation of the current scheme only depends on the photon detection and its need not to operate multi-qubit gates and multi-qubit measurements. Discussions about the effect of the cavity loss, side leakage and exciton cavity coupling strength for the fidelity of generated states show that the fidelity can remain high enough by controlling system parameters. So the current scheme is simple and feasible in experiment.

Ultrastructure of euspermatozoa and paraspermatozoa in the volutid snail Adelomelon ancilla (Mollusca: Caenogastropoda)

NASA Astrophysics Data System (ADS)

Zabala, S.; Hermida, G. N.; Giménez, J.

2009-09-01

The ultrastructure of the euspermatozoa and the paraspermatozoa is investigated in Adelomelon ancilla, through histological section observed by transmission electron microscopy. Euspermatozoa of A. ancilla consists of: (1) a conical acrosomal vesicle (with a short basal invagination, constricted anteriorly) which is flattened at the apex and associated with an axial rod, a centrally perforated basal plate and a short accessory membrane, (2) a rod-shaped, solid and highly electron-dense nucleus (with a short basal fossa containing a centriolar complex and a initial portion of a 9 + 2 axoneme), (3) an elongate midpiece consisting of the axoneme sheathed by 5-6 helical mitochondrial elements each exhibiting a dense U-shaped outer layer, (4) an elongate glycogen piece (where the axoneme is sheathed by nine tracts of glycogen granules), (5) a dense annulus at the junction of the midpiece and glycogen piece, and (6) a short free tail region (where the axoneme is surrounded only by plasma membrane). We observed a parasperm in A. ancilla. This is vermiform in shape and is composed of multiple axonemes and extensive cytoplasm with numerous vesicles, and mitochondria are scattered inside the axonemes. Sperm of A. ancilla is characterized by the euspermatozoa type 2 and the paraspermatozoa morphology belongs to type 5. The U shaped electrodense mitochondrial element in the midpiece of the eusperm and the constriction in the acrosomal vesicle present in A. ancilla are exclusive. We suggest that these characteristics could have taxonomic importance, because these was observed in other volutids and have not been observed in the rest of caenogastropods studies. We consider that the morphology of paraspermatozoa in A. ancilla corresponds to the “lancet” type.

Quantum transitions driven by one-bond defects in quantum Ising rings.

PubMed

Campostrini, Massimo; Pelissetto, Andrea; Vicari, Ettore

2015-04-01

We investigate quantum scaling phenomena driven by lower-dimensional defects in quantum Ising-like models. We consider quantum Ising rings in the presence of a bond defect. In the ordered phase, the system undergoes a quantum transition driven by the bond defect between a magnet phase, in which the gap decreases exponentially with increasing size, and a kink phase, in which the gap decreases instead with a power of the size. Close to the transition, the system shows a universal scaling behavior, which we characterize by computing, either analytically or numerically, scaling functions for the low-level energy differences and the two-point correlation function. We discuss the implications of these results for the nonequilibrium dynamics in the presence of a slowly varying parallel magnetic field h, when going across the first-order quantum transition at h=0.

Flow Ambiguity: A Path Towards Classically Driven Blind Quantum Computation

NASA Astrophysics Data System (ADS)

Mantri, Atul; Demarie, Tommaso F.; Menicucci, Nicolas C.; Fitzsimons, Joseph F.

2017-07-01

Blind quantum computation protocols allow a user to delegate a computation to a remote quantum computer in such a way that the privacy of their computation is preserved, even from the device implementing the computation. To date, such protocols are only known for settings involving at least two quantum devices: either a user with some quantum capabilities and a remote quantum server or two or more entangled but noncommunicating servers. In this work, we take the first step towards the construction of a blind quantum computing protocol with a completely classical client and single quantum server. Specifically, we show how a classical client can exploit the ambiguity in the flow of information in measurement-based quantum computing to construct a protocol for hiding critical aspects of a computation delegated to a remote quantum computer. This ambiguity arises due to the fact that, for a fixed graph, there exist multiple choices of the input and output vertex sets that result in deterministic measurement patterns consistent with the same fixed total ordering of vertices. This allows a classical user, computing only measurement angles, to drive a measurement-based computation performed on a remote device while hiding critical aspects of the computation.

Dynamically protected cat-qubits: a new paradigm for universal quantum computation

NASA Astrophysics Data System (ADS)

Mirrahimi, Mazyar; Leghtas, Zaki; Albert, Victor V.; Touzard, Steven; Schoelkopf, Robert J.; Jiang, Liang; Devoret, Michel H.

2014-04-01

We present a new hardware-efficient paradigm for universal quantum computation which is based on encoding, protecting and manipulating quantum information in a quantum harmonic oscillator. This proposal exploits multi-photon driven dissipative processes to encode quantum information in logical bases composed of Schrödinger cat states. More precisely, we consider two schemes. In a first scheme, a two-photon driven dissipative process is used to stabilize a logical qubit basis of two-component Schrödinger cat states. While such a scheme ensures a protection of the logical qubit against the photon dephasing errors, the prominent error channel of single-photon loss induces bit-flip type errors that cannot be corrected. Therefore, we consider a second scheme based on a four-photon driven dissipative process which leads to the choice of four-component Schrödinger cat states as the logical qubit. Such a logical qubit can be protected against single-photon loss by continuous photon number parity measurements. Next, applying some specific Hamiltonians, we provide a set of universal quantum gates on the encoded qubits of each of the two schemes. In particular, we illustrate how these operations can be rendered fault-tolerant with respect to various decoherence channels of participating quantum systems. Finally, we also propose experimental schemes based on quantum superconducting circuits and inspired by methods used in Josephson parametric amplification, which should allow one to achieve these driven dissipative processes along with the Hamiltonians ensuring the universal operations in an efficient manner.

Surface Segregation Energies of BCC Binaries from Ab Initio and Quantum Approximate Calculations

NASA Technical Reports Server (NTRS)

Good, Brian S.

2003-01-01

We compare dilute-limit segregation energies for selected BCC transition metal binaries computed using ab initio and quantum approximate energy method. Ab initio calculations are carried out using the CASTEP plane-wave pseudopotential computer code, while quantum approximate results are computed using the Bozzolo-Ferrante-Smith (BFS) method with the most recent parameterization. Quantum approximate segregation energies are computed with and without atomistic relaxation. The ab initio calculations are performed without relaxation for the most part, but predicted relaxations from quantum approximate calculations are used in selected cases to compute approximate relaxed ab initio segregation energies. Results are discussed within the context of segregation models driven by strain and bond-breaking effects. We compare our results with other quantum approximate and ab initio theoretical work, and available experimental results.

Heats of Segregation of BCC Binaries from ab Initio and Quantum Approximate Calculations

NASA Technical Reports Server (NTRS)

Good, Brian S.

2004-01-01

We compare dilute-limit heats of segregation for selected BCC transition metal binaries computed using ab initio and quantum approximate energy methods. Ab initio calculations are carried out using the CASTEP plane-wave pseudopotential computer code, while quantum approximate results are computed using the Bozzolo-Ferrante-Smith (BFS) method with the most recent LMTO-based parameters. Quantum approximate segregation energies are computed with and without atomistic relaxation, while the ab initio calculations are performed without relaxation. Results are discussed within the context of a segregation model driven by strain and bond-breaking effects. We compare our results with full-potential quantum calculations and with available experimental results.

Near optimal discrimination of binary coherent signals via atom–light interaction

NASA Astrophysics Data System (ADS)

Han, Rui; Bergou, János A.; Leuchs, Gerd

2018-04-01

We study the discrimination of weak coherent states of light with significant overlaps by nondestructive measurements on the light states through measuring atomic states that are entangled to the coherent states via dipole coupling. In this way, the problem of measuring and discriminating coherent light states is shifted to finding the appropriate atom–light interaction and atomic measurements. We show that this scheme allows us to attain a probability of error extremely close to the Helstrom bound, the ultimate quantum limit for discriminating binary quantum states, through the simple Jaynes–Cummings interaction between the field and ancilla with optimized light–atom coupling and projective measurements on the atomic states. Moreover, since the measurement is nondestructive on the light state, information that is not detected by one measurement can be extracted from the post-measurement light states through subsequent measurements.

Counterfactual quantum cryptography based on weak coherent states

NASA Astrophysics Data System (ADS)

Yin, Zhen-Qiang; Li, Hong-Wei; Yao, Yao; Zhang, Chun-Mei; Wang, Shuang; Chen, Wei; Guo, Guang-Can; Han, Zheng-Fu

2012-08-01

In the “counterfactual quantum cryptography” scheme [T.-G. Noh, Phys. Rev. Lett.PRLTAO0031-900710.1103/PhysRevLett.103.230501 103, 230501 (2009)], two legitimate distant peers may share secret-key bits even when the information carriers do not travel in the quantum channel. The security of this protocol with an ideal single-photon source has been proved by Yin [Z.-Q. Yin, H. W. Li, W. Chen, Z. F. Han, and G. C. Guo, Phys. Rev. APLRAAN1050-294710.1103/PhysRevA.82.042335 82, 042335 (2010)]. In this paper, we prove the security of the counterfactual-quantum-cryptography scheme based on a commonly used weak-coherent-laser source by considering a general collective attack. The basic assumption of this proof is that the efficiency and dark-counting rate of a single-photon detector are consistent for any n-photon Fock states. Then through randomizing the phases of the encoding weak coherent states, Eve's ancilla will be transformed into a classical mixture. Finally, the lower bound of the secret-key-bit rate and a performance analysis for the practical implementation are both given.

Eternal non-Markovianity: from random unitary to Markov chain realisations.

PubMed

Megier, Nina; Chruściński, Dariusz; Piilo, Jyrki; Strunz, Walter T

2017-07-25

The theoretical description of quantum dynamics in an intriguing way does not necessarily imply the underlying dynamics is indeed intriguing. Here we show how a known very interesting master equation with an always negative decay rate [eternal non-Markovianity (ENM)] arises from simple stochastic Schrödinger dynamics (random unitary dynamics). Equivalently, it may be seen as arising from a mixture of Markov (semi-group) open system dynamics. Both these approaches lead to a more general family of CPT maps, characterized by a point within a parameter triangle. Our results show how ENM quantum dynamics can be realised easily in the laboratory. Moreover, we find a quantum time-continuously measured (quantum trajectory) realisation of the dynamics of the ENM master equation based on unitary transformations and projective measurements in an extended Hilbert space, guided by a classical Markov process. Furthermore, a Gorini-Kossakowski-Sudarshan-Lindblad (GKSL) representation of the dynamics in an extended Hilbert space can be found, with a remarkable property: there is no dynamics in the ancilla state. Finally, analogous constructions for two qubits extend these results from non-CP-divisible to non-P-divisible dynamics.

Magic state distillation protocols with noisy Clifford gates

NASA Astrophysics Data System (ADS)

Brooks, Peter

2013-03-01

A promising approach to universal fault-tolerant quantum computation is to implement the non-universal group of Clifford gates, and to achieve universality by adding the ability to prepare high-fidelity copies of certain ``magic states''. By applying state distillation protocols, many noisy copies of a magic state ancilla can be purified into a smaller number of clean copies which are arbitrarily close to the perfect state, using only Clifford operations. In practice, the Clifford gates themselves will be noisy, which can limit the efficiency of state distillation and put a floor on the achievable fidelity with the desired state. Recently, a number of new state distillation protocols have been proposed that have the potential to reduce the required resource overhead. I analyze these protocols and explore the tradeoffs between these different approaches to magic state distillation when noisy Clifford gates are taken into account. Supported in part by IARPA under contract D11PC20165, by NSF under Grant No. PHY-0803371, by DOE under Grant No. DE-FG03-92-ER40701, and by NSA/ARO under Grant No. W911NF-09-1-0442.

Directly Measuring the Degree of Quantum Coherence using Interference Fringes

NASA Astrophysics Data System (ADS)

Wang, Yi-Tao; Tang, Jian-Shun; Wei, Zhi-Yuan; Yu, Shang; Ke, Zhi-Jin; Xu, Xiao-Ye; Li, Chuan-Feng; Guo, Guang-Can

2017-01-01

Quantum coherence is the most distinguished feature of quantum mechanics. It lies at the heart of the quantum-information technologies as the fundamental resource and is also related to other quantum resources, including entanglement. It plays a critical role in various fields, even in biology. Nevertheless, the rigorous and systematic resource-theoretic framework of coherence has just been developed recently, and several coherence measures are proposed. Experimentally, the usual method to measure coherence is to perform state tomography and use mathematical expressions. Here, we alternatively develop a method to measure coherence directly using its most essential behavior—the interference fringes. The ancilla states are mixed into the target state with various ratios, and the minimal ratio that makes the interference fringes of the "mixed state" vanish is taken as the quantity of coherence. We also use the witness observable to witness coherence, and the optimal witness constitutes another direct method to measure coherence. For comparison, we perform tomography and calculate l1 norm of coherence, which coincides with the results of the other two methods in our situation. Our methods are explicit and robust, providing a nice alternative to the tomographic technique.

Directly Measuring the Degree of Quantum Coherence using Interference Fringes.

PubMed

Wang, Yi-Tao; Tang, Jian-Shun; Wei, Zhi-Yuan; Yu, Shang; Ke, Zhi-Jin; Xu, Xiao-Ye; Li, Chuan-Feng; Guo, Guang-Can

2017-01-13

Quantum coherence is the most distinguished feature of quantum mechanics. It lies at the heart of the quantum-information technologies as the fundamental resource and is also related to other quantum resources, including entanglement. It plays a critical role in various fields, even in biology. Nevertheless, the rigorous and systematic resource-theoretic framework of coherence has just been developed recently, and several coherence measures are proposed. Experimentally, the usual method to measure coherence is to perform state tomography and use mathematical expressions. Here, we alternatively develop a method to measure coherence directly using its most essential behavior-the interference fringes. The ancilla states are mixed into the target state with various ratios, and the minimal ratio that makes the interference fringes of the "mixed state" vanish is taken as the quantity of coherence. We also use the witness observable to witness coherence, and the optimal witness constitutes another direct method to measure coherence. For comparison, we perform tomography and calculate l_{1} norm of coherence, which coincides with the results of the other two methods in our situation. Our methods are explicit and robust, providing a nice alternative to the tomographic technique.

On-Chip Single-Plasmon Nanocircuit Driven by a Self-Assembled Quantum Dot.

PubMed

Wu, Xiaofei; Jiang, Ping; Razinskas, Gary; Huo, Yongheng; Zhang, Hongyi; Kamp, Martin; Rastelli, Armando; Schmidt, Oliver G; Hecht, Bert; Lindfors, Klas; Lippitz, Markus

2017-07-12

Quantum photonics holds great promise for future technologies such as secure communication, quantum computation, quantum simulation, and quantum metrology. An outstanding challenge for quantum photonics is to develop scalable miniature circuits that integrate single-photon sources, linear optical components, and detectors on a chip. Plasmonic nanocircuits will play essential roles in such developments. However, for quantum plasmonic circuits, integration of stable, bright, and narrow-band single photon sources in the structure has so far not been reported. Here we present a plasmonic nanocircuit driven by a self-assembled GaAs quantum dot. Through a planar dielectric-plasmonic hybrid waveguide, the quantum dot efficiently excites narrow-band single plasmons that are guided in a two-wire transmission line until they are converted into single photons by an optical antenna. Our work demonstrates the feasibility of fully on-chip plasmonic nanocircuits for quantum optical applications.

Empirical Performance Model-Driven Data Layout Optimization and Library Call Selection for Tensor Contraction Expressions

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lu, Qingda; Gao, Xiaoyang; Krishnamoorthy, Sriram

Empirical optimizers like ATLAS have been very effective in optimizing computational kernels in libraries. The best choice of parameters such as tile size and degree of loop unrolling is determined by executing different versions of the computation. In contrast, optimizing compilers use a model-driven approach to program transformation. While the model-driven approach of optimizing compilers is generally orders of magnitude faster than ATLAS-like library generators, its effectiveness can be limited by the accuracy of the performance models used. In this paper, we describe an approach where a class of computations is modeled in terms of constituent operations that are empiricallymore » measured, thereby allowing modeling of the overall execution time. The performance model with empirically determined cost components is used to perform data layout optimization together with the selection of library calls and layout transformations in the context of the Tensor Contraction Engine, a compiler for a high-level domain-specific language for expressing computational models in quantum chemistry. The effectiveness of the approach is demonstrated through experimental measurements on representative computations from quantum chemistry.« less

Consistency of the adiabatic theorem.

PubMed

Amin, M H S

2009-06-05

The adiabatic theorem provides the basis for the adiabatic model of quantum computation. Recently the conditions required for the adiabatic theorem to hold have become a subject of some controversy. Here we show that the reported violations of the adiabatic theorem all arise from resonant transitions between energy levels. In the absence of fast driven oscillations the traditional adiabatic theorem holds. Implications for adiabatic quantum computation are discussed.

Weak measurement combined with quantum delayed-choice experiment and implementation in optomechanical system

NASA Astrophysics Data System (ADS)

Li, Gang; Wang, Tao; Ye, Ming-Yong; Song, He-Shan

2015-12-01

Weak measurement [Y. Aharonov, D.Z. Albert, L. Vaidman, Phys. Rev. Lett. 60, 1351 (1988); C. Simon, E.S. Polzik, Phys. Rev. A 83, 040101(R) (2011)] combined with quantum delayed-choice experiment that use Controlled Hadamard gate instead of Hadamard gate in quantum networks give rise to a surprising amplification effect, i.e., counterintuitive negative amplification effect. We show that this effect is caused by the wave and particle behaviours of the system, and it can't be explained by a semiclassical wave theory [D. Suter, Phys. Rev. A 51, 45 (1995); J.C. Howell, D.J. Starling, P.B. Dixon, P.K. Vudyasetu, A.N. Jordan, Phys. Rev. A 81, 033813 (2010); N. Brunner, A. Acín, D. Collins, N. Gisin, V. Scarani, Phys. Rev. Lett. 91, 180402 (2003)] and by the statistical feature of preselection and postselection with disturbance [C. Ferrie, J. Combes, Phys. Rev. Lett. 113, 120404 (2014)], due to the entanglement of the system and the ancilla in Controlled Hadamard gate. The generation mechanism with wave-particle duality in quantum mechanics lead us to a scheme for implementation of weak measurement in optomechanical system.

Optically Driven Spin Based Quantum Dots for Quantum Computing - Research Area 6 Physics 6.3.2

DTIC Science & Technology

2015-12-15

quantum dots (SAQD) in Schottky diodes . Based on spins in these dots, a scalable architecture has been proposed [Adv. in Physics, 59, 703 (2010)] by us...housed in two coupled quantum dots with tunneling between them, as described above, may not be scalable but can serve as a node in a quantum network. The... tunneling -coupled two-electron spin ground states in the vertically coupled quantum dots for “universal computation” two spin qubits within the universe of

Coherent Oscillations inside a Quantum Manifold Stabilized by Dissipation

NASA Astrophysics Data System (ADS)

Touzard, S.; Grimm, A.; Leghtas, Z.; Mundhada, S. O.; Reinhold, P.; Axline, C.; Reagor, M.; Chou, K.; Blumoff, J.; Sliwa, K. M.; Shankar, S.; Frunzio, L.; Schoelkopf, R. J.; Mirrahimi, M.; Devoret, M. H.

2018-04-01

Manipulating the state of a logical quantum bit (qubit) usually comes at the expense of exposing it to decoherence. Fault-tolerant quantum computing tackles this problem by manipulating quantum information within a stable manifold of a larger Hilbert space, whose symmetries restrict the number of independent errors. The remaining errors do not affect the quantum computation and are correctable after the fact. Here we implement the autonomous stabilization of an encoding manifold spanned by Schrödinger cat states in a superconducting cavity. We show Zeno-driven coherent oscillations between these states analogous to the Rabi rotation of a qubit protected against phase flips. Such gates are compatible with quantum error correction and hence are crucial for fault-tolerant logical qubits.

Gaussian ancillary bombardment

NASA Astrophysics Data System (ADS)

Grimmer, Daniel; Brown, Eric; Kempf, Achim; Mann, Robert B.; Martín-Martínez, Eduardo

2018-05-01

We analyze in full detail the time evolution of an open Gaussian quantum system rapidly bombarded by Gaussian ancillae. As a particular case this analysis covers the thermalization (or not) of a harmonic oscillator coupled to a thermal reservoir made of harmonic oscillators. We derive general results for this scenario and apply them to the problem of thermalization. We show that only a particular family of system-environment couplings will cause the system to thermalize to the temperature of its environment. We discuss that if we want to understand thermalization as ensuing from the Markovian interaction of a system with the individual microconstituents of its (thermal) environment then the process of thermalization is not as robust as one might expect.

Simulation of quantum dynamics based on the quantum stochastic differential equation.

PubMed

Li, Ming

2013-01-01

The quantum stochastic differential equation derived from the Lindblad form quantum master equation is investigated. The general formulation in terms of environment operators representing the quantum state diffusion is given. The numerical simulation algorithm of stochastic process of direct photodetection of a driven two-level system for the predictions of the dynamical behavior is proposed. The effectiveness and superiority of the algorithm are verified by the performance analysis of the accuracy and the computational cost in comparison with the classical Runge-Kutta algorithm.

High-performance computing with quantum processing units

DOE PAGES

Britt, Keith A.; Oak Ridge National Lab.; Humble, Travis S.; ...

2017-03-01

The prospects of quantum computing have driven efforts to realize fully functional quantum processing units (QPUs). Recent success in developing proof-of-principle QPUs has prompted the question of how to integrate these emerging processors into modern high-performance computing (HPC) systems. We examine how QPUs can be integrated into current and future HPC system architectures by accounting for func- tional and physical design requirements. We identify two integration pathways that are differentiated by infrastructure constraints on the QPU and the use cases expected for the HPC system. This includes a tight integration that assumes infrastructure bottlenecks can be overcome as well asmore » a loose integration that as- sumes they cannot. We find that the performance of both approaches is likely to depend on the quantum interconnect that serves to entangle multiple QPUs. As a result, we also identify several challenges in assessing QPU performance for HPC, and we consider new metrics that capture the interplay between system architecture and the quantum parallelism underlying computational performance.« less

High-performance computing with quantum processing units

DOE Office of Scientific and Technical Information (OSTI.GOV)

Britt, Keith A.; Oak Ridge National Lab.; Humble, Travis S.

The prospects of quantum computing have driven efforts to realize fully functional quantum processing units (QPUs). Recent success in developing proof-of-principle QPUs has prompted the question of how to integrate these emerging processors into modern high-performance computing (HPC) systems. We examine how QPUs can be integrated into current and future HPC system architectures by accounting for func- tional and physical design requirements. We identify two integration pathways that are differentiated by infrastructure constraints on the QPU and the use cases expected for the HPC system. This includes a tight integration that assumes infrastructure bottlenecks can be overcome as well asmore » a loose integration that as- sumes they cannot. We find that the performance of both approaches is likely to depend on the quantum interconnect that serves to entangle multiple QPUs. As a result, we also identify several challenges in assessing QPU performance for HPC, and we consider new metrics that capture the interplay between system architecture and the quantum parallelism underlying computational performance.« less

Stochastic-master-equation analysis of optimized three-qubit nondemolition parity measurements

NASA Astrophysics Data System (ADS)

Tornberg, L.; Barzanjeh, Sh.; DiVincenzo, David P.

2014-03-01

We analyzea direct parity measurement of the state of three superconducting qubits in circuit quantum electrodynamics. The parity is inferred from a homodyne measurement of the reflected and transmitted microwave radiation, and the measurement is direct in the sense that the parity is measured without the need for any quantum circuit operations or for ancilla qubits. Qubits are coupled to two resonant-cavity modes, allowing the steady state of the emitted radiation to satisfy the necessary conditions to act as a pointer state for the parity. However, the transient dynamics violates these conditions, and we analyze this detrimental effect and show that it can be overcome in the limit of a weak measurement signal. Our analysis shows that, with a moderate degree of postselection, it is possible to achieve postmeasurement states with fidelity of order 95%. We believe that this type of measurement could serve as a benchmark for future error correction protocols in a scalable architecture.

Principle and experimental investigation of current-driven negative-inductance superconducting quantum interference device

NASA Astrophysics Data System (ADS)

Li, Hao; Liu, Jianshe; Zhang, Yingshan; Cai, Han; Li, Gang; Liu, Qichun; Han, Siyuan; Chen, Wei

2017-03-01

A negative-inductance superconducting quantum interference device (nSQUID) is an adiabatic superconducting logic device with high energy efficiency, and therefore a promising building block for large-scale low-power superconducting computing. However, the principle of the nSQUID is not that straightforward and an nSQUID driven by voltage is vulnerable to common mode noise. We investigate a single nSQUID driven by current instead of voltage, and clarify the principle of the adiabatic transition of the current-driven nSQUID between different states. The basic logic operations of the current-driven nSQUID with proper parameters are simulated by WRspice. The corresponding circuit is fabricated with a 100 A cm-2 Nb-based lift-off process, and the experimental results at low temperature confirm the basic logic operations as a gated buffer.

Perturbatively deformed defects in Pöschl-Teller-driven scenarios for quantum mechanics

NASA Astrophysics Data System (ADS)

Bernardini, Alex E.; da Rocha, Roldão

2016-07-01

Pöschl-Teller-driven solutions for quantum mechanical fluctuations are triggered off by single scalar field theories obtained through a systematic perturbative procedure for generating deformed defects. The analytical properties concerning the quantum fluctuations in one-dimension, zero-mode states, first- and second-excited states, and energy density profiles are all obtained from deformed topological and non-topological structures supported by real scalar fields. Results are firstly derived from an integrated λϕ4 theory, with corresponding generalizations applied to starting λχ4 and sine-Gordon theories. By focusing our calculations on structures supported by the λϕ4 theory, the outcome of our study suggests an exact quantitative correspondence to Pöschl-Teller-driven systems. Embedded into the perturbative quantum mechanics framework, such a correspondence turns into a helpful tool for computing excited states and continuous mode solutions, as well as their associated energy spectrum, for quantum fluctuations of perturbatively deformed structures. Perturbative deformations create distinct physical scenarios in the context of exactly solvable quantum systems and may also work as an analytical support for describing novel braneworld universes embedded into a 5-dimensional gravity bulk.

Energy efficient quantum machines

NASA Astrophysics Data System (ADS)

Abah, Obinna; Lutz, Eric

2017-05-01

We investigate the performance of a quantum thermal machine operating in finite time based on shortcut-to-adiabaticity techniques. We compute efficiency and power for a paradigmatic harmonic quantum Otto engine by taking the energetic cost of the shortcut driving explicitly into account. We demonstrate that shortcut-to-adiabaticity machines outperform conventional ones for fast cycles. We further derive generic upper bounds on both quantities, valid for any heat engine cycle, using the notion of quantum speed limit for driven systems. We establish that these quantum bounds are tighter than those stemming from the second law of thermodynamics.

Computational and Theoretical Investigations of Strongly Correlated Fermions in Optical Lattices

DTIC Science & Technology

2013-08-29

and two-particle spectral functions across the disorder - driven superconductor - insulator transition". 22. Invited speaker, \\Fermions in Optical...energy gaps across the disorder - driven superconductor - insulator transition", October 7, 2010, Harvard. 27. Seminar on \\Probing Quantum Phases of...Perimeter Institute, November 14, 2011. 37. Seminar on \\Single and two-particle energy gaps across the disorder - driven superconductor - insulator transition

The quantum computer game: citizen science

NASA Astrophysics Data System (ADS)

Damgaard, Sidse; Mølmer, Klaus; Sherson, Jacob

2013-05-01

Progress in the field of quantum computation is hampered by daunting technical challenges. Here we present an alternative approach to solving these by enlisting the aid of computer players around the world. We have previously examined a quantum computation architecture involving ultracold atoms in optical lattices and strongly focused tweezers of light. In The Quantum Computer Game (see http://www.scienceathome.org/), we have encapsulated the time-dependent Schrödinger equation for the problem in a graphical user interface allowing for easy user input. Players can then search the parameter space with real-time graphical feedback in a game context with a global high-score that rewards short gate times and robustness to experimental errors. The game which is still in a demo version has so far been tried by several hundred players. Extensions of the approach to other models such as Gross-Pitaevskii and Bose-Hubbard are currently under development. The game has also been incorporated into science education at high-school and university level as an alternative method for teaching quantum mechanics. Initial quantitative evaluation results are very positive. AU Ideas Center for Community Driven Research, CODER.

Exploring Do-It-Yourself Approaches in Computational Quantum Chemistry: The Pedagogical Benefits of the Classical Boys Algorithm

ERIC Educational Resources Information Center

Orsini, Gabriele

2015-01-01

The ever-increasing impact of molecular quantum calculations over chemical sciences implies a strong and urgent need for the elaboration of proper teaching strategies in university curricula. In such perspective, this paper proposes an extensive project for a student-driven, cooperative, from-scratch implementation of a general Hartree-Fock…

Scaling of the local quantum uncertainty at quantum phase transitions

NASA Astrophysics Data System (ADS)

Coulamy, I. B.; Warnes, J. H.; Sarandy, M. S.; Saguia, A.

2016-04-01

We investigate the local quantum uncertainty (LQU) between a block of L qubits and one single qubit in a composite system of n qubits driven through a quantum phase transition (QPT). A first-order QPT is analytically considered through a Hamiltonian implementation of the quantum search. In the case of second-order QPTs, we consider the transverse-field Ising chain via a numerical analysis through density matrix renormalization group. For both cases, we compute the LQU for finite-sizes as a function of L and of the coupling parameter, analyzing its pronounced behavior at the QPT.

Quantum kernel applications in medicinal chemistry.

PubMed

Huang, Lulu; Massa, Lou

2012-07-01

Progress in the quantum mechanics of biological molecules is being driven by computational advances. The notion of quantum kernels can be introduced to simplify the formalism of quantum mechanics, making it especially suitable for parallel computation of very large biological molecules. The essential idea is to mathematically break large biological molecules into smaller kernels that are calculationally tractable, and then to represent the full molecule by a summation over the kernels. The accuracy of the kernel energy method (KEM) is shown by systematic application to a great variety of molecular types found in biology. These include peptides, proteins, DNA and RNA. Examples are given that explore the KEM across a variety of chemical models, and to the outer limits of energy accuracy and molecular size. KEM represents an advance in quantum biology applicable to problems in medicine and drug design.

Spin-driven structural effects in alkali doped (4)He clusters from quantum calculations.

PubMed

Bovino, S; Coccia, E; Bodo, E; Lopez-Durán, D; Gianturco, F A

2009-06-14

In this paper, we carry out variational Monte Carlo and diffusion Monte Carlo (DMC) calculations for Li(2)((1)Sigma(g) (+))((4)He)(N) and Li(2)((3)Sigma(u) (+))((4)He)(N) with N up to 30 and discuss in detail the results of our computations. After a comparison between our DMC energies with the "exact" discrete variable representation values for the species with one (4)He, in order to test the quality of our computations at 0 K, we analyze the structural features of the whole range of doped clusters. We find that both species reside on the droplet surface, but that their orientation is spin driven, i.e., the singlet molecule is perpendicular and the triplet one is parallel to the droplet's surface. We have also computed quantum vibrational relaxation rates for both dimers in collision with a single (4)He and we find them to differ by orders of magnitude at the estimated surface temperature. Our results therefore confirm the findings from a great number of experimental data present in the current literature and provide one of the first attempts at giving an accurate, fully quantum picture for the nanoscopic properties of alkali dimers in (4)He clusters.

Nonclassical light sources for silicon photonics

NASA Astrophysics Data System (ADS)

Bajoni, Daniele; Galli, Matteo

2017-09-01

Quantum photonics has recently attracted a lot of attention for its disruptive potential in emerging technologies like quantum cryptography, quantum communication and quantum computing. Driven by the impressive development in nanofabrication technologies and nanoscale engineering, silicon photonics has rapidly become the platform of choice for on-chip integration of high performing photonic devices, now extending their functionalities towards quantum-based applications. Focusing on quantum Information Technology (qIT) as a key application area, we review recent progress in integrated silicon-based sources of nonclassical states of light. We assess the state of the art in this growing field and highlight the challenges that need to be overcome to make quantum photonics a reliable and widespread technology.

Work Measurement as a Generalized Quantum Measurement

NASA Astrophysics Data System (ADS)

Roncaglia, Augusto J.; Cerisola, Federico; Paz, Juan Pablo

2014-12-01

We present a new method to measure the work w performed on a driven quantum system and to sample its probability distribution P (w ). The method is based on a simple fact that remained unnoticed until now: Work on a quantum system can be measured by performing a generalized quantum measurement at a single time. Such measurement, which technically speaking is denoted as a positive operator valued measure reduces to an ordinary projective measurement on an enlarged system. This observation not only demystifies work measurement but also suggests a new quantum algorithm to efficiently sample the distribution P (w ). This can be used, in combination with fluctuation theorems, to estimate free energies of quantum states on a quantum computer.

Electrically driven spin qubit based on valley mixing

NASA Astrophysics Data System (ADS)

Huang, Wister; Veldhorst, Menno; Zimmerman, Neil M.; Dzurak, Andrew S.; Culcer, Dimitrie

2017-02-01

The electrical control of single spin qubits based on semiconductor quantum dots is of great interest for scalable quantum computing since electric fields provide an alternative mechanism for qubit control compared with magnetic fields and can also be easier to produce. Here we outline the mechanism for a drastic enhancement in the electrically-driven spin rotation frequency for silicon quantum dot qubits in the presence of a step at a heterointerface. The enhancement is due to the strong coupling between the ground and excited states which occurs when the electron wave function overcomes the potential barrier induced by the interface step. We theoretically calculate single qubit gate times tπ of 170 ns for a quantum dot confined at a silicon/silicon-dioxide interface. The engineering of such steps could be used to achieve fast electrical rotation and entanglement of spin qubits despite the weak spin-orbit coupling in silicon.

Partition-based discrete-time quantum walks

NASA Astrophysics Data System (ADS)

Konno, Norio; Portugal, Renato; Sato, Iwao; Segawa, Etsuo

2018-04-01

We introduce a family of discrete-time quantum walks, called two-partition model, based on two equivalence-class partitions of the computational basis, which establish the notion of local dynamics. This family encompasses most versions of unitary discrete-time quantum walks driven by two local operators studied in literature, such as the coined model, Szegedy's model, and the 2-tessellable staggered model. We also analyze the connection of those models with the two-step coined model, which is driven by the square of the evolution operator of the standard discrete-time coined walk. We prove formally that the two-step coined model, an extension of Szegedy model for multigraphs, and the two-tessellable staggered model are unitarily equivalent. Then, selecting one specific model among those families is a matter of taste not generality.

Engineering the quantum states of light in a Kerr-nonlinear resonator by two-photon driving

NASA Astrophysics Data System (ADS)

Puri, Shruti; Boutin, Samuel; Blais, Alexandre

2017-04-01

Photonic cat states stored in high-Q resonators show great promise for hardware efficient universal quantum computing. We propose an approach to efficiently prepare such cat states in a Kerr-nonlinear resonator by the use of a two-photon drive. Significantly, we show that this preparation is robust against single-photon loss. An outcome of this observation is that a two-photon drive can eliminate undesirable phase evolution induced by a Kerr nonlinearity. By exploiting the concept of transitionless quantum driving, we moreover demonstrate how non-adiabatic initialization of cat states is possible. Finally, we present a universal set of quantum logical gates that can be performed on the engineered eigenspace of such a two-photon driven resonator and discuss a possible realization using superconducting circuits. The robustness of the engineered subspace to higher-order circuit nonlinearities makes this implementation favorable for scalable quantum computation.

Hardware-efficient fermionic simulation with a cavity-QED system

NASA Astrophysics Data System (ADS)

Zhu, Guanyu; Subaşı, Yiǧit; Whitfield, James D.; Hafezi, Mohammad

2018-03-01

In digital quantum simulation of fermionic models with qubits, non-local maps for encoding are often encountered. Such maps require linear or logarithmic overhead in circuit depth which could render the simulation useless, for a given decoherence time. Here we show how one can use a cavity-QED system to perform digital quantum simulation of fermionic models. In particular, we show that highly nonlocal Jordan-Wigner or Bravyi-Kitaev transformations can be efficiently implemented through a hardware approach. The key idea is using ancilla cavity modes, which are dispersively coupled to a qubit string, to collectively manipulate and measure qubit states. Our scheme reduces the circuit depth in each Trotter step of the Jordan-Wigner encoding by a factor of N2, comparing to the scheme for a device with only local connectivity, where N is the number of orbitals for a generic two-body Hamiltonian. Additional analysis for the Fermi-Hubbard model on an N × N square lattice results in a similar reduction. We also discuss a detailed implementation of our scheme with superconducting qubits and cavities.

Floquet prethermalization and regimes of heating in a periodically driven, interacting quantum system

NASA Astrophysics Data System (ADS)

Weidinger, Simon A.; Knap, Michael

2017-04-01

We study the regimes of heating in the periodically driven O(N)-model, which is a well established model for interacting quantum many-body systems. By computing the absorbed energy with a non-equilibrium Keldysh Green’s function approach, we establish three dynamical regimes: at short times a single-particle dominated regime, at intermediate times a stable Floquet prethermal regime in which the system ceases to absorb, and at parametrically late times a thermalizing regime. Our simulations suggest that in the thermalizing regime the absorbed energy grows algebraically in time with an exponent that approaches the universal value of 1/2, and is thus significantly slower than linear Joule heating. Our results demonstrate the parametric stability of prethermal states in a many-body system driven at frequencies that are comparable to its microscopic scales. This paves the way for realizing exotic quantum phases, such as time crystals or interacting topological phases, in the prethermal regime of interacting Floquet systems.

Accuracy of the adiabatic-impulse approximation for closed and open quantum systems

NASA Astrophysics Data System (ADS)

Tomka, Michael; Campos Venuti, Lorenzo; Zanardi, Paolo

2018-03-01

We study the adiabatic-impulse approximation (AIA) as a tool to approximate the time evolution of quantum states when driven through a region of small gap. Such small-gap regions are a common situation in adiabatic quantum computing and having reliable approximations is important in this context. The AIA originates from the Kibble-Zurek theory applied to continuous quantum phase transitions. The Kibble-Zurek mechanism was developed to predict the power-law scaling of the defect density across a continuous quantum phase transition. Instead, here we quantify the accuracy of the AIA via the trace norm distance with respect to the exact evolved state. As expected, we find that for short times or fast protocols, the AIA outperforms the simple adiabatic approximation. However, for large times or slow protocols, the situation is actually reversed and the AIA provides a worse approximation. Nevertheless, we found a variation of the AIA that can perform better than the adiabatic one. This counterintuitive modification consists in crossing the region of small gap twice. Our findings are illustrated by several examples of driven closed and open quantum systems.

Electrical Control of g-Factor in a Few-Hole Silicon Nanowire MOSFET.

PubMed

Voisin, B; Maurand, R; Barraud, S; Vinet, M; Jehl, X; Sanquer, M; Renard, J; De Franceschi, S

2016-01-13

Hole spins in silicon represent a promising yet barely explored direction for solid-state quantum computation, possibly combining long spin coherence, resulting from a reduced hyperfine interaction, and fast electrically driven qubit manipulation. Here we show that a silicon-nanowire field-effect transistor based on state-of-the-art silicon-on-insulator technology can be operated as a few-hole quantum dot. A detailed magnetotransport study of the first accessible hole reveals a g-factor with unexpectedly strong anisotropy and gate dependence. We infer that these two characteristics could enable an electrically driven g-tensor-modulation spin resonance with Rabi frequencies exceeding several hundred mega-Hertz.

A Blueprint for Demonstrating Quantum Supremacy with Superconducting Qubits

NASA Technical Reports Server (NTRS)

Kechedzhi, Kostyantyn

2018-01-01

Long coherence times and high fidelity control recently achieved in scalable superconducting circuits paved the way for the growing number of experimental studies of many-qubit quantum coherent phenomena in these devices. Albeit full implementation of quantum error correction and fault tolerant quantum computation remains a challenge the near term pre-error correction devices could allow new fundamental experiments despite inevitable accumulation of errors. One such open question foundational for quantum computing is achieving the so called quantum supremacy, an experimental demonstration of a computational task that takes polynomial time on the quantum computer whereas the best classical algorithm would require exponential time and/or resources. It is possible to formulate such a task for a quantum computer consisting of less than a 100 qubits. The computational task we consider is to provide approximate samples from a non-trivial quantum distribution. This is a generalization for the case of superconducting circuits of ideas behind boson sampling protocol for quantum optics introduced by Arkhipov and Aaronson. In this presentation we discuss a proof-of-principle demonstration of such a sampling task on a 9-qubit chain of superconducting gmon qubits developed by Google. We discuss theoretical analysis of the driven evolution of the device resulting in output approximating samples from a uniform distribution in the Hilbert space, a quantum chaotic state. We analyze quantum chaotic characteristics of the output of the circuit and the time required to generate a sufficiently complex quantum distribution. We demonstrate that the classical simulation of the sampling output requires exponential resources by connecting the task of calculating the output amplitudes to the sign problem of the Quantum Monte Carlo method. We also discuss the detailed theoretical modeling required to achieve high fidelity control and calibration of the multi-qubit unitary evolution in the device. We use a novel cross-entropy statistical metric as a figure of merit to verify the output and calibrate the device controls. Finally, we demonstrate the statistics of the wave function amplitudes generated on the 9-gmon chain and verify the quantum chaotic nature of the generated quantum distribution. This verifies the implementation of the quantum supremacy protocol.

Resonantly driven CNOT gate for electron spins

NASA Astrophysics Data System (ADS)

Zajac, D. M.; Sigillito, A. J.; Russ, M.; Borjans, F.; Taylor, J. M.; Burkard, G.; Petta, J. R.

2018-01-01

To build a universal quantum computer—the kind that can handle any computational task you throw at it—an essential early step is to demonstrate the so-called CNOT gate, which acts on two qubits. Zajac et al. built an efficient CNOT gate by using electron spin qubits in silicon quantum dots, an implementation that is especially appealing because of its compatibility with existing semiconductor-based electronics (see the Perspective by Schreiber and Bluhm). To showcase the potential, the authors used the gate to create an entangled quantum state called the Bell state.

Implementation of a three-qubit refined Deutsch Jozsa algorithm using SFG quantum logic gates

NASA Astrophysics Data System (ADS)

DelDuce, A.; Savory, S.; Bayvel, P.

2006-05-01

In this paper we present a quantum logic circuit which can be used for the experimental demonstration of a three-qubit solid state quantum computer based on a recent proposal of optically driven quantum logic gates. In these gates, the entanglement of randomly placed electron spin qubits is manipulated by optical excitation of control electrons. The circuit we describe solves the Deutsch problem with an improved algorithm called the refined Deutsch-Jozsa algorithm. We show that it is possible to select optical pulses that solve the Deutsch problem correctly, and do so without losing quantum information to the control electrons, even though the gate parameters vary substantially from one gate to another.

Quantum ensembles of quantum classifiers.

PubMed

Schuld, Maria; Petruccione, Francesco

2018-02-09

Quantum machine learning witnesses an increasing amount of quantum algorithms for data-driven decision making, a problem with potential applications ranging from automated image recognition to medical diagnosis. Many of those algorithms are implementations of quantum classifiers, or models for the classification of data inputs with a quantum computer. Following the success of collective decision making with ensembles in classical machine learning, this paper introduces the concept of quantum ensembles of quantum classifiers. Creating the ensemble corresponds to a state preparation routine, after which the quantum classifiers are evaluated in parallel and their combined decision is accessed by a single-qubit measurement. This framework naturally allows for exponentially large ensembles in which - similar to Bayesian learning - the individual classifiers do not have to be trained. As an example, we analyse an exponentially large quantum ensemble in which each classifier is weighed according to its performance in classifying the training data, leading to new results for quantum as well as classical machine learning.

Simulating and assessing boson sampling experiments with phase-space representations

NASA Astrophysics Data System (ADS)

Opanchuk, Bogdan; Rosales-Zárate, Laura; Reid, Margaret D.; Drummond, Peter D.

2018-04-01

The search for new, application-specific quantum computers designed to outperform any classical computer is driven by the ending of Moore's law and the quantum advantages potentially obtainable. Photonic networks are promising examples, with experimental demonstrations and potential for obtaining a quantum computer to solve problems believed classically impossible. This introduces a challenge: how does one design or understand such photonic networks? One must be able to calculate observables using general methods capable of treating arbitrary inputs, dissipation, and noise. We develop complex phase-space software for simulating these photonic networks, and apply this to boson sampling experiments. Our techniques give sampling errors orders of magnitude lower than experimental correlation measurements for the same number of samples. We show that these techniques remove systematic errors in previous algorithms for estimating correlations, with large improvements in errors in some cases. In addition, we obtain a scalable channel-combination strategy for assessment of boson sampling devices.

Quantum Memristors with Superconducting Circuits

PubMed Central

Salmilehto, J.; Deppe, F.; Di Ventra, M.; Sanz, M.; Solano, E.

2017-01-01

Memristors are resistive elements retaining information of their past dynamics. They have garnered substantial interest due to their potential for representing a paradigm change in electronics, information processing and unconventional computing. Given the advent of quantum technologies, a design for a quantum memristor with superconducting circuits may be envisaged. Along these lines, we introduce such a quantum device whose memristive behavior arises from quasiparticle-induced tunneling when supercurrents are cancelled. For realistic parameters, we find that the relevant hysteretic behavior may be observed using current state-of-the-art measurements of the phase-driven tunneling current. Finally, we develop suitable methods to quantify memory retention in the system. PMID:28195193

Entanglement and nonclassicality for multimode radiation-field states

NASA Astrophysics Data System (ADS)

Ivan, J. Solomon; Chaturvedi, S.; Ercolessi, E.; Marmo, G.; Morandi, G.; Mukunda, N.; Simon, R.

2011-03-01

Nonclassicality in the sense of quantum optics is a prerequisite for entanglement in multimode radiation states. In this work we bring out the possibilities of passing from the former to the latter, via action of classicality preserving systems like beam splitters, in a transparent manner. For single-mode states, a complete description of nonclassicality is available via the classical theory of moments, as a set of necessary and sufficient conditions on the photon number distribution. We show that when the mode is coupled to an ancilla in any coherent state, and the system is then acted upon by a beam splitter, these conditions turn exactly into signatures of negativity under partial transpose (NPT) entanglement of the output state. Since the classical moment problem does not generalize to two or more modes, we turn in these cases to other familiar sufficient but not necessary conditions for nonclassicality, namely the Mandel parameter criterion and its extensions. We generalize the Mandel matrix from one-mode states to the two-mode situation, leading to a natural classification of states with varying levels of nonclassicality. For two-mode states we present a single test that can, if successful, simultaneously show nonclassicality as well as NPT entanglement. We also develop a test for NPT entanglement after beam-splitter action on a nonclassical state, tracing carefully the way in which it goes beyond the Mandel nonclassicality test. The result of three-mode beam-splitter action after coupling to an ancilla in the ground state is treated in the same spirit. The concept of genuine tripartite entanglement, and scalar measures of nonclassicality at the Mandel level for two-mode systems, are discussed. Numerous examples illustrating all these concepts are presented.

Resonantly driven CNOT gate for electron spins.

PubMed

Zajac, D M; Sigillito, A J; Russ, M; Borjans, F; Taylor, J M; Burkard, G; Petta, J R

2018-01-26

Single-qubit rotations and two-qubit CNOT operations are crucial ingredients for universal quantum computing. Although high-fidelity single-qubit operations have been achieved using the electron spin degree of freedom, realizing a robust CNOT gate has been challenging because of rapid nuclear spin dephasing and charge noise. We demonstrate an efficient resonantly driven CNOT gate for electron spins in silicon. Our platform achieves single-qubit rotations with fidelities greater than 99%, as verified by randomized benchmarking. Gate control of the exchange coupling allows a quantum CNOT gate to be implemented with resonant driving in ~200 nanoseconds. We used the CNOT gate to generate a Bell state with 78% fidelity (corrected for errors in state preparation and measurement). Our quantum dot device architecture enables multi-qubit algorithms in silicon. Copyright © 2018, The Authors, some rights reserved; exclusive licensee American Association for the Advancement of Science. No claim to original U.S. Government Works.

Sulfate radical oxidation of aromatic contaminants: a detailed assessment of density functional theory and high-level quantum chemical methods.

PubMed

Pari, Sangavi; Wang, Inger A; Liu, Haizhou; Wong, Bryan M

2017-03-22

Advanced oxidation processes that utilize highly oxidative radicals are widely used in water reuse treatment. In recent years, the application of sulfate radical (SO 4 ˙ - ) as a promising oxidant for water treatment has gained increasing attention. To understand the efficiency of SO 4 ˙ - in the degradation of organic contaminants in wastewater effluent, it is important to be able to predict the reaction kinetics of various SO 4 ˙ - -driven oxidation reactions. In this study, we utilize density functional theory (DFT) and high-level wavefunction-based methods (including computationally-intensive coupled cluster methods), to explore the activation energies of SO 4 ˙ - -driven oxidation reactions on a series of benzene-derived contaminants. These high-level calculations encompass a wide set of reactions including 110 forward/reverse reactions and 5 different computational methods in total. Based on the high-level coupled-cluster quantum calculations, we find that the popular M06-2X DFT functional is significantly more accurate for OH - additions than for SO 4 ˙ - reactions. Most importantly, we highlight some of the limitations and deficiencies of other computational methods, and we recommend the use of high-level quantum calculations to spot-check environmental chemistry reactions that may lie outside the training set of the M06-2X functional, particularly for water oxidation reactions that involve SO 4 ˙ - and other inorganic species.

Quantum Memristors with Superconducting Circuits

DOE PAGES

Salmilehto, J.; Deppe, F.; Di Ventra, M.; ...

2017-02-14

Memristors are resistive elements retaining information of their past dynamics. They have garnered substantial interest due to their potential for representing a paradigm change in electronics, information processing and unconventional computing. Given the advent of quantum technologies, a design for a quantum memristor with superconducting circuits may be envisaged. Along these lines, we introduce such a quantum device whose memristive behavior arises from quasiparticle-induced tunneling when supercurrents are cancelled. Here in this paper, for realistic parameters, we find that the relevant hysteretic behavior may be observed using current state-of-the-art measurements of the phase-driven tunneling current. Finally, we develop suitable methodsmore » to quantify memory retention in the system.« less

Electric-field-driven electron-transfer in mixed-valence molecules.

PubMed

Blair, Enrique P; Corcelli, Steven A; Lent, Craig S

2016-07-07

Molecular quantum-dot cellular automata is a computing paradigm in which digital information is encoded by the charge configuration of a mixed-valence molecule. General-purpose computing can be achieved by arranging these compounds on a substrate and exploiting intermolecular Coulombic coupling. The operation of such a device relies on nonequilibrium electron transfer (ET), whereby the time-varying electric field of one molecule induces an ET event in a neighboring molecule. The magnitude of the electric fields can be quite large because of close spatial proximity, and the induced ET rate is a measure of the nonequilibrium response of the molecule. We calculate the electric-field-driven ET rate for a model mixed-valence compound. The mixed-valence molecule is regarded as a two-state electronic system coupled to a molecular vibrational mode, which is, in turn, coupled to a thermal environment. Both the electronic and vibrational degrees-of-freedom are treated quantum mechanically, and the dissipative vibrational-bath interaction is modeled with the Lindblad equation. This approach captures both tunneling and nonadiabatic dynamics. Relationships between microscopic molecular properties and the driven ET rate are explored for two time-dependent applied fields: an abruptly switched field and a linearly ramped field. In both cases, the driven ET rate is only weakly temperature dependent. When the model is applied using parameters appropriate to a specific mixed-valence molecule, diferrocenylacetylene, terahertz-range ET transfer rates are predicted.

Quantum annealing with parametrically driven nonlinear oscillators

NASA Astrophysics Data System (ADS)

Puri, Shruti

While progress has been made towards building Ising machines to solve hard combinatorial optimization problems, quantum speedups have so far been elusive. Furthermore, protecting annealers against decoherence and achieving long-range connectivity remain important outstanding challenges. With the hope of overcoming these challenges, I introduce a new paradigm for quantum annealing that relies on continuous variable states. Unlike the more conventional approach based on two-level systems, in this approach, quantum information is encoded in two coherent states that are stabilized by parametrically driving a nonlinear resonator. I will show that a fully connected Ising problem can be mapped onto a network of such resonators, and outline an annealing protocol based on adiabatic quantum computing. During the protocol, the resonators in the network evolve from vacuum to coherent states representing the ground state configuration of the encoded problem. In short, the system evolves between two classical states following non-classical dynamics. As will be supported by numerical results, this new annealing paradigm leads to superior noise resilience. Finally, I will discuss a realistic circuit QED realization of an all-to-all connected network of parametrically driven nonlinear resonators. The continuous variable nature of the states in the large Hilbert space of the resonator provides new opportunities for exploring quantum phase transitions and non-stoquastic dynamics during the annealing schedule.

A silicon-nanowire memory driven by optical gradient force induced bistability

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dong, B.; Institute of Microelectronics, A*STAR; Cai, H., E-mail: caih@ime.a-star.edu.sg

2015-12-28

In this paper, a bistable optical-driven silicon-nanowire memory is demonstrated, which employs ring resonator to generate optical gradient force over a doubly clamped silicon-nanowire. Two stable deformation positions of a doubly clamped silicon-nanowire represent two memory states (“0” and “1”) and can be set/reset by modulating the light intensity (<3 mW) based on the optical force induced bistability. The time response of the optical-driven memory is less than 250 ns. It has applications in the fields of all optical communication, quantum computing, and optomechanical circuits.

Improving the efficiency of the Finite Temperature Density Matrix Renormalization Group method

NASA Astrophysics Data System (ADS)

Nocera, Alberto; Alvarez, Gonzalo

I review the basics of the finite temperature DMRG method, and then show how its efficiency can be improved by working on reduced Hilbert spaces and by using canonical approaches. My talk explains the applicability of the ancilla DMRG method beyond spins systems to t-J and Hubbard models, and addresses the computation of static and dynamical observables at finite temperature. Finally, I discuss the features of and roadmap for our DMRG + + codebase. Work done at CNMS, sponsored by the SUF Division, BES, U.S. DOE under contract with UT-Battelle. Support by the early career research program, DSUF, BES, DOE.

Floquet prethermalization and regimes of heating in a periodically driven, interacting quantum system

NASA Astrophysics Data System (ADS)

Weidinger, Simon; Knap, Michael

We study the regimes of heating in the periodically driven O (N) -model, which represents a generic model for interacting quantum many-body systems. By computing the absorbed energy with a non-equilibrium Keldysh Green's function approach, we establish three dynamical regimes: at short times a single-particle dominated regime, at intermediate times a stable Floquet prethermal regime in which the system ceases to absorb, and at parametrically late times a thermalizing regime. Our simulations suggest that in the thermalizing regime the absorbed energy grows algebraically in time with an the exponent that approaches the universal value of 1 / 2 , and is thus significantly slower than linear Joule heating. Our results demonstrate the parametric stability of prethermal states in a generic many-body system driven at frequencies that are comparable to its microscopic scales. This paves the way for realizing exotic quantum phases, such as time crystals or interacting topological phases, in the prethermal regime of interacting Floquet systems. We acknowledge support from the Technical University of Munich - Institute for Advanced Study, funded by the German Excellence Initiative and the European Union FP7 under Grant agreement 291763, and from the DFG Grant No. KN 1254/1-1.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Salmilehto, J.; Deppe, F.; Di Ventra, M.

Memristors are resistive elements retaining information of their past dynamics. They have garnered substantial interest due to their potential for representing a paradigm change in electronics, information processing and unconventional computing. Given the advent of quantum technologies, a design for a quantum memristor with superconducting circuits may be envisaged. Along these lines, we introduce such a quantum device whose memristive behavior arises from quasiparticle-induced tunneling when supercurrents are cancelled. Here in this paper, for realistic parameters, we find that the relevant hysteretic behavior may be observed using current state-of-the-art measurements of the phase-driven tunneling current. Finally, we develop suitable methodsmore » to quantify memory retention in the system.« less

Fluctuating hydrodynamics, current fluctuations, and hyperuniformity in boundary-driven open quantum chains

NASA Astrophysics Data System (ADS)

Carollo, Federico; Garrahan, Juan P.; Lesanovsky, Igor; Pérez-Espigares, Carlos

2017-11-01

We consider a class of either fermionic or bosonic noninteracting open quantum chains driven by dissipative interactions at the boundaries and study the interplay of coherent transport and dissipative processes, such as bulk dephasing and diffusion. Starting from the microscopic formulation, we show that the dynamics on large scales can be described in terms of fluctuating hydrodynamics. This is an important simplification as it allows us to apply the methods of macroscopic fluctuation theory to compute the large deviation (LD) statistics of time-integrated currents. In particular, this permits us to show that fermionic open chains display a third-order dynamical phase transition in LD functions. We show that this transition is manifested in a singular change in the structure of trajectories: while typical trajectories are diffusive, rare trajectories associated with atypical currents are ballistic and hyperuniform in their spatial structure. We confirm these results by numerically simulating ensembles of rare trajectories via the cloning method, and by exact numerical diagonalization of the microscopic quantum generator.

Fluctuating hydrodynamics, current fluctuations, and hyperuniformity in boundary-driven open quantum chains.

PubMed

Carollo, Federico; Garrahan, Juan P; Lesanovsky, Igor; Pérez-Espigares, Carlos

2017-11-01

We consider a class of either fermionic or bosonic noninteracting open quantum chains driven by dissipative interactions at the boundaries and study the interplay of coherent transport and dissipative processes, such as bulk dephasing and diffusion. Starting from the microscopic formulation, we show that the dynamics on large scales can be described in terms of fluctuating hydrodynamics. This is an important simplification as it allows us to apply the methods of macroscopic fluctuation theory to compute the large deviation (LD) statistics of time-integrated currents. In particular, this permits us to show that fermionic open chains display a third-order dynamical phase transition in LD functions. We show that this transition is manifested in a singular change in the structure of trajectories: while typical trajectories are diffusive, rare trajectories associated with atypical currents are ballistic and hyperuniform in their spatial structure. We confirm these results by numerically simulating ensembles of rare trajectories via the cloning method, and by exact numerical diagonalization of the microscopic quantum generator.

Quantum correlations and limit cycles in the driven-dissipative Heisenberg lattice

NASA Astrophysics Data System (ADS)

Owen, E. T.; Jin, J.; Rossini, D.; Fazio, R.; Hartmann, M. J.

2018-04-01

Driven-dissipative quantum many-body systems have attracted increasing interest in recent years as they lead to novel classes of quantum many-body phenomena. In particular, mean-field calculations predict limit cycle phases, slow oscillations instead of stationary states, in the long-time limit for a number of driven-dissipative quantum many-body systems. Using a cluster mean-field and a self-consistent Mori projector approach, we explore the persistence of such limit cycles as short range quantum correlations are taken into account in a driven-dissipative Heisenberg model.

Quantum transport in the FMO photosynthetic light-harvesting complex.

PubMed

Karafyllidis, Ioannis G

2017-06-01

The very high light-harvesting efficiency of natural photosynthetic systems in conjunction with recent experiments, which showed quantum-coherent energy transfer in photosynthetic complexes, raised questions regarding the presence of non-trivial quantum effects in photosynthesis. Grover quantum search, quantum walks, and entanglement have been investigated as possible effects that lead to this efficiency. Here we explain the near-unit photosynthetic efficiency without invoking non-trivial quantum effects. Instead, we use non-equilibrium Green's functions, a mesoscopic method used to study transport in nano-conductors to compute the transmission function of the Fenna-Matthews-Olson (FMO) complex using an experimentally derived exciton Hamiltonian. The chlorosome antenna and the reaction center play the role of input and output contacts, connected to the FMO complex. We show that there are two channels for which the transmission is almost unity. Our analysis also revealed a dephasing-driven regulation mechanism that maintains the efficiency in the presence of varying dephasing potentials.

Plasmonic resonances of nanoparticles from large-scale quantum mechanical simulations

NASA Astrophysics Data System (ADS)

Zhang, Xu; Xiang, Hongping; Zhang, Mingliang; Lu, Gang

2017-09-01

Plasmonic resonance of metallic nanoparticles results from coherent motion of its conduction electrons, driven by incident light. For the nanoparticles less than 10 nm in diameter, localized surface plasmonic resonances become sensitive to the quantum nature of the conduction electrons. Unfortunately, quantum mechanical simulations based on time-dependent Kohn-Sham density functional theory are computationally too expensive to tackle metal particles larger than 2 nm. Herein, we introduce the recently developed time-dependent orbital-free density functional theory (TD-OFDFT) approach which enables large-scale quantum mechanical simulations of plasmonic responses of metallic nanostructures. Using TD-OFDFT, we have performed quantum mechanical simulations to understand size-dependent plasmonic response of Na nanoparticles and plasmonic responses in Na nanoparticle dimers and trimers. An outlook of future development of the TD-OFDFT method is also presented.

Electric-field-driven electron-transfer in mixed-valence molecules

DOE Office of Scientific and Technical Information (OSTI.GOV)

Blair, Enrique P., E-mail: enrique-blair@baylor.edu; Corcelli, Steven A., E-mail: scorcell@nd.edu; Lent, Craig S., E-mail: lent@nd.edu

2016-07-07

Molecular quantum-dot cellular automata is a computing paradigm in which digital information is encoded by the charge configuration of a mixed-valence molecule. General-purpose computing can be achieved by arranging these compounds on a substrate and exploiting intermolecular Coulombic coupling. The operation of such a device relies on nonequilibrium electron transfer (ET), whereby the time-varying electric field of one molecule induces an ET event in a neighboring molecule. The magnitude of the electric fields can be quite large because of close spatial proximity, and the induced ET rate is a measure of the nonequilibrium response of the molecule. We calculate themore » electric-field-driven ET rate for a model mixed-valence compound. The mixed-valence molecule is regarded as a two-state electronic system coupled to a molecular vibrational mode, which is, in turn, coupled to a thermal environment. Both the electronic and vibrational degrees-of-freedom are treated quantum mechanically, and the dissipative vibrational-bath interaction is modeled with the Lindblad equation. This approach captures both tunneling and nonadiabatic dynamics. Relationships between microscopic molecular properties and the driven ET rate are explored for two time-dependent applied fields: an abruptly switched field and a linearly ramped field. In both cases, the driven ET rate is only weakly temperature dependent. When the model is applied using parameters appropriate to a specific mixed-valence molecule, diferrocenylacetylene, terahertz-range ET transfer rates are predicted.« less

Optically Driven Spin Based Quantum Dots for Quantum Computing

DTIC Science & Technology

2008-01-01

time . Figure 3. Demonstration of optical pumping. This shows the absorption as a function of bias voltage and laser energy. In region...319,076 319,079 0 2 0 2 0 2 0 2 0 2 R el at iv e ab so rp tio n (× 1 0– 4 ) Probe frequency (GHz) Time constant (ms) 1 1 3 10 30 c Figure 1 | Laser ...spectrum of the forward (or backward) scan. c, The probe absorption spectrum as a function of the laser scan rate, indicated by the lock-in time

Computation of the asymptotic states of modulated open quantum systems with a numerically exact realization of the quantum trajectory method

NASA Astrophysics Data System (ADS)

Volokitin, V.; Liniov, A.; Meyerov, I.; Hartmann, M.; Ivanchenko, M.; Hänggi, P.; Denisov, S.

2017-11-01

Quantum systems out of equilibrium are presently a subject of active research, both in theoretical and experimental domains. In this work, we consider time-periodically modulated quantum systems that are in contact with a stationary environment. Within the framework of a quantum master equation, the asymptotic states of such systems are described by time-periodic density operators. Resolution of these operators constitutes a nontrivial computational task. Approaches based on spectral and iterative methods are restricted to systems with the dimension of the hosting Hilbert space dim H =N ≲300 , while the direct long-time numerical integration of the master equation becomes increasingly problematic for N ≳400 , especially when the coupling to the environment is weak. To go beyond this limit, we use the quantum trajectory method, which unravels the master equation for the density operator into a set of stochastic processes for wave functions. The asymptotic density matrix is calculated by performing a statistical sampling over the ensemble of quantum trajectories, preceded by a long transient propagation. We follow the ideology of event-driven programming and construct a new algorithmic realization of the method. The algorithm is computationally efficient, allowing for long "leaps" forward in time. It is also numerically exact, in the sense that, being given the list of uniformly distributed (on the unit interval) random numbers, {η1,η2,...,ηn} , one could propagate a quantum trajectory (with ηi's as norm thresholds) in a numerically exact way. By using a scalable N -particle quantum model, we demonstrate that the algorithm allows us to resolve the asymptotic density operator of the model system with N =2000 states on a regular-size computer cluster, thus reaching the scale on which numerical studies of modulated Hamiltonian systems are currently performed.

Computation of the asymptotic states of modulated open quantum systems with a numerically exact realization of the quantum trajectory method.

PubMed

Volokitin, V; Liniov, A; Meyerov, I; Hartmann, M; Ivanchenko, M; Hänggi, P; Denisov, S

2017-11-01

Quantum systems out of equilibrium are presently a subject of active research, both in theoretical and experimental domains. In this work, we consider time-periodically modulated quantum systems that are in contact with a stationary environment. Within the framework of a quantum master equation, the asymptotic states of such systems are described by time-periodic density operators. Resolution of these operators constitutes a nontrivial computational task. Approaches based on spectral and iterative methods are restricted to systems with the dimension of the hosting Hilbert space dimH=N≲300, while the direct long-time numerical integration of the master equation becomes increasingly problematic for N≳400, especially when the coupling to the environment is weak. To go beyond this limit, we use the quantum trajectory method, which unravels the master equation for the density operator into a set of stochastic processes for wave functions. The asymptotic density matrix is calculated by performing a statistical sampling over the ensemble of quantum trajectories, preceded by a long transient propagation. We follow the ideology of event-driven programming and construct a new algorithmic realization of the method. The algorithm is computationally efficient, allowing for long "leaps" forward in time. It is also numerically exact, in the sense that, being given the list of uniformly distributed (on the unit interval) random numbers, {η_{1},η_{2},...,η_{n}}, one could propagate a quantum trajectory (with η_{i}'s as norm thresholds) in a numerically exact way. By using a scalable N-particle quantum model, we demonstrate that the algorithm allows us to resolve the asymptotic density operator of the model system with N=2000 states on a regular-size computer cluster, thus reaching the scale on which numerical studies of modulated Hamiltonian systems are currently performed.

Trade-off between speed and cost in shortcuts to adiabaticity

NASA Astrophysics Data System (ADS)

Campbell, Steve

Recent years have witnessed a surge of interest in the study of thermal nano-machines that are capable of converting disordered forms of energy into useful work. It has been shown for both classical and quantum systems that external drivings can allow a system to evolve adiabatically even when driven in finite time, a technique commonly known as shortcuts to adiabaticity. It was suggested to use such external drivings to render the unitary processes of a thermodynamic cycle quantum adiabatic, while being performed in finite time. However, implementing an additional external driving requires resources that should be accounted for. Furthermore, and in line with natural intuition, these transformations should not be achievable in arbitrarily short times. First, we will present a computable measure of the cost of a shortcut to adiabaticity. Using this, we then examine the speed with which a quantum system can be driven. As a main result, we will establish a rigorous link between this speed, the quantum speed limit, and the (energetic) cost of implementing such a shortcut to adiabaticity. Interestingly, this link elucidates a trade-off between speed and cost, namely that instantaneous manipulation is impossible as it requires an infinite cost.

Quantum random number generation for loophole-free Bell tests

NASA Astrophysics Data System (ADS)

Mitchell, Morgan; Abellan, Carlos; Amaya, Waldimar

2015-05-01

We describe the generation of quantum random numbers at multi-Gbps rates, combined with real-time randomness extraction, to give very high purity random numbers based on quantum events at most tens of ns in the past. The system satisfies the stringent requirements of quantum non-locality tests that aim to close the timing loophole. We describe the generation mechanism using spontaneous-emission-driven phase diffusion in a semiconductor laser, digitization, and extraction by parity calculation using multi-GHz logic chips. We pay special attention to experimental proof of the quality of the random numbers and analysis of the randomness extraction. In contrast to widely-used models of randomness generators in the computer science literature, we argue that randomness generation by spontaneous emission can be extracted from a single source.

Quantum recurrence and fractional dynamic localization in ac-driven perfect state transfer Hamiltonians

DOE Office of Scientific and Technical Information (OSTI.GOV)

Longhi, Stefano, E-mail: stefano.longhi@fisi.polimi.it

Quantum recurrence and dynamic localization are investigated in a class of ac-driven tight-binding Hamiltonians, the Krawtchouk quantum chain, which in the undriven case provides a paradigmatic Hamiltonian model that realizes perfect quantum state transfer and mirror inversion. The equivalence between the ac-driven single-particle Krawtchouk Hamiltonian H{sup -hat} (t) and the non-interacting ac-driven bosonic junction Hamiltonian enables to determine in a closed form the quasi energy spectrum of H{sup -hat} (t) and the conditions for exact wave packet reconstruction (dynamic localization). In particular, we show that quantum recurrence, which is predicted by the general quantum recurrence theorem, is exact for themore » Krawtchouk quantum chain in a dense range of the driving amplitude. Exact quantum recurrence provides perfect wave packet reconstruction at a frequency which is fractional than the driving frequency, a phenomenon that can be referred to as fractional dynamic localization.« less

Observation of topologically protected bound states in photonic quantum walks.

PubMed

Kitagawa, Takuya; Broome, Matthew A; Fedrizzi, Alessandro; Rudner, Mark S; Berg, Erez; Kassal, Ivan; Aspuru-Guzik, Alán; Demler, Eugene; White, Andrew G

2012-06-06

Topological phases exhibit some of the most striking phenomena in modern physics. Much of the rich behaviour of quantum Hall systems, topological insulators, and topological superconductors can be traced to the existence of robust bound states at interfaces between different topological phases. This robustness has applications in metrology and holds promise for future uses in quantum computing. Engineered quantum systems--notably in photonics, where wavefunctions can be observed directly--provide versatile platforms for creating and probing a variety of topological phases. Here we use photonic quantum walks to observe bound states between systems with different bulk topological properties and demonstrate their robustness to perturbations--a signature of topological protection. Although such bound states are usually discussed for static (time-independent) systems, here we demonstrate their existence in an explicitly time-dependent situation. Moreover, we discover a new phenomenon: a topologically protected pair of bound states unique to periodically driven systems.

Optically programmable electron spin memory using semiconductor quantum dots.

PubMed

Kroutvar, Miro; Ducommun, Yann; Heiss, Dominik; Bichler, Max; Schuh, Dieter; Abstreiter, Gerhard; Finley, Jonathan J

2004-11-04

The spin of a single electron subject to a static magnetic field provides a natural two-level system that is suitable for use as a quantum bit, the fundamental logical unit in a quantum computer. Semiconductor quantum dots fabricated by strain driven self-assembly are particularly attractive for the realization of spin quantum bits, as they can be controllably positioned, electronically coupled and embedded into active devices. It has been predicted that the atomic-like electronic structure of such quantum dots suppresses coupling of the spin to the solid-state quantum dot environment, thus protecting the 'spin' quantum information against decoherence. Here we demonstrate a single electron spin memory device in which the electron spin can be programmed by frequency selective optical excitation. We use the device to prepare single electron spins in semiconductor quantum dots with a well defined orientation, and directly measure the intrinsic spin flip time and its dependence on magnetic field. A very long spin lifetime is obtained, with a lower limit of about 20 milliseconds at a magnetic field of 4 tesla and at 1 kelvin.

Digital lattice gauge theories

NASA Astrophysics Data System (ADS)

Zohar, Erez; Farace, Alessandro; Reznik, Benni; Cirac, J. Ignacio

2017-02-01

We propose a general scheme for a digital construction of lattice gauge theories with dynamical fermions. In this method, the four-body interactions arising in models with 2 +1 dimensions and higher are obtained stroboscopically, through a sequence of two-body interactions with ancillary degrees of freedom. This yields stronger interactions than the ones obtained through perturbative methods, as typically done in previous proposals, and removes an important bottleneck in the road towards experimental realizations. The scheme applies to generic gauge theories with Lie or finite symmetry groups, both Abelian and non-Abelian. As a concrete example, we present the construction of a digital quantum simulator for a Z3 lattice gauge theory with dynamical fermionic matter in 2 +1 dimensions, using ultracold atoms in optical lattices, involving three atomic species, representing the matter, gauge, and auxiliary degrees of freedom, that are separated in three different layers. By moving the ancilla atoms with a proper sequence of steps, we show how we can obtain the desired evolution in a clean, controlled way.

Out-of-equilibrium dynamics driven by localized time-dependent perturbations at quantum phase transitions

NASA Astrophysics Data System (ADS)

Pelissetto, Andrea; Rossini, Davide; Vicari, Ettore

2018-03-01

We investigate the quantum dynamics of many-body systems subject to local (i.e., restricted to a limited space region) time-dependent perturbations. If the system crosses a quantum phase transition, an off-equilibrium behavior is observed, even for a very slow driving. We show that, close to the transition, time-dependent quantities obey scaling laws. In first-order transitions, the scaling behavior is universal, and some scaling functions can be computed exactly. For continuous transitions, the scaling laws are controlled by the standard critical exponents and by the renormalization-group dimension of the perturbation at the transition. Our protocol can be implemented in existing relatively small quantum simulators, paving the way for a quantitative probe of the universal off-equilibrium scaling behavior, without the need to manipulate systems close to the thermodynamic limit.

Algebraic aspects of the driven dynamics in the density operator and correlation functions calculation for multi-level open quantum systems

NASA Astrophysics Data System (ADS)

Bogolubov, Nikolai N.; Soldatov, Andrey V.

2017-12-01

Exact and approximate master equations were derived by the projection operator method for the reduced statistical operator of a multi-level quantum system with finite number N of quantum eigenstates interacting with arbitrary external classical fields and dissipative environment simultaneously. It was shown that the structure of these equations can be simplified significantly if the free Hamiltonian driven dynamics of an arbitrary quantum multi-level system under the influence of the external driving fields as well as its Markovian and non-Markovian evolution, stipulated by the interaction with the environment, are described in terms of the SU(N) algebra representation. As a consequence, efficient numerical methods can be developed and employed to analyze these master equations for real problems in various fields of theoretical and applied physics. It was also shown that literally the same master equations hold not only for the reduced density operator but also for arbitrary nonequilibrium multi-time correlation functions as well under the only assumption that the system and the environment are uncorrelated at some initial moment of time. A calculational scheme was proposed to account for these lost correlations in a regular perturbative way, thus providing additional computable terms to the correspondent master equations for the correlation functions.

Entangled de Sitter from stringy axionic Bell pair I: an analysis using Bunch-Davies vacuum

NASA Astrophysics Data System (ADS)

Choudhury, Sayantan; Panda, Sudhakar

2018-01-01

In this work, we study the quantum entanglement and compute entanglement entropy in de Sitter space for a bipartite quantum field theory driven by an axion originating from Type IIB string compactification on a Calabi-Yau three fold (CY^3) and in the presence of an NS5 brane. For this computation, we consider a spherical surface S^2, which divides the spatial slice of de Sitter (dS_4) into exterior and interior sub-regions. We also consider the initial choice of vacuum to be Bunch-Davies state. First we derive the solution of the wave function of the axion in a hyperbolic open chart by constructing a suitable basis for Bunch-Davies vacuum state using Bogoliubov transformation. We then derive the expression for density matrix by tracing over the exterior region. This allows us to compute the entanglement entropy and Rényi entropy in 3+1 dimension. Furthermore, we quantify the UV-finite contribution of the entanglement entropy which contain the physics of long range quantum correlations of our expanding universe. Finally, our analysis complements the necessary condition for generating non-vanishing entanglement entropy in primordial cosmology due to the axion.

Ion trap architectures and new directions

NASA Astrophysics Data System (ADS)

Siverns, James D.; Quraishi, Qudsia

2017-12-01

Trapped ion technology has seen advances in performance, robustness and versatility over the last decade. With increasing numbers of trapped ion groups worldwide, a myriad of trap architectures are currently in use. Applications of trapped ions include: quantum simulation, computing and networking, time standards and fundamental studies in quantum dynamics. Design of such traps is driven by these various research aims, but some universally desirable properties have lead to the development of ion trap foundries. Additionally, the excellent control achievable with trapped ions and the ability to do photonic readout has allowed progress on quantum networking using entanglement between remotely situated ion-based nodes. Here, we present a selection of trap architectures currently in use by the community and present their most salient characteristics, identifying features particularly suited for quantum networking. We also discuss our own in-house research efforts aimed at long-distance trapped ion networking.

Coherent Dynamics of a Hybrid Quantum Spin-Mechanical Oscillator System

NASA Astrophysics Data System (ADS)

Lee, Kenneth William, III

A fully functional quantum computer must contain at least two important components: a quantum memory for storing and manipulating quantum information and a quantum data bus to securely transfer information between quantum memories. Typically, a quantum memory is composed of a matter system, such as an atom or an electron spin, due to their prolonged quantum coherence. Alternatively, a quantum data bus is typically composed of some propagating degree of freedom, such as a photon, which can retain quantum information over long distances. Therefore, a quantum computer will likely be a hybrid quantum device, consisting of two or more disparate quantum systems. However, there must be a reliable and controllable quantum interface between the memory and bus in order to faithfully interconvert quantum information. The current engineering challenge for quantum computers is scaling the device to large numbers of controllable quantum systems, which will ultimately depend on the choice of the quantum elements and interfaces utilized in the device. In this thesis, we present and characterize a hybrid quantum device comprised of single nitrogen-vacancy (NV) centers embedded in a high quality factor diamond mechanical oscillator. The electron spin of the NV center is a leading candidate for the realization of a quantum memory due to its exceptional quantum coherence times. On the other hand, mechanical oscillators are highly sensitive to a wide variety of external forces, and have the potential to serve as a long-range quantum bus between quantum systems of disparate energy scales. These two elements are interfaced through crystal strain generated by vibrations of the mechanical oscillator. Importantly, a strain interface allows for a scalable architecture, and furthermore, opens the door to integration into a larger quantum network through coupling to an optical interface. There are a few important engineering challenges associated with this device. First, there have been no previous demonstrations of a strain-mediated spin-mechanical interface and hence the system is largely uncharacterized. Second, fabricating high quality diamond mechanical oscillators is difficult due to the robust and chemically inert nature of diamond. Finally, engineering highly coherent NV centers with a coherent optical interface in nanostructured diamond remains an outstanding challenge. In this thesis, we theoretically and experimentally address each of these challenges, and show that with future improvements, this device is suitable for future quantum-enabled applications. First, we theoretically and experimentally demonstrate a dynamic, strain-mediated coupling between the spin and orbital degrees of freedom of the NV center and the driven mechanical motion of a single-crystal diamond cantilever. We employ Ramsey interferometry to demonstrate coherent, mechanical driving of the NV spin evolution. Using this interferometry technique, we present the first demonstration of nanoscale strain imaging, and quantitatively characterize the previously unknown spin-strain coupling constants. Next, we use the driven motion of the cantilever to perform deterministic control of the frequency and polarization dependence of the optical transitions of the NV center. Importantly, this experiment constitutes the first demonstration of on-chip control of both the frequency and polarization state of a single photon produced by a quantum emitter. In the final experiment, we use mechanical driving to engineer a series of spin ``clock" states and demonstrate a significant increase in the spin coherence time of the NV center. We conclude this thesis with a theoretical discussion of prospective applications for this device, including generation of non-classical mechanical states and spin-spin entanglement, as well as an evaluation of the current limitations of our devices, including a possible avenues for improvement to reach the regime of strong spin-phonon coupling.

High-Fidelity Quantum Logic Gates Using Trapped-Ion Hyperfine Qubits.

PubMed

Ballance, C J; Harty, T P; Linke, N M; Sepiol, M A; Lucas, D M

2016-08-05

We demonstrate laser-driven two-qubit and single-qubit logic gates with respective fidelities 99.9(1)% and 99.9934(3)%, significantly above the ≈99% minimum threshold level required for fault-tolerant quantum computation, using qubits stored in hyperfine ground states of calcium-43 ions held in a room-temperature trap. We study the speed-fidelity trade-off for the two-qubit gate, for gate times between 3.8  μs and 520  μs, and develop a theoretical error model which is consistent with the data and which allows us to identify the principal technical sources of infidelity.

Driven-dissipative quantum Monte Carlo method for open quantum systems

NASA Astrophysics Data System (ADS)

Nagy, Alexandra; Savona, Vincenzo

2018-05-01

We develop a real-time full configuration-interaction quantum Monte Carlo approach to model driven-dissipative open quantum systems with Markovian system-bath coupling. The method enables stochastic sampling of the Liouville-von Neumann time evolution of the density matrix thanks to a massively parallel algorithm, thus providing estimates of observables on the nonequilibrium steady state. We present the underlying theory and introduce an initiator technique and importance sampling to reduce the statistical error. Finally, we demonstrate the efficiency of our approach by applying it to the driven-dissipative two-dimensional X Y Z spin-1/2 model on a lattice.

Dynamical quantum phase transitions in discrete time crystals

NASA Astrophysics Data System (ADS)

Kosior, Arkadiusz; Sacha, Krzysztof

2018-05-01

Discrete time crystals are related to nonequilibrium dynamics of periodically driven quantum many-body systems where the discrete time-translation symmetry of the Hamiltonian is spontaneously broken into another discrete symmetry. Recently, the concept of phase transitions has been extended to nonequilibrium dynamics of time-independent systems induced by a quantum quench, i.e., a sudden change of some parameter of the Hamiltonian. There, the return probability of a system to the ground state reveals singularities in time which are dubbed dynamical quantum phase transitions. We show that the quantum quench in a discrete time crystal leads to dynamical quantum phase transitions where the return probability of a periodically driven system to a Floquet eigenstate before the quench reveals singularities in time. It indicates that dynamical quantum phase transitions are not restricted to time-independent systems and can be also observed in systems that are periodically driven. We discuss how the phenomenon can be observed in ultracold atomic gases.

Experimental demonstration of cheap and accurate phase estimation

NASA Astrophysics Data System (ADS)

Rudinger, Kenneth; Kimmel, Shelby; Lobser, Daniel; Maunz, Peter

We demonstrate experimental implementation of robust phase estimation (RPE) to learn the phases of X and Y rotations on a trapped Yb+ ion qubit.. Unlike many other phase estimation protocols, RPE does not require ancillae nor near-perfect state preparation and measurement operations. Additionally, its computational requirements are minimal. Via RPE, using only 352 experimental samples per phase, we estimate phases of implemented gates with errors as small as 10-4 radians, as validated using gate set tomography. We also demonstrate that these estimates exhibit Heisenberg scaling in accuracy. Sandia National Laboratories is a multi-program laboratory managed and operated by Sandia Corporation, a wholly owned subsidiary of Lockheed Martin Corporation, for the U.S. Department of Energy's National Nuclear Security Administration under contract DE-AC04-94AL85000.

Parameter-free driven Liouville-von Neumann approach for time-dependent electronic transport simulations in open quantum systems

DOE PAGES

Zelovich, Tamar; Hansen, Thorsten; Liu, Zhen-Fei; ...

2017-03-02

A parameter-free version of the recently developed driven Liouville-von Neumann equation [T. Zelovich et al., J. Chem. Theory Comput. 10(8), 2927-2941 (2014)] for electronic transport calculations in molecular junctions is presented. The single driving rate, appearing as a fitting parameter in the original methodology, is replaced by a set of state-dependent broadening factors applied to the different single-particle lead levels. These broadening factors are extracted explicitly from the self-energy of the corresponding electronic reservoir and are fully transferable to any junction incorporating the same lead model. Furthermore, the performance of the method is demonstrated via tight-binding and extended Hückel calculationsmore » of simple junction models. Our analytic considerations and numerical results indicate that the developed methodology constitutes a rigorous framework for the design of "black-box" algorithms to simulate electron dynamics in open quantum systems out of equilibrium.« less

Parameter-free driven Liouville-von Neumann approach for time-dependent electronic transport simulations in open quantum systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zelovich, Tamar; Hansen, Thorsten; Liu, Zhen-Fei

A parameter-free version of the recently developed driven Liouville-von Neumann equation [T. Zelovich et al., J. Chem. Theory Comput. 10(8), 2927-2941 (2014)] for electronic transport calculations in molecular junctions is presented. The single driving rate, appearing as a fitting parameter in the original methodology, is replaced by a set of state-dependent broadening factors applied to the different single-particle lead levels. These broadening factors are extracted explicitly from the self-energy of the corresponding electronic reservoir and are fully transferable to any junction incorporating the same lead model. Furthermore, the performance of the method is demonstrated via tight-binding and extended Hückel calculationsmore » of simple junction models. Our analytic considerations and numerical results indicate that the developed methodology constitutes a rigorous framework for the design of "black-box" algorithms to simulate electron dynamics in open quantum systems out of equilibrium.« less

Synthesis of Polyferrocenylsilane Block Copolymers and their Crystallization-Driven Self-Assembly in Protic Solvents

NASA Astrophysics Data System (ADS)

Zhou, Hang

Quantum walks are the quantum mechanical analogue of classical random walks. Discrete-time quantum walks have been introduced and studied mostly on the line Z or higher dimensional space Zd but rarely defined on graphs with fractal dimensions because the coin operator depends on the position and the Fourier transform on the fractals is not defined. Inspired by its nature of classical walks, different quantum walks will be defined by choosing different shift and coin operators. When the coin operator is uniform, the results of classical walks will be obtained upon measurement at each step. Moreover, with measurement at each step, our results reveal more information about the classical random walks. In this dissertation, two graphs with fractal dimensions will be considered. The first one is Sierpinski gasket, a degree-4 regular graph with Hausdorff dimension of df = ln 3/ ln 2. The second is the Cantor graph derived like Cantor set, with Hausdorff dimension of df = ln 2/ ln 3. The definitions and amplitude functions of the quantum walks will be introduced. The main part of this dissertation is to derive a recursive formula to compute the amplitude Green function. The exiting probability will be computed and compared with the classical results. When the generation of graphs goes to infinity, the recursion of the walks will be investigated and the convergence rates will be obtained and compared with the classical counterparts.

Predicting Hydride Donor Strength via Quantum Chemical Calculations of Hydride Transfer Activation Free Energy.

PubMed

Alherz, Abdulaziz; Lim, Chern-Hooi; Hynes, James T; Musgrave, Charles B

2018-01-25

We propose a method to approximate the kinetic properties of hydride donor species by relating the nucleophilicity (N) of a hydride to the activation free energy ΔG ⧧ of its corresponding hydride transfer reaction. N is a kinetic parameter related to the hydride transfer rate constant that quantifies a nucleophilic hydridic species' tendency to donate. Our method estimates N using quantum chemical calculations to compute ΔG ⧧ for hydride transfers from hydride donors to CO 2 in solution. A linear correlation for each class of hydrides is then established between experimentally determined N values and the computationally predicted ΔG ⧧ ; this relationship can then be used to predict nucleophilicity for different hydride donors within each class. This approach is employed to determine N for four different classes of hydride donors: two organic (carbon-based and benzimidazole-based) and two inorganic (boron and silicon) hydride classes. We argue that silicon and boron hydrides are driven by the formation of the more stable Si-O or B-O bond. In contrast, the carbon-based hydrides considered herein are driven by the stability acquired upon rearomatization, a feature making these species of particular interest, because they both exhibit catalytic behavior and can be recycled.

Quantum correlations from a room-temperature optomechanical cavity

NASA Astrophysics Data System (ADS)

Purdy, T. P.; Grutter, K. E.; Srinivasan, K.; Taylor, J. M.

2017-06-01

The act of position measurement alters the motion of an object being measured. This quantum measurement backaction is typically much smaller than the thermal motion of a room-temperature object and thus difficult to observe. By shining laser light through a nanomechanical beam, we measure the beam’s thermally driven vibrations and perturb its motion with optical force fluctuations at a level dictated by the Heisenberg measurement-disturbance uncertainty relation. We demonstrate a cross-correlation technique to distinguish optically driven motion from thermally driven motion, observing this quantum backaction signature up to room temperature. We use the scale of the quantum correlations, which is determined by fundamental constants, to gauge the size of thermal motion, demonstrating a path toward absolute thermometry with quantum mechanically calibrated ticks.

Universal photonic quantum gates assisted by ancilla diamond nitrogen-vacancy centers coupled to resonators

NASA Astrophysics Data System (ADS)

Wei, Hai-Rui; Long, Gui Lu

2015-03-01

We propose two compact, economic, and scalable schemes for implementing optical controlled-phase-flip and controlled-controlled-phase-flip gates by using the input-output process of a single-sided cavity strongly coupled to a single nitrogen-vacancy-center defect in diamond. Additional photonic qubits, necessary for procedures based on the parity-check measurement or controlled-path and merging gates, are not employed in our schemes. In the controlled-path gate, the paths of the target photon are conditionally controlled by the control photon, and these two paths can be merged back into one by using a merging gate. Only one half-wave plate is employed in our scheme for the controlled-phase-flip gate. Compared with the conventional synthesis procedures for constructing a controlled-controlled-phase-flip gate, the cost of which is two controlled-path gates and two merging gates, or six controlled-not gates, our scheme is more compact and simpler. Our schemes could be performed with a high fidelity and high efficiency with current achievable experimental techniques.

Stable Isotopes, Quantum Computing and Consciousness

NASA Astrophysics Data System (ADS)

Berezin, Alexander A.

2000-10-01

Recent proposals of quantum computing/computers (QC) based on nuclear spins suggest that consciousness (CON) activity may be related (assisted) to subset of C13 atoms incorporated randomly, or quasirandomly, in neural structures. Consider two DNA chains. Even if they are completely identical chemically (same sequence of codons), patterns of 12C and 13C isotopes in them are different (possible origin of personal individuality). Perhaps it is subsystem of nuclear spins of 13C "sublattice" which forms dynamical system capable of QC and on which CON is "spanned". Some issues related to this hypothesis are: (1) existence of CON-driven positional correlations among C13 atoms, (2) motion (hopping) of C13 via enhanced neutron tunneling, cf. quantum "anti Zeno-effect", (3) possible optimization of concentration of QC-active C13 atoms above their standard isotopic abundance, (4) characteristic time-scales for operation of C13-based QC (perrhaps, broad range of scales), (5) reflection of QC dynamics of C13 on CON, (6) possibility that C13-based QC operates "above" level of "regular" CON (perhaps, Jungian sub/super-CON), (7) isotopicity as connector to universal Library of Patterns ("Platonic World"), (8) self-stabilization of coherence in C13 (sub)system. Some of this questions are, in principle, experimentally addressable through shifting of isotopic abundances.

Hybrid quantum logic and a test of Bell's inequality using two different atomic isotopes.

PubMed

Ballance, C J; Schäfer, V M; Home, J P; Szwer, D J; Webster, S C; Allcock, D T C; Linke, N M; Harty, T P; Aude Craik, D P L; Stacey, D N; Steane, A M; Lucas, D M

2015-12-17

Entanglement is one of the most fundamental properties of quantum mechanics, and is the key resource for quantum information processing (QIP). Bipartite entangled states of identical particles have been generated and studied in several experiments, and post-selected or heralded entangled states involving pairs of photons, single photons and single atoms, or different nuclei in the solid state, have also been produced. Here we use a deterministic quantum logic gate to generate a 'hybrid' entangled state of two trapped-ion qubits held in different isotopes of calcium, perform full tomography of the state produced, and make a test of Bell's inequality with non-identical atoms. We use a laser-driven two-qubit gate, whose mechanism is insensitive to the qubits' energy splittings, to produce a maximally entangled state of one (40)Ca(+) qubit and one (43)Ca(+) qubit, held 3.5 micrometres apart in the same ion trap, with 99.8 ± 0.6 per cent fidelity. We test the CHSH (Clauser-Horne-Shimony-Holt) version of Bell's inequality for this novel entangled state and find that it is violated by 15 standard deviations; in this test, we close the detection loophole but not the locality loophole. Mixed-species quantum logic is a powerful technique for the construction of a quantum computer based on trapped ions, as it allows protection of memory qubits while other qubits undergo logic operations or are used as photonic interfaces to other processing units. The entangling gate mechanism used here can also be applied to qubits stored in different atomic elements; this would allow both memory and logic gate errors caused by photon scattering to be reduced below the levels required for fault-tolerant quantum error correction, which is an essential prerequisite for general-purpose quantum computing.

Global Dirac bispinor entanglement under Lorentz boosts

NASA Astrophysics Data System (ADS)

Bittencourt, Victor A. S. V.; Bernardini, Alex E.; Blasone, Massimo

2018-03-01

The effects of Lorentz boosts on the quantum entanglement encoded by a pair of massive spin-1/2 particles are described according to the Lorentz covariant structure described by Dirac bispinors. The quantum system considered incorporates four degrees of freedom: two of them related to the bispinor intrinsic parity and the other two related to the bispinor spin projection, i.e., the Dirac particle helicity. Because of the natural multipartite structure involved, the Meyer-Wallach global measure of entanglement is preliminarily used for computing global quantum correlations, while the entanglement separately encoded by spin degrees of freedom is measured through the negativity of the reduced two-particle spin-spin state. A general framework to compute the changes on quantum entanglement induced by a boost is developed and then specialized to describe three particular antisymmetric two-particle states. According to the results obtained, two-particle spin-spin entanglement cannot be created by the action of a Lorentz boost in a spin-spin separable antisymmetric state. On the other hand, the maximal spin-spin entanglement encoded by antisymmetric superpositions is degraded by Lorentz boosts driven by high-speed frame transformations. Finally, the effects of boosts on chiral states are shown to exhibit interesting invariance properties, which can only be obtained through such a Lorentz covariant formulation of the problem.

Computationally Driven Two-Dimensional Materials Design: What Is Next?

DOE PAGES

Pan, Jie; Lany, Stephan; Qi, Yue

2017-07-17

Two-dimensional (2D) materials offer many key advantages to innovative applications, such as spintronics and quantum information processing. Theoretical computations have accelerated 2D materials design. In this issue of ACS Nano, Kumar et al. report that ferromagnetism can be achieved in functionalized nitride MXene based on first-principles calculations. Their computational results shed light on a potentially vast group of materials for the realization of 2D magnets. In this Perspective, we briefly summarize the promising properties of 2D materials and the role theory has played in predicting these properties. Additionally, we discuss challenges and opportunities to boost the power of computation formore » the prediction of the 'structure-property-process (synthesizability)' relationship of 2D materials.« less

Prediction of Quantum Anomalous Hall Insulator in half-fluorinated GaBi Honeycomb

PubMed Central

Chen, Sung-Ping; Huang, Zhi-Quan; Crisostomo, Christian P.; Hsu, Chia-Hsiu; Chuang, Feng-Chuan; Lin, Hsin; Bansil, Arun

2016-01-01

Using first-principles electronic structure calculations, we predict half-fluorinated GaBi honeycomb under tensile strain to harbor a quantum anomalous Hall (QAH) insulator phase. We show that this QAH phase is driven by a single inversion in the band structure at the Γ point. Moreover, we have computed the electronic spectrum of a half-fluorinated GaBi nanoribbon with zigzag edges, which shows that only one edge band crosses the Fermi level within the band gap. Our results suggest that half-fluorination of the GaBi honeycomb under tensile strain could provide a new platform for developing novel spintronics devices based on the QAH effect. PMID:27507248

Simulation of Non-Abelian Braiding in Majorana Time Crystals

NASA Astrophysics Data System (ADS)

Bomantara, Raditya Weda; Gong, Jiangbin

2018-06-01

Discrete time crystals have attracted considerable theoretical and experimental studies but their potential applications have remained unexplored. A particular type of discrete time crystals, termed "Majorana time crystals," is found to emerge in a periodically driven superconducting wire accommodating two different species of topological edge modes. It is further shown that one can manipulate different Majorana edge modes separated in the time lattice, giving rise to an unforeseen scenario for topologically protected gate operations mimicking braiding. The proposed protocol can also generate a magic state that is important for universal quantum computation. This study thus advances the quantum control in discrete time crystals and reveals their great potential arising from their time-domain properties.

Single qubit operations using microwave hyperbolic secant pulses

NASA Astrophysics Data System (ADS)

Ku, H. S.; Long, J. L.; Wu, X.; Bal, M.; Lake, R. E.; Barnes, Edwin; Economou, Sophia E.; Pappas, D. P.

2017-10-01

It has been known since the early days of quantum mechanics that hyperbolic secant pulses possess the unique property that they can perform full-cycle Rabi oscillations on two-level quantum systems independently of the pulse detuning. More recently, it was realized that they induce detuning-controlled phases without changing state populations. Here, we experimentally demonstrate the properties of hyperbolic secant pulses on superconducting transmon qubits and contrast them with the more commonly used Gaussian and square waves. We further show that these properties can be exploited to implement phase gates, nominally without exiting the computational subspace. This enables us to demonstrate a microwave-driven Z rotation with a single control parameter, the detuning.

Prediction of Quantum Anomalous Hall Insulator in half-fluorinated GaBi Honeycomb

DOE PAGES

Chen, Sung-Ping; Huang, Zhi-Quan; Crisostomo, Christian P.; ...

2016-08-10

Using first-principles electronic structure calculations, we predict half-fluorinated GaBi honeycomb under tensile strain to harbor a quantum anomalous Hall (QAH) insulator phase. We show that this QAH phase is driven by a single inversion in the band structure at the Γ point. Moreover, we have computed the electronic spectrum of a half-fluorinated GaBi nanoribbon with zigzag edges, which shows that only one edge band crosses the Fermi level within the band gap. In conclusion, our results suggest that half-fluorination of the GaBi honeycomb under tensile strain could provide a new platform for developing novel spintronics devices based on the QAHmore » effect.« less

Computational challenges in atomic, molecular and optical physics.

PubMed

Taylor, Kenneth T

2002-06-15

Six challenges are discussed. These are the laser-driven helium atom; the laser-driven hydrogen molecule and hydrogen molecular ion; electron scattering (with ionization) from one-electron atoms; the vibrational and rotational structure of molecules such as H(3)(+) and water at their dissociation limits; laser-heated clusters; and quantum degeneracy and Bose-Einstein condensation. The first four concern fundamental few-body systems where use of high-performance computing (HPC) is currently making possible accurate modelling from first principles. This leads to reliable predictions and support for laboratory experiment as well as true understanding of the dynamics. Important aspects of these challenges addressable only via a terascale facility are set out. Such a facility makes the last two challenges in the above list meaningfully accessible for the first time, and the scientific interest together with the prospective role for HPC in these is emphasized.

Nuclear quantum fluctuations in ice I(h).

PubMed

Moreira, Pedro Augusto Franco Pinheiro; de Koning, Maurice

2015-10-14

We discuss the role of nuclear quantum fluctuations in ice Ih, focusing on the hydrogen-bond (HB) structure and the molecular dipole-moment distribution. For this purpose we carry out DFT-based first-principles molecular dynamics and path-integral molecular dynamics simulations at T = 100 K. We analyze the HB structure in terms of a set of parameters previously employed to characterize molecular structures in the liquid phase and compute the molecular dipole moments using the maximally-localized Wannier functions. The results show that the protons experience very large digressions driven by quantum fluctuations, accompanied by major rearrangements in the electronic density. As a result of these protonic quantum fluctuations the molecular dipole-moment distribution is substantially broadened as well as shifted to a larger mean value when compared to the results obtained when such fluctuations are neglected. In terms of dielectric constants, the reconciliation between the greater mean dipole moment and experimental indications that the dielectric constant of H2O ice is lower than that of D2O ice would indicate that the topology of the HB network is sensitive to protonic quantum fluctuations.

Coherent manipulation of quantum spin states in a single molecular nanomagnet

NASA Astrophysics Data System (ADS)

Wernsdorfer, Wolfgang

The endeavour of quantum electronics is driven by one of the most ambitious technological goals of today's scientists: the realization of an operational quantum computer (http://qurope.eu). We started to address this goal by the new research field of molecular quantum spintronics. The building blocks are magnetic molecules, i.e. well-defined spin qubits. We will discuss this still largely unexplored field and present our first results: For example, using a molecular spin-transistor, we achieved the electronic read-out of the nuclear spin of an individual metal atom embedded in an SMM. We could show very long spin lifetimes (>10 s). Using the hyperfine Stark effect, which transforms electric fields into local effective magnetic fields, we could not only tune the resonance frequency by several MHz, but also perform coherent quantum manipulations on a single nuclear qubit faster than a μs by means of electrical fields only, establishing the individual addressability of identical nuclear qubits. Using three different microwave frequencies, we could implement a simple four-level Grover algorithm. S. Thiele, F. Balestro, R. Ballou, S. Klyatskaya, M. Ruben, W. Wernsdorfer, Science 344, 1135 (2014).

Reduced equations of motion for quantum systems driven by diffusive Markov processes.

PubMed

Sarovar, Mohan; Grace, Matthew D

2012-09-28

The expansion of a stochastic Liouville equation for the coupled evolution of a quantum system and an Ornstein-Uhlenbeck process into a hierarchy of coupled differential equations is a useful technique that simplifies the simulation of stochastically driven quantum systems. We expand the applicability of this technique by completely characterizing the class of diffusive Markov processes for which a useful hierarchy of equations can be derived. The expansion of this technique enables the examination of quantum systems driven by non-Gaussian stochastic processes with bounded range. We present an application of this extended technique by simulating Stark-tuned Förster resonance transfer in Rydberg atoms with nonperturbative position fluctuations.

Transport, shot noise, and topology in AC-driven dimer arrays

NASA Astrophysics Data System (ADS)

Niklas, Michael; Benito, Mónica; Kohler, Sigmund; Platero, Gloria

2016-11-01

We analyze an AC-driven dimer chain connected to a strongly biased electron source and drain. It turns out that the resulting transport exhibits fingerprints of topology. They are particularly visible in the driving-induced current suppression and the Fano factor. Thus, shot noise measurements provide a topological phase diagram as a function of the driving parameters. The observed phenomena can be explained physically by a mapping to an effective time-independent Hamiltonian and the emergence of edge states. Moreover, by considering quantum dissipation, we determine the requirements for the coherence properties in a possible experimental realization. For the computation of the zero-frequency noise, we develop an efficient method based on matrix-continued fractions.

Dynamics of photogenerated carriers near magnetic field driven quantum phase transition in aperiodic multiple quantum wells

NASA Astrophysics Data System (ADS)

Tito, M. A.; Pusep, Yu A.

2018-01-01

Time-resolved magneto-photoluminescence was employed to study the magnetic field induced quantum phase transition separating two phases with different distributions of electrons over quantum wells in an aperiodic multiple quantum well, embedded in a wide AlGaAs parabolic quantum well. Intensities, broadenings and recombination times attributed to the photoluminescence lines emitted from individual quantum wells of the multiple quantum well structure were measured as a function of the magnetic field near the transition. The presented data manifest themselves to the magnetic field driven migration of the free electrons between the quantum wells of the studied multiple quantum well structure. The observed charge transfer was found to influence the screening of the multiple quantum well and disorder potentials. Evidence of the localization of the electrons in the peripheral quantum wells in strong magnetic field is presented.

Forbidden atomic transitions driven by an intensity-modulated laser trap.

PubMed

Moore, Kaitlin R; Anderson, Sarah E; Raithel, Georg

2015-01-20

Spectroscopy is an essential tool in understanding and manipulating quantum systems, such as atoms and molecules. The model describing spectroscopy includes the multipole-field interaction, which leads to established spectroscopic selection rules, and an interaction that is quadratic in the field, which is not often employed. However, spectroscopy using the quadratic (ponderomotive) interaction promises two significant advantages over spectroscopy using the multipole-field interaction: flexible transition rules and vastly improved spatial addressability of the quantum system. Here we demonstrate ponderomotive spectroscopy by using optical-lattice-trapped Rydberg atoms, pulsating the lattice light and driving a microwave atomic transition that would otherwise be forbidden by established spectroscopic selection rules. This ability to measure frequencies of previously inaccessible transitions makes possible improved determinations of atomic characteristics and constants underlying physics. The spatial resolution of ponderomotive spectroscopy is orders of magnitude better than the transition frequency would suggest, promising single-site addressability in dense particle arrays for quantum computing applications.

Driven superconducting quantum circuits

NASA Astrophysics Data System (ADS)

Nakamura, Yasunobu

2014-03-01

Driven nonlinear quantum systems show rich phenomena in various fields of physics. Among them, superconducting quantum circuits have very attractive features such as well-controlled quantum states with design flexibility, strong nonlinearity of Josephson junctions, strong coupling to electromagnetic driving fields, little internal dissipation, and tailored coupling to the electromagnetic environment. We have investigated properties and functionalities of driven superconducting quantum circuits. A transmon qubit coupled to a transmission line shows nearly perfect spatial mode matching between the incident and scattered microwave field in the 1D mode. Dressed states under a driving field are studied there and also in a semi-infinite 1D mode terminated by a resonator containing a flux qubit. An effective Λ-type three-level system is realized under an appropriate driving condition. It allows ``impedance-matched'' perfect absorption of incident probe photons and down conversion into another frequency mode. Finally, the weak signal from the qubit is read out using a Josephson parametric amplifier/oscillator which is another nonlinear circuit driven by a strong pump field. This work was partly supported by the Funding Program for World-Leading Innovative R&D on Science and Technology (FIRST), Project for Developing Innovation Systems of MEXT, MEXT KAKENHI ``Quantum Cybernetics,'' and the NICT Commissioned Research.

Interfacing External Quantum Devices to a Universal Quantum Computer

PubMed Central

Lagana, Antonio A.; Lohe, Max A.; von Smekal, Lorenz

2011-01-01

We present a scheme to use external quantum devices using the universal quantum computer previously constructed. We thereby show how the universal quantum computer can utilize networked quantum information resources to carry out local computations. Such information may come from specialized quantum devices or even from remote universal quantum computers. We show how to accomplish this by devising universal quantum computer programs that implement well known oracle based quantum algorithms, namely the Deutsch, Deutsch-Jozsa, and the Grover algorithms using external black-box quantum oracle devices. In the process, we demonstrate a method to map existing quantum algorithms onto the universal quantum computer. PMID:22216276

Interfacing external quantum devices to a universal quantum computer.

PubMed

Lagana, Antonio A; Lohe, Max A; von Smekal, Lorenz

2011-01-01

We present a scheme to use external quantum devices using the universal quantum computer previously constructed. We thereby show how the universal quantum computer can utilize networked quantum information resources to carry out local computations. Such information may come from specialized quantum devices or even from remote universal quantum computers. We show how to accomplish this by devising universal quantum computer programs that implement well known oracle based quantum algorithms, namely the Deutsch, Deutsch-Jozsa, and the Grover algorithms using external black-box quantum oracle devices. In the process, we demonstrate a method to map existing quantum algorithms onto the universal quantum computer. © 2011 Lagana et al.

Universal blind quantum computation for hybrid system

NASA Astrophysics Data System (ADS)

Huang, He-Liang; Bao, Wan-Su; Li, Tan; Li, Feng-Guang; Fu, Xiang-Qun; Zhang, Shuo; Zhang, Hai-Long; Wang, Xiang

2017-08-01

As progress on the development of building quantum computer continues to advance, first-generation practical quantum computers will be available for ordinary users in the cloud style similar to IBM's Quantum Experience nowadays. Clients can remotely access the quantum servers using some simple devices. In such a situation, it is of prime importance to keep the security of the client's information. Blind quantum computation protocols enable a client with limited quantum technology to delegate her quantum computation to a quantum server without leaking any privacy. To date, blind quantum computation has been considered only for an individual quantum system. However, practical universal quantum computer is likely to be a hybrid system. Here, we take the first step to construct a framework of blind quantum computation for the hybrid system, which provides a more feasible way for scalable blind quantum computation.

Nonperturbative stochastic method for driven spin-boson model

NASA Astrophysics Data System (ADS)

Orth, Peter P.; Imambekov, Adilet; Le Hur, Karyn

2013-01-01

We introduce and apply a numerically exact method for investigating the real-time dissipative dynamics of quantum impurities embedded in a macroscopic environment beyond the weak-coupling limit. We focus on the spin-boson Hamiltonian that describes a two-level system interacting with a bosonic bath of harmonic oscillators. This model is archetypal for investigating dissipation in quantum systems, and tunable experimental realizations exist in mesoscopic and cold-atom systems. It finds abundant applications in physics ranging from the study of decoherence in quantum computing and quantum optics to extended dynamical mean-field theory. Starting from the real-time Feynman-Vernon path integral, we derive an exact stochastic Schrödinger equation that allows us to compute the full spin density matrix and spin-spin correlation functions beyond weak coupling. We greatly extend our earlier work [P. P. Orth, A. Imambekov, and K. Le Hur, Phys. Rev. APLRAAN1050-294710.1103/PhysRevA.82.032118 82, 032118 (2010)] by fleshing out the core concepts of the method and by presenting a number of interesting applications. Methodologically, we present an analogy between the dissipative dynamics of a quantum spin and that of a classical spin in a random magnetic field. This analogy is used to recover the well-known noninteracting-blip approximation in the weak-coupling limit. We explain in detail how to compute spin-spin autocorrelation functions. As interesting applications of our method, we explore the non-Markovian effects of the initial spin-bath preparation on the dynamics of the coherence σx(t) and of σz(t) under a Landau-Zener sweep of the bias field. We also compute to a high precision the asymptotic long-time dynamics of σz(t) without bias and demonstrate the wide applicability of our approach by calculating the spin dynamics at nonzero bias and different temperatures.

Testing genuine tripartite quantum nonlocality with three two-level atoms in a driven cavity

NASA Astrophysics Data System (ADS)

Yuan, H.; Wei, L. F.

2013-10-01

It is known that the violation of Svetlichny's inequality (SI), rather than the usual Mermin's inequality (MI), is a robust criterion to confirm the existence of genuine multipartite quantum nonlocality. In this paper, we propose a feasible approach to test SI with three two-level atoms (TLAs) dispersively coupled to a driven cavity. The proposal is based on the joint measurements of the states of three TLAs by probing the steady-state transmission spectra of the driven cavity: each peak marks one of the computational basis states and its relative height corresponds to the probability superposed in the detected three-TLA state. With these kinds of joint measurements, the correlation functions in SI can be directly calculated, and thus the SI can be efficiently tested for typical tripartite entanglement, i.e., genuine tripartite entanglement [e.g., Greenberger-Horne-Zeilinger (GHZ) and W states] and biseparable three-qubit entangled states (e.g., |χ>12|ξ>3). Our numerical experiments show that the SI is violated only by three-qubit GHZ and W states, not by biseparable three-qubit entangled state |χ>12|ξ>3, while the MI can still be violated by biseparable three-qubit entangled states. Thus the violation of SI can be regarded as a robust criterion for the existence of genuine tripartite entanglement.

Blind Quantum Signature with Blind Quantum Computation

NASA Astrophysics Data System (ADS)

Li, Wei; Shi, Ronghua; Guo, Ying

2017-04-01

Blind quantum computation allows a client without quantum abilities to interact with a quantum server to perform a unconditional secure computing protocol, while protecting client's privacy. Motivated by confidentiality of blind quantum computation, a blind quantum signature scheme is designed with laconic structure. Different from the traditional signature schemes, the signing and verifying operations are performed through measurement-based quantum computation. Inputs of blind quantum computation are securely controlled with multi-qubit entangled states. The unique signature of the transmitted message is generated by the signer without leaking information in imperfect channels. Whereas, the receiver can verify the validity of the signature using the quantum matching algorithm. The security is guaranteed by entanglement of quantum system for blind quantum computation. It provides a potential practical application for e-commerce in the cloud computing and first-generation quantum computation.

Measurement-only verifiable blind quantum computing with quantum input verification

NASA Astrophysics Data System (ADS)

Morimae, Tomoyuki

2016-10-01

Verifiable blind quantum computing is a secure delegated quantum computing where a client with a limited quantum technology delegates her quantum computing to a server who has a universal quantum computer. The client's privacy is protected (blindness), and the correctness of the computation is verifiable by the client despite her limited quantum technology (verifiability). There are mainly two types of protocols for verifiable blind quantum computing: the protocol where the client has only to generate single-qubit states and the protocol where the client needs only the ability of single-qubit measurements. The latter is called the measurement-only verifiable blind quantum computing. If the input of the client's quantum computing is a quantum state, whose classical efficient description is not known to the client, there was no way for the measurement-only client to verify the correctness of the input. Here we introduce a protocol of measurement-only verifiable blind quantum computing where the correctness of the quantum input is also verifiable.

Quantum analogue computing.

PubMed

Kendon, Vivien M; Nemoto, Kae; Munro, William J

2010-08-13

We briefly review what a quantum computer is, what it promises to do for us and why it is so hard to build one. Among the first applications anticipated to bear fruit is the quantum simulation of quantum systems. While most quantum computation is an extension of classical digital computation, quantum simulation differs fundamentally in how the data are encoded in the quantum computer. To perform a quantum simulation, the Hilbert space of the system to be simulated is mapped directly onto the Hilbert space of the (logical) qubits in the quantum computer. This type of direct correspondence is how data are encoded in a classical analogue computer. There is no binary encoding, and increasing precision becomes exponentially costly: an extra bit of precision doubles the size of the computer. This has important consequences for both the precision and error-correction requirements of quantum simulation, and significant open questions remain about its practicality. It also means that the quantum version of analogue computers, continuous-variable quantum computers, becomes an equally efficient architecture for quantum simulation. Lessons from past use of classical analogue computers can help us to build better quantum simulators in future.

Triple-server blind quantum computation using entanglement swapping

NASA Astrophysics Data System (ADS)

Li, Qin; Chan, Wai Hong; Wu, Chunhui; Wen, Zhonghua

2014-04-01

Blind quantum computation allows a client who does not have enough quantum resources or technologies to achieve quantum computation on a remote quantum server such that the client's input, output, and algorithm remain unknown to the server. Up to now, single- and double-server blind quantum computation have been considered. In this work, we propose a triple-server blind computation protocol where the client can delegate quantum computation to three quantum servers by the use of entanglement swapping. Furthermore, the three quantum servers can communicate with each other and the client is almost classical since one does not require any quantum computational power, quantum memory, and the ability to prepare any quantum states and only needs to be capable of getting access to quantum channels.

Quantum correlations from a room-temperature optomechanical cavity.

PubMed

Purdy, T P; Grutter, K E; Srinivasan, K; Taylor, J M

2017-06-23

The act of position measurement alters the motion of an object being measured. This quantum measurement backaction is typically much smaller than the thermal motion of a room-temperature object and thus difficult to observe. By shining laser light through a nanomechanical beam, we measure the beam's thermally driven vibrations and perturb its motion with optical force fluctuations at a level dictated by the Heisenberg measurement-disturbance uncertainty relation. We demonstrate a cross-correlation technique to distinguish optically driven motion from thermally driven motion, observing this quantum backaction signature up to room temperature. We use the scale of the quantum correlations, which is determined by fundamental constants, to gauge the size of thermal motion, demonstrating a path toward absolute thermometry with quantum mechanically calibrated ticks. Copyright © 2017 The Authors, some rights reserved; exclusive licensee American Association for the Advancement of Science. No claim to original U.S. Government Works.

How to Build a Quantum Computer

NASA Astrophysics Data System (ADS)

Sanders, Barry C.

2017-11-01

Quantum computer technology is progressing rapidly with dozens of qubits and hundreds of quantum logic gates now possible. Although current quantum computer technology is distant from being able to solve computational problems beyond the reach of non-quantum computers, experiments have progressed well beyond simply demonstrating the requisite components. We can now operate small quantum logic processors with connected networks of qubits and quantum logic gates, which is a great stride towards functioning quantum computers. This book aims to be accessible to a broad audience with basic knowledge of computers, electronics and physics. The goal is to convey key notions relevant to building quantum computers and to present state-of-the-art quantum-computer research in various media such as trapped ions, superconducting circuits, photonics and beyond.

Blind topological measurement-based quantum computation.

PubMed

Morimae, Tomoyuki; Fujii, Keisuke

2012-01-01

Blind quantum computation is a novel secure quantum-computing protocol that enables Alice, who does not have sufficient quantum technology at her disposal, to delegate her quantum computation to Bob, who has a fully fledged quantum computer, in such a way that Bob cannot learn anything about Alice's input, output and algorithm. A recent proof-of-principle experiment demonstrating blind quantum computation in an optical system has raised new challenges regarding the scalability of blind quantum computation in realistic noisy conditions. Here we show that fault-tolerant blind quantum computation is possible in a topologically protected manner using the Raussendorf-Harrington-Goyal scheme. The error threshold of our scheme is 4.3 × 10(-3), which is comparable to that (7.5 × 10(-3)) of non-blind topological quantum computation. As the error per gate of the order 10(-3) was already achieved in some experimental systems, our result implies that secure cloud quantum computation is within reach.

Blind topological measurement-based quantum computation

NASA Astrophysics Data System (ADS)

Morimae, Tomoyuki; Fujii, Keisuke

2012-09-01

Blind quantum computation is a novel secure quantum-computing protocol that enables Alice, who does not have sufficient quantum technology at her disposal, to delegate her quantum computation to Bob, who has a fully fledged quantum computer, in such a way that Bob cannot learn anything about Alice's input, output and algorithm. A recent proof-of-principle experiment demonstrating blind quantum computation in an optical system has raised new challenges regarding the scalability of blind quantum computation in realistic noisy conditions. Here we show that fault-tolerant blind quantum computation is possible in a topologically protected manner using the Raussendorf-Harrington-Goyal scheme. The error threshold of our scheme is 4.3×10-3, which is comparable to that (7.5×10-3) of non-blind topological quantum computation. As the error per gate of the order 10-3 was already achieved in some experimental systems, our result implies that secure cloud quantum computation is within reach.

Quantum coherent optical phase modulation in an ultrafast transmission electron microscope.

PubMed

Feist, Armin; Echternkamp, Katharina E; Schauss, Jakob; Yalunin, Sergey V; Schäfer, Sascha; Ropers, Claus

2015-05-14

Coherent manipulation of quantum systems with light is expected to be a cornerstone of future information and communication technology, including quantum computation and cryptography. The transfer of an optical phase onto a quantum wavefunction is a defining aspect of coherent interactions and forms the basis of quantum state preparation, synchronization and metrology. Light-phase-modulated electron states near atoms and molecules are essential for the techniques of attosecond science, including the generation of extreme-ultraviolet pulses and orbital tomography. In contrast, the quantum-coherent phase-modulation of energetic free-electron beams has not been demonstrated, although it promises direct access to ultrafast imaging and spectroscopy with tailored electron pulses on the attosecond scale. Here we demonstrate the coherent quantum state manipulation of free-electron populations in an electron microscope beam. We employ the interaction of ultrashort electron pulses with optical near-fields to induce Rabi oscillations in the populations of electron momentum states, observed as a function of the optical driving field. Excellent agreement with the scaling of an equal-Rabi multilevel quantum ladder is obtained, representing the observation of a light-driven 'quantum walk' coherently reshaping electron density in momentum space. We note that, after the interaction, the optically generated superposition of momentum states evolves into a train of attosecond electron pulses. Our results reveal the potential of quantum control for the precision structuring of electron densities, with possible applications ranging from ultrafast electron spectroscopy and microscopy to accelerator science and free-electron lasers.

Quantum coherent optical phase modulation in an ultrafast transmission electron microscope

NASA Astrophysics Data System (ADS)

Feist, Armin; Echternkamp, Katharina E.; Schauss, Jakob; Yalunin, Sergey V.; Schäfer, Sascha; Ropers, Claus

2015-05-01

Coherent manipulation of quantum systems with light is expected to be a cornerstone of future information and communication technology, including quantum computation and cryptography. The transfer of an optical phase onto a quantum wavefunction is a defining aspect of coherent interactions and forms the basis of quantum state preparation, synchronization and metrology. Light-phase-modulated electron states near atoms and molecules are essential for the techniques of attosecond science, including the generation of extreme-ultraviolet pulses and orbital tomography. In contrast, the quantum-coherent phase-modulation of energetic free-electron beams has not been demonstrated, although it promises direct access to ultrafast imaging and spectroscopy with tailored electron pulses on the attosecond scale. Here we demonstrate the coherent quantum state manipulation of free-electron populations in an electron microscope beam. We employ the interaction of ultrashort electron pulses with optical near-fields to induce Rabi oscillations in the populations of electron momentum states, observed as a function of the optical driving field. Excellent agreement with the scaling of an equal-Rabi multilevel quantum ladder is obtained, representing the observation of a light-driven `quantum walk' coherently reshaping electron density in momentum space. We note that, after the interaction, the optically generated superposition of momentum states evolves into a train of attosecond electron pulses. Our results reveal the potential of quantum control for the precision structuring of electron densities, with possible applications ranging from ultrafast electron spectroscopy and microscopy to accelerator science and free-electron lasers.

Quantum dynamics of light-driven chiral molecular motors.

PubMed

Yamaki, Masahiro; Nakayama, Shin-ichiro; Hoki, Kunihito; Kono, Hirohiko; Fujimura, Yuichi

2009-03-21

The results of theoretical studies on quantum dynamics of light-driven molecular motors with internal rotation are presented. Characteristic features of chiral motors driven by a non-helical, linearly polarized electric field of light are explained on the basis of symmetry argument. The rotational potential of the chiral motor is characterized by a ratchet form. The asymmetric potential determines the directional motion: the rotational direction is toward the gentle slope of the asymmetric potential. This direction is called the intuitive direction. To confirm the unidirectional rotational motion, results of quantum dynamical calculations of randomly-oriented molecular motors are presented. A theoretical design of the smallest light-driven molecular machine is presented. The smallest chiral molecular machine has an optically driven engine and a running propeller on its body. The mechanisms of transmission of driving forces from the engine to the propeller are elucidated by using a quantum dynamical treatment. The results provide a principle for control of optically-driven molecular bevel gears. Temperature effects are discussed using the density operator formalism. An effective method for ultrafast control of rotational motions in any desired direction is presented with the help of a quantum control theory. In this method, visible or UV light pulses are applied to drive the motor via an electronic excited state. A method for driving a large molecular motor consisting of an aromatic hydrocarbon is presented. The molecular motor is operated by interactions between the induced dipole of the molecular motor and the electric field of light pulses.

Demonstration of blind quantum computing.

PubMed

Barz, Stefanie; Kashefi, Elham; Broadbent, Anne; Fitzsimons, Joseph F; Zeilinger, Anton; Walther, Philip

2012-01-20

Quantum computers, besides offering substantial computational speedups, are also expected to preserve the privacy of a computation. We present an experimental demonstration of blind quantum computing in which the input, computation, and output all remain unknown to the computer. We exploit the conceptual framework of measurement-based quantum computation that enables a client to delegate a computation to a quantum server. Various blind delegated computations, including one- and two-qubit gates and the Deutsch and Grover quantum algorithms, are demonstrated. The client only needs to be able to prepare and transmit individual photonic qubits. Our demonstration is crucial for unconditionally secure quantum cloud computing and might become a key ingredient for real-life applications, especially when considering the challenges of making powerful quantum computers widely available.

77 FR 47003 - Endangered and Threatened Wildlife and Plants; 90-Day Finding on Petitions To List the Two Spring...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-08-07

... the Two Spring Mountains Dark Blue Butterflies and Morand's Checkerspot Butterfly as Endangered or... petitions to list the Spring Mountains dark blue butterflies (Euphilotes ancilla purpura and Euphilotes... dark blue butterflies presents substantial scientific or commercial information indicating that listing...

"Doch ein Begriff muss bei dem Worte sein": Some Thoughts on Electronically Annotated Literary Texts.

ERIC Educational Resources Information Center

Duncan, Bruce; Foelsche, Otmar K. E.

1995-01-01

Discusses the use of electronic glossaries, annotated texts, and other ancillae in German-as-a-Second-Language courses at the college level, and asserts that electronic media deliver lexical assistance far more effectively than do traditional methods, using texts in ways previously unavailable. (MDM)

The persistent current and energy spectrum on a driven mesoscopic LC-circuit with Josephson junction

NASA Astrophysics Data System (ADS)

Pahlavanias, Hassan

2018-03-01

The quantum theory for a mesoscopic electric circuit including a Josephson junction with charge discreteness is studied. By considering coupling energy of the mesoscopic capacitor in Josephson junction device, a Hamiltonian describing the dynamics of a quantum mesoscopic electric LC-circuit with charge discreteness is introduced. We first calculate the persistent current on a quantum driven ring including Josephson junction. Then we obtain the persistent current and energy spectrum of a quantum mesoscopic electrical circuit which includes capacitor, inductor, time-dependent external source and Josephson junction.

Quantum Computation: Entangling with the Future

NASA Technical Reports Server (NTRS)

Jiang, Zhang

2017-01-01

Commercial applications of quantum computation have become viable due to the rapid progress of the field in the recent years. Efficient quantum algorithms are discovered to cope with the most challenging real-world problems that are too hard for classical computers. Manufactured quantum hardware has reached unprecedented precision and controllability, enabling fault-tolerant quantum computation. Here, I give a brief introduction on what principles in quantum mechanics promise its unparalleled computational power. I will discuss several important quantum algorithms that achieve exponential or polynomial speedup over any classical algorithm. Building a quantum computer is a daunting task, and I will talk about the criteria and various implementations of quantum computers. I conclude the talk with near-future commercial applications of a quantum computer.

Undergraduate computational physics projects on quantum computing

NASA Astrophysics Data System (ADS)

Candela, D.

2015-08-01

Computational projects on quantum computing suitable for students in a junior-level quantum mechanics course are described. In these projects students write their own programs to simulate quantum computers. Knowledge is assumed of introductory quantum mechanics through the properties of spin 1/2. Initial, more easily programmed projects treat the basics of quantum computation, quantum gates, and Grover's quantum search algorithm. These are followed by more advanced projects to increase the number of qubits and implement Shor's quantum factoring algorithm. The projects can be run on a typical laptop or desktop computer, using most programming languages. Supplementing resources available elsewhere, the projects are presented here in a self-contained format especially suitable for a short computational module for physics students.

Experimental triple-slit interference in a strongly driven V-type artificial atom

NASA Astrophysics Data System (ADS)

Dada, Adetunmise C.; Santana, Ted S.; Koutroumanis, Antonios; Ma, Yong; Park, Suk-In; Song, Jindong; Gerardot, Brian D.

2017-08-01

Rabi oscillations of a two-level atom appear as a quantum interference effect between the amplitudes associated with atomic superpositions, in analogy with the classic double-slit experiment which manifests a sinusoidal interference pattern. By extension, through direct detection of time-resolved resonance fluorescence from a quantum-dot neutral exciton driven in the Rabi regime, we experimentally demonstrate triple-slit-type quantum interference via quantum erasure in a V-type three-level artificial atom. This result is of fundamental interest in the experimental studies of the properties of V-type three-level systems and may pave the way for further insight into their coherence properties as well as applications for quantum information schemes. It also suggests quantum dots as candidates for multipath-interference experiments for probing foundational concepts in quantum physics.

Quantum interference of electrically generated single photons from a quantum dot.

PubMed

Patel, Raj B; Bennett, Anthony J; Cooper, Ken; Atkinson, Paola; Nicoll, Christine A; Ritchie, David A; Shields, Andrew J

2010-07-09

Quantum interference lies at the foundation of many protocols for scalable quantum computing and communication with linear optics. To observe these effects the light source must emit photons that are indistinguishable. From a technological standpoint, it would be beneficial to have electrical control over the emission. Here we report of an electrically driven single-photon source emitting indistinguishable photons. The device consists of a layer of InAs quantum dots embedded in the intrinsic region of a p-i-n diode. Indistinguishability of consecutive photons is tested in a two-photon interference experiment under two modes of operation, continuous and pulsed current injection. We also present a complete theory based on the interference of photons with a Lorentzian spectrum which we compare to both our continuous wave and pulsed experiments. In the former case, a visibility was measured limited only by the timing resolution of our detection system. In the case of pulsed injection, we employ a two-pulse voltage sequence which suppresses multi-photon emission and allows us to carry out temporal filtering of photons which have undergone dephasing. The characteristic Hong-Ou-Mandel 'dip' is measured, resulting in a visibility of 64 +/- 4%.

Critical exponents of the disorder-driven superfluid-insulator transition in one-dimensional Bose-Einstein condensates

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cestari, J. C. C.; Foerster, A.; Gusmao, M. A.

2011-11-15

We investigate the nature of the superfluid-insulator quantum phase transition driven by disorder for noninteracting ultracold atoms on one-dimensional lattices. We consider two different cases: Anderson-type disorder, with local energies randomly distributed, and pseudodisorder due to a potential incommensurate with the lattice, which is usually called the Aubry-Andre model. A scaling analysis of numerical data for the superfluid fraction for different lattice sizes allows us to determine quantum critical exponents characterizing the disorder-driven superfluid-insulator transition. We also briefly discuss the effect of interactions close to the noninteracting quantum critical point of the Aubry-Andre model.

Loss of coherence and memory effects in quantum dynamics Loss of coherence and memory effects in quantum dynamics

NASA Astrophysics Data System (ADS)

Benatti, Fabio; Floreanini, Roberto; Scholes, Greg

2012-08-01

The last years have witnessed fast growing developments in the use of quantum mechanics in technology-oriented and information-related fields, especially in metrology, in the developments of nano-devices and in understanding highly efficient transport processes. The consequent theoretical and experimental outcomes are now driving new experimental tests of quantum mechanical effects with unprecedented accuracies that carry with themselves the concrete possibility of novel technological spin-offs. Indeed, the manifold advances in quantum optics, atom and ion manipulations, spintronics and nano-technologies are allowing direct experimental verifications of new ideas and their applications to a large variety of fields. All of these activities have revitalized interest in quantum mechanics and created a unique framework in which theoretical and experimental physics have become fruitfully tangled with information theory, computer, material and life sciences. This special issue aims to provide an overview of what is currently being pursued in the field and of what kind of theoretical reference frame is being developed together with the experimental and theoretical results. It consists of three sections: 1. Memory effects in quantum dynamics and quantum channels 2. Driven open quantum systems 3. Experiments concerning quantum coherence and/or decoherence The first two sections are theoretical and concerned with open quantum systems. In all of the above mentioned topics, the presence of an external environment needs to be taken into account, possibly in the presence of external controls and/or forcing, leading to driven open quantum systems. The open system paradigm has proven to be central in the analysis and understanding of many basic issues of quantum mechanics, such as the measurement problem, quantum communication and coherence, as well as for an ever growing number of applications. The theory is, however, well-settled only when the so-called Markovian or memoryless, approximation applies. When strong coupling or long environmental relaxation times make memory effects important for a realistic description of the dynamics, new strategies are asked for and the assessment of the general structure of non-Markovian dynamical equations for realistic systems is a crucial issue. The impact of quantum phenomena such as coherence and entanglement in biology has recently started to be considered as a possible source of the high efficiency of certain biological mechanisms, including e.g. light harvesting in photosynthesis and enzyme catalysis. In this effort, the relatively unknown territory of driven open quantum systems is being explored from various directions, with special attention to the creation and stability of coherent structures away from thermal equilibrium. These investigations are likely to advance our understanding of the scope and role of quantum mechanics in living systems; at the same time they provide new ideas for the developments of next generations of devices implementing highly efficient energy harvesting and conversion. The third section concerns experimental studies that are currently being pursued. Multidimensional nonlinear spectroscopy, in particular, has played an important role in enabling experimental detection of the signatures of coherence. Recent remarkable results suggest that coherence—both electronic and vibrational—survive for substantial timescales even in complex biological systems. The papers reported in this issue describe work at the forefront of this field, where researchers are seeking a detailed understanding of the experimental signatures of coherence and its implications for light-induced processes in biology and chemistry.

Blind topological measurement-based quantum computation

PubMed Central

Morimae, Tomoyuki; Fujii, Keisuke

2012-01-01

Blind quantum computation is a novel secure quantum-computing protocol that enables Alice, who does not have sufficient quantum technology at her disposal, to delegate her quantum computation to Bob, who has a fully fledged quantum computer, in such a way that Bob cannot learn anything about Alice's input, output and algorithm. A recent proof-of-principle experiment demonstrating blind quantum computation in an optical system has raised new challenges regarding the scalability of blind quantum computation in realistic noisy conditions. Here we show that fault-tolerant blind quantum computation is possible in a topologically protected manner using the Raussendorf–Harrington–Goyal scheme. The error threshold of our scheme is 4.3×10−3, which is comparable to that (7.5×10−3) of non-blind topological quantum computation. As the error per gate of the order 10−3 was already achieved in some experimental systems, our result implies that secure cloud quantum computation is within reach. PMID:22948818

Quantum computation for solving linear systems

NASA Astrophysics Data System (ADS)

Cao, Yudong

Quantum computation is a subject born out of the combination between physics and computer science. It studies how the laws of quantum mechanics can be exploited to perform computations much more efficiently than current computers (termed classical computers as oppose to quantum computers). The thesis starts by introducing ideas from quantum physics and theoretical computer science and based on these ideas, introducing the basic concepts in quantum computing. These introductory discussions are intended for non-specialists to obtain the essential knowledge needed for understanding the new results presented in the subsequent chapters. After introducing the basics of quantum computing, we focus on the recently proposed quantum algorithm for linear systems. The new results include i) special instances of quantum circuits that can be implemented using current experimental resources; ii) detailed quantum algorithms that are suitable for a broader class of linear systems. We show that for some particular problems the quantum algorithm is able to achieve exponential speedup over their classical counterparts.

Abstract quantum computing machines and quantum computational logics

NASA Astrophysics Data System (ADS)

Chiara, Maria Luisa Dalla; Giuntini, Roberto; Sergioli, Giuseppe; Leporini, Roberto

2016-06-01

Classical and quantum parallelism are deeply different, although it is sometimes claimed that quantum Turing machines are nothing but special examples of classical probabilistic machines. We introduce the concepts of deterministic state machine, classical probabilistic state machine and quantum state machine. On this basis, we discuss the question: To what extent can quantum state machines be simulated by classical probabilistic state machines? Each state machine is devoted to a single task determined by its program. Real computers, however, behave differently, being able to solve different kinds of problems. This capacity can be modeled, in the quantum case, by the mathematical notion of abstract quantum computing machine, whose different programs determine different quantum state machines. The computations of abstract quantum computing machines can be linguistically described by the formulas of a particular form of quantum logic, termed quantum computational logic.

Electrically driven nanopillars for THz quantum cascade lasers.

PubMed

Amanti, M I; Bismuto, A; Beck, M; Isa, L; Kumar, K; Reimhult, E; Faist, J

2013-05-06

In this work we present a rapid and parallel process for the fabrication of large scale arrays of electrically driven nanopillars for THz quantum cascade active media. We demonstrate electrical injection of pillars of 200 nm diameter and 2 µm height, over a surface of 1 mm(2). THz electroluminescence from the nanopillars is reported. This result is a promising step toward the realization of zero-dimensional structure for terahertz quantum cascade lasers.

Some foundational aspects of quantum computers and quantum robots.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Benioff, P.; Physics

1998-01-01

This paper addresses foundational issues related to quantum computing. The need for a universally valid theory such as quantum mechanics to describe to some extent its own validation is noted. This includes quantum mechanical descriptions of systems that do theoretical calculations (i.e. quantum computers) and systems that perform experiments. Quantum robots interacting with an environment are a small first step in this direction. Quantum robots are described here as mobile quantum systems with on-board quantum computers that interact with environments. Included are discussions on the carrying out of tasks and the division of tasks into computation and action phases. Specificmore » models based on quantum Turing machines are described. Differences and similarities between quantum robots plus environments and quantum computers are discussed.« less

Quantum computers: Definition and implementations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Perez-Delgado, Carlos A.; Kok, Pieter

The DiVincenzo criteria for implementing a quantum computer have been seminal in focusing both experimental and theoretical research in quantum-information processing. These criteria were formulated specifically for the circuit model of quantum computing. However, several new models for quantum computing (paradigms) have been proposed that do not seem to fit the criteria well. Therefore, the question is what are the general criteria for implementing quantum computers. To this end, a formal operational definition of a quantum computer is introduced. It is then shown that, according to this definition, a device is a quantum computer if it obeys the following criteria:more » Any quantum computer must consist of a quantum memory, with an additional structure that (1) facilitates a controlled quantum evolution of the quantum memory; (2) includes a method for information theoretic cooling of the memory; and (3) provides a readout mechanism for subsets of the quantum memory. The criteria are met when the device is scalable and operates fault tolerantly. We discuss various existing quantum computing paradigms and how they fit within this framework. Finally, we present a decision tree for selecting an avenue toward building a quantum computer. This is intended to help experimentalists determine the most natural paradigm given a particular physical implementation.« less

Nonclassicality and Entanglement in multimode radiation fields under the action of classicality preserving devices

NASA Astrophysics Data System (ADS)

Chaturvedi, S.

2011-09-01

In this work we examine the possibilities of converting quantum optical nonclassicality into entanglement in multimode under the action of classicality preserving devices such as beamsplitters. While the single mode case is amenable to a complete analysis, non availability of certain crucial results in the classical theory of moments in the multimode situations forces us to treat these cases with lesser degree of generality by taking recourse to the familiar Mandel matrix and its extensions. We generalize the Mandel matrix from one-mode states to the two-mode situation, leading to a natural classification of states with varying levels of nonclassicality. For two-mode states we present a single test which, if successful, simultaneouly witnesses nonclassicality as well as NPT entanglement. We develop a test for NPT entanglement after beamsplitter action on a nonclassical state, designed in such a way that it remains `close' to that for nonclassicality. In the same spirit we analyse the result of three-mode `beamsplitter' action after coupling to an ancilla in the Fock ground state. The concept of genuine tripartite entanglement and scalar measures of nonclassicality at the Mandel level for two mode systems are discussed and illustrated with the help of several examples.

Quantum simulator review

NASA Astrophysics Data System (ADS)

Bednar, Earl; Drager, Steven L.

2007-04-01

Quantum information processing's objective is to utilize revolutionary computing capability based on harnessing the paradigm shift offered by quantum computing to solve classically hard and computationally challenging problems. Some of our computationally challenging problems of interest include: the capability for rapid image processing, rapid optimization of logistics, protecting information, secure distributed simulation, and massively parallel computation. Currently, one important problem with quantum information processing is that the implementation of quantum computers is difficult to realize due to poor scalability and great presence of errors. Therefore, we have supported the development of Quantum eXpress and QuIDD Pro, two quantum computer simulators running on classical computers for the development and testing of new quantum algorithms and processes. This paper examines the different methods used by these two quantum computing simulators. It reviews both simulators, highlighting each simulators background, interface, and special features. It also demonstrates the implementation of current quantum algorithms on each simulator. It concludes with summary comments on both simulators.

Quantum Stochastic Trajectories: The Fokker-Planck-Bohm Equation Driven by the Reduced Density Matrix.

PubMed

Avanzini, Francesco; Moro, Giorgio J

2018-03-15

The quantum molecular trajectory is the deterministic trajectory, arising from the Bohm theory, that describes the instantaneous positions of the nuclei of molecules by assuring the agreement with the predictions of quantum mechanics. Therefore, it provides the suitable framework for representing the geometry and the motions of molecules without neglecting their quantum nature. However, the quantum molecular trajectory is extremely demanding from the computational point of view, and this strongly limits its applications. To overcome such a drawback, we derive a stochastic representation of the quantum molecular trajectory, through projection operator techniques, for the degrees of freedom of an open quantum system. The resulting Fokker-Planck operator is parametrically dependent upon the reduced density matrix of the open system. Because of the pilot role played by the reduced density matrix, this stochastic approach is able to represent accurately the main features of the open system motions both at equilibrium and out of equilibrium with the environment. To verify this procedure, the predictions of the stochastic and deterministic representation are compared for a model system of six interacting harmonic oscillators, where one oscillator is taken as the open quantum system of interest. The undeniable advantage of the stochastic approach is that of providing a simplified and self-contained representation of the dynamics of the open system coordinates. Furthermore, it can be employed to study the out of equilibrium dynamics and the relaxation of quantum molecular motions during photoinduced processes, like photoinduced conformational changes and proton transfers.

The role of the tunneling matrix element and nuclear reorganization in the design of quantum-dot cellular automata molecules

NASA Astrophysics Data System (ADS)

Henry, Jackson; Blair, Enrique P.

2018-02-01

Mixed-valence molecules provide an implementation for a high-speed, energy-efficient paradigm for classical computing known as quantum-dot cellular automata (QCA). The primitive device in QCA is a cell, a structure with multiple quantum dots and a few mobile charges. A single mixed-valence molecule can function as a cell, with redox centers providing quantum dots. The charge configuration of a molecule encodes binary information, and device switching occurs via intramolecular electron transfer between dots. Arrays of molecular cells adsorbed onto a substrate form QCA logic. Individual cells in the array are coupled locally via the electrostatic electric field. This device networking enables general-purpose computing. Here, a quantum model of a two-dot molecule is built in which the two-state electronic system is coupled to the dominant nuclear vibrational mode via a reorganization energy. This model is used to explore the effects of the electronic inter-dot tunneling (coupling) matrix element and the reorganization energy on device switching. A semi-classical reduction of the model also is made to investigate the competition between field-driven device switching and the electron-vibrational self-trapping. A strong electron-vibrational coupling (high reorganization energy) gives rise to self-trapping, which inhibits the molecule's ability to switch. Nonetheless, there remains an expansive area in the tunneling-reorganization phase space where molecules can support adequate tunneling. Thus, the relationship between the tunneling matrix element and the reorganization energy affords significant leeway in the design of molecules viable for QCA applications.

Quantum walk computation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kendon, Viv

2014-12-04

Quantum versions of random walks have diverse applications that are motivating experimental implementations as well as theoretical studies. Recent results showing quantum walks are “universal for quantum computation” relate to algorithms, to be run on quantum computers. We consider whether an experimental implementation of a quantum walk could provide useful computation before we have a universal quantum computer.

Molecular mechanism of NDMA formation from N,N-dimethylsulfamide during ozonation: quantum chemical insights into a bromide-catalyzed pathway.

PubMed

Trogolo, Daniela; Mishra, Brijesh Kumar; Heeb, Michèle B; von Gunten, Urs; Arey, J Samuel

2015-04-07

During ozonation of drinking water, the fungicide metabolite N,N-dimethylsulfamide (DMS) can be transformed into a highly toxic product, N-nitrosodimethylamine (NDMA). We used quantum chemical computations and stopped-flow experiments to evaluate a chemical mechanism proposed previously to describe this transformation. Stopped-flow experiments indicate a pK(a) = 10.4 for DMS. Experiments show that hypobromous acid (HOBr), generated by ozone oxidation of naturally occurring bromide, brominates the deprotonated DMS(-) anion with a near-diffusion controlled rate constant (7.1 ± 0.6 × 10(8) M(-1) s(-1)), forming Br-DMS(-) anion. According to quantum chemical calculations, Br-DMS has a pK(a) ∼ 9.0 and thus remains partially deprotonated at neutral pH. The anionic Br-DMS(-) bromamine can react with ozone with a high rate constant (10(5 ± 2.5) M(-1) s(-1)), forming the reaction intermediate (BrNO)(SO2)N(CH3)2(-). This intermediate resembles a loosely bound complex between an electrophilic nitrosyl bromide (BrNO) molecule and an electron-rich dimethylaminosulfinate ((SO2)N(CH3)2(-)) fragment, based on inspection of computed natural charges and geometric parameters. This fragile complex undergoes immediate (10(10 ± 2.5) s(-1)) reaction by two branches: an exothermic channel that produces NDMA, and an entropy-driven channel giving non-NDMA products. Computational results bring new insights into the electronic nature, chemical equilibria, and kinetics of the elementary reactions of this pathway, enabled by computed energies of structures that are not possible to access experimentally.

Quantum simulations with noisy quantum computers

NASA Astrophysics Data System (ADS)

Gambetta, Jay

Quantum computing is a new computational paradigm that is expected to lie beyond the standard model of computation. This implies a quantum computer can solve problems that can't be solved by a conventional computer with tractable overhead. To fully harness this power we need a universal fault-tolerant quantum computer. However the overhead in building such a machine is high and a full solution appears to be many years away. Nevertheless, we believe that we can build machines in the near term that cannot be emulated by a conventional computer. It is then interesting to ask what these can be used for. In this talk we will present our advances in simulating complex quantum systems with noisy quantum computers. We will show experimental implementations of this on some small quantum computers.

Coherent perfect absorption in a quantum nonlinear regime of cavity quantum electrodynamics

NASA Astrophysics Data System (ADS)

Wei, Yang-hua; Gu, Wen-ju; Yang, Guoqing; Zhu, Yifu; Li, Gao-xiang

2018-05-01

Coherent perfect absorption (CPA) is investigated in the quantum nonlinear regime of cavity quantum electrodynamics (CQED), in which a single two-level atom couples to a single-mode cavity weakly driven by two identical laser fields. In the strong-coupling regime and due to the photon blockade effect, the weakly driven CQED system can be described as a quantum system with three polariton states. CPA is achieved at a critical input field strength when the frequency of the input fields matches the polariton transition frequency. In the quantum nonlinear regime, the incoherent dissipation processes such as atomic and photon decays place a lower bound for the purity of the intracavity quantum field. Our results show that under the CPA condition, the intracavity field always exhibits the quadrature squeezing property manifested by the quantum nonlinearity, and the outgoing photon flux displays the super-Poissonian distribution.

Parametrically driven hybrid qubit-photon systems: Dissipation-induced quantum entanglement and photon production from vacuum

NASA Astrophysics Data System (ADS)

Remizov, S. V.; Zhukov, A. A.; Shapiro, D. S.; Pogosov, W. V.; Lozovik, Yu. E.

2017-10-01

We consider a dissipative evolution of a parametrically driven qubit-cavity system under the periodic modulation of coupling energy between two subsystems, which leads to the amplification of counter-rotating processes. We reveal a very rich dynamical behavior of this hybrid system. In particular, we find that the energy dissipation in one of the subsystems can enhance quantum effects in another subsystem. For instance, optimal cavity decay assists the stabilization of entanglement and quantum correlations between qubits even in the steady state and the compensation of finite qubit relaxation. On the contrary, energy dissipation in qubit subsystems results in enhanced photon production from vacuum for strong modulation but destroys both quantum concurrence and quantum mutual information between qubits. Our results provide deeper insights to nonstationary cavity quantum electrodynamics in the context of quantum information processing and might be of importance for dissipative quantum state engineering.

Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network.

PubMed

Goto, Hayato

2016-02-22

The dynamics of nonlinear systems qualitatively change depending on their parameters, which is called bifurcation. A quantum-mechanical nonlinear oscillator can yield a quantum superposition of two oscillation states, known as a Schrödinger cat state, via quantum adiabatic evolution through its bifurcation point. Here we propose a quantum computer comprising such quantum nonlinear oscillators, instead of quantum bits, to solve hard combinatorial optimization problems. The nonlinear oscillator network finds optimal solutions via quantum adiabatic evolution, where nonlinear terms are increased slowly, in contrast to conventional adiabatic quantum computation or quantum annealing, where quantum fluctuation terms are decreased slowly. As a result of numerical simulations, it is concluded that quantum superposition and quantum fluctuation work effectively to find optimal solutions. It is also notable that the present computer is analogous to neural computers, which are also networks of nonlinear components. Thus, the present scheme will open new possibilities for quantum computation, nonlinear science, and artificial intelligence.

Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network

NASA Astrophysics Data System (ADS)

Goto, Hayato

2016-02-01

The dynamics of nonlinear systems qualitatively change depending on their parameters, which is called bifurcation. A quantum-mechanical nonlinear oscillator can yield a quantum superposition of two oscillation states, known as a Schrödinger cat state, via quantum adiabatic evolution through its bifurcation point. Here we propose a quantum computer comprising such quantum nonlinear oscillators, instead of quantum bits, to solve hard combinatorial optimization problems. The nonlinear oscillator network finds optimal solutions via quantum adiabatic evolution, where nonlinear terms are increased slowly, in contrast to conventional adiabatic quantum computation or quantum annealing, where quantum fluctuation terms are decreased slowly. As a result of numerical simulations, it is concluded that quantum superposition and quantum fluctuation work effectively to find optimal solutions. It is also notable that the present computer is analogous to neural computers, which are also networks of nonlinear components. Thus, the present scheme will open new possibilities for quantum computation, nonlinear science, and artificial intelligence.

Holographic RG flows on curved manifolds and quantum phase transitions

NASA Astrophysics Data System (ADS)

Ghosh, J. K.; Kiritsis, E.; Nitti, F.; Witkowski, L. T.

2018-05-01

Holographic RG flows dual to QFTs on maximally symmetric curved manifolds (dS d , AdS d , and S d ) are considered in the framework of Einstein-dilaton gravity in d + 1 dimensions. A general dilaton potential is used and the flows are driven by a scalar relevant operator. The general properties of such flows are analyzed and the UV and IR asymptotics computed. New RG flows can appear at finite curvature which do not have a zero curvature counterpart. The so-called `bouncing' flows, where the β-function has a branch cut at which it changes sign, are found to persist at finite curvature. Novel quantum first-order phase transitions are found, triggered by a variation in the d-dimensional curvature in theories allowing multiple ground states.

Mixed quantum/classical theory of rotationally and vibrationally inelastic scattering in space-fixed and body-fixed reference frames

NASA Astrophysics Data System (ADS)

Semenov, Alexander; Babikov, Dmitri

2013-11-01

We formulated the mixed quantum/classical theory for rotationally and vibrationally inelastic scattering process in the diatomic molecule + atom system. Two versions of theory are presented, first in the space-fixed and second in the body-fixed reference frame. First version is easy to derive and the resultant equations of motion are transparent, but the state-to-state transition matrix is complex-valued and dense. Such calculations may be computationally demanding for heavier molecules and/or higher temperatures, when the number of accessible channels becomes large. In contrast, the second version of theory requires some tedious derivations and the final equations of motion are rather complicated (not particularly intuitive). However, the state-to-state transitions are driven by real-valued sparse matrixes of much smaller size. Thus, this formulation is the method of choice from the computational point of view, while the space-fixed formulation can serve as a test of the body-fixed equations of motion, and the code. Rigorous numerical tests were carried out for a model system to ensure that all equations, matrixes, and computer codes in both formulations are correct.

Fault tolerant filtering and fault detection for quantum systems driven by fields in single photon states

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gao, Qing, E-mail: qing.gao.chance@gmail.com; Dong, Daoyi, E-mail: daoyidong@gmail.com; Petersen, Ian R., E-mail: i.r.petersen@gmai.com

The purpose of this paper is to solve the fault tolerant filtering and fault detection problem for a class of open quantum systems driven by a continuous-mode bosonic input field in single photon states when the systems are subject to stochastic faults. Optimal estimates of both the system observables and the fault process are simultaneously calculated and characterized by a set of coupled recursive quantum stochastic differential equations.

Computation and Dynamics: Classical and Quantum

NASA Astrophysics Data System (ADS)

Kisil, Vladimir V.

2010-05-01

We discuss classical and quantum computations in terms of corresponding Hamiltonian dynamics. This allows us to introduce quantum computations which involve parallel processing of both: the data and programme instructions. Using mixed quantum-classical dynamics we look for a full cost of computations on quantum computers with classical terminals.

Hoop Dreams Deferred?

ERIC Educational Resources Information Center

Buckner, Candace

2012-01-01

Rondell Gardner, a senior at Roosevelt Career and Technical High School--a school located in the heart of a city that's on life support--has a way out of Gary, Indiana. To him, it's an orange leather ball. Ancilla College (Indiana) has offered a scholarship; Indiana University Northwest has him on its radar; and Northern Michigan has expressed an…

Quantum chemistry simulation on quantum computers: theories and experiments.

PubMed

Lu, Dawei; Xu, Boruo; Xu, Nanyang; Li, Zhaokai; Chen, Hongwei; Peng, Xinhua; Xu, Ruixue; Du, Jiangfeng

2012-07-14

It has been claimed that quantum computers can mimic quantum systems efficiently in the polynomial scale. Traditionally, those simulations are carried out numerically on classical computers, which are inevitably confronted with the exponential growth of required resources, with the increasing size of quantum systems. Quantum computers avoid this problem, and thus provide a possible solution for large quantum systems. In this paper, we first discuss the ideas of quantum simulation, the background of quantum simulators, their categories, and the development in both theories and experiments. We then present a brief introduction to quantum chemistry evaluated via classical computers followed by typical procedures of quantum simulation towards quantum chemistry. Reviewed are not only theoretical proposals but also proof-of-principle experimental implementations, via a small quantum computer, which include the evaluation of the static molecular eigenenergy and the simulation of chemical reaction dynamics. Although the experimental development is still behind the theory, we give prospects and suggestions for future experiments. We anticipate that in the near future quantum simulation will become a powerful tool for quantum chemistry over classical computations.

ASCR Workshop on Quantum Computing for Science

DOE Office of Scientific and Technical Information (OSTI.GOV)

Aspuru-Guzik, Alan; Van Dam, Wim; Farhi, Edward

This report details the findings of the DOE ASCR Workshop on Quantum Computing for Science that was organized to assess the viability of quantum computing technologies to meet the computational requirements of the DOE’s science and energy mission, and to identify the potential impact of quantum technologies. The workshop was held on February 17-18, 2015, in Bethesda, MD, to solicit input from members of the quantum computing community. The workshop considered models of quantum computation and programming environments, physical science applications relevant to DOE's science mission as well as quantum simulation, and applied mathematics topics including potential quantum algorithms formore » linear algebra, graph theory, and machine learning. This report summarizes these perspectives into an outlook on the opportunities for quantum computing to impact problems relevant to the DOE’s mission as well as the additional research required to bring quantum computing to the point where it can have such impact.« less

Design of a universal logic block for fault-tolerant realization of any logic operation in trapped-ion quantum circuits

NASA Astrophysics Data System (ADS)

Goudarzi, H.; Dousti, M. J.; Shafaei, A.; Pedram, M.

2014-05-01

This paper presents a physical mapping tool for quantum circuits, which generates the optimal universal logic block (ULB) that can, on average, perform any logical fault-tolerant (FT) quantum operations with the minimum latency. The operation scheduling, placement, and qubit routing problems tackled by the quantum physical mapper are highly dependent on one another. More precisely, the scheduling solution affects the quality of the achievable placement solution due to resource pressures that may be created as a result of operation scheduling, whereas the operation placement and qubit routing solutions influence the scheduling solution due to resulting distances between predecessor and current operations, which in turn determines routing latencies. The proposed flow for the quantum physical mapper captures these dependencies by applying (1) a loose scheduling step, which transforms an initial quantum data flow graph into one that explicitly captures the no-cloning theorem of the quantum computing and then performs instruction scheduling based on a modified force-directed scheduling approach to minimize the resource contention and quantum circuit latency, (2) a placement step, which uses timing-driven instruction placement to minimize the approximate routing latencies while making iterative calls to the aforesaid force-directed scheduler to correct scheduling levels of quantum operations as needed, and (3) a routing step that finds dynamic values of routing latencies for the qubits. In addition to the quantum physical mapper, an approach is presented to determine the single best ULB size for a target quantum circuit by examining the latency of different FT quantum operations mapped onto different ULB sizes and using information about the occurrence frequency of operations on critical paths of the target quantum algorithm to weigh these latencies. Experimental results show an average latency reduction of about 40 % compared to previous work.

On the hypothesis that quantum mechanism manifests classical mechanics: Numerical approach to the correspondence in search of quantum chaos

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lee, Sang-Bong

1993-09-01

Quantum manifestation of classical chaos has been one of the extensively studied subjects for more than a decade. Yet clear understanding of its nature still remains to be an open question partly due to the lack of a canonical definition of quantum chaos. The classical definition seems to be unsuitable in quantum mechanics partly because of the Heisenberg quantum uncertainty. In this regard, quantum chaos is somewhat misleading and needs to be clarified at the very fundamental level of physics. Since it is well known that quantum mechanics is more fundamental than classical mechanics, the quantum description of classically chaoticmore » nature should be attainable in the limit of large quantum numbers. The focus of my research, therefore, lies on the correspondence principle for classically chaotic systems. The chaotic damped driven pendulum is mainly studied numerically using the split operator method that solves the time-dependent Schroedinger equation. For classically dissipative chaotic systems in which (multi)fractal strange attractors often emerge, several quantum dissipative mechanisms are also considered. For instance, Hoover`s and Kubo-Fox-Keizer`s approaches are studied with some computational analyses. But the notion of complex energy with non-Hermiticity is extensively applied. Moreover, the Wigner and Husimi distribution functions are examined with an equivalent classical distribution in phase-space, and dynamical properties of the wave packet in configuration and momentum spaces are also explored. The results indicate that quantum dynamics embraces classical dynamics although the classicalquantum correspondence fails to be observed in the classically chaotic regime. Even in the semi-classical limits, classically chaotic phenomena would eventually be suppressed by the quantum uncertainty.« less

One-way quantum computing in superconducting circuits

NASA Astrophysics Data System (ADS)

Albarrán-Arriagada, F.; Alvarado Barrios, G.; Sanz, M.; Romero, G.; Lamata, L.; Retamal, J. C.; Solano, E.

2018-03-01

We propose a method for the implementation of one-way quantum computing in superconducting circuits. Measurement-based quantum computing is a universal quantum computation paradigm in which an initial cluster state provides the quantum resource, while the iteration of sequential measurements and local rotations encodes the quantum algorithm. Up to now, technical constraints have limited a scalable approach to this quantum computing alternative. The initial cluster state can be generated with available controlled-phase gates, while the quantum algorithm makes use of high-fidelity readout and coherent feedforward. With current technology, we estimate that quantum algorithms with above 20 qubits may be implemented in the path toward quantum supremacy. Moreover, we propose an alternative initial state with properties of maximal persistence and maximal connectedness, reducing the required resources of one-way quantum computing protocols.

Quantum Spin Glasses, Annealing and Computation

NASA Astrophysics Data System (ADS)

Chakrabarti, Bikas K.; Inoue, Jun-ichi; Tamura, Ryo; Tanaka, Shu

2017-05-01

List of tables; List of figures, Preface; 1. Introduction; Part I. Quantum Spin Glass, Annealing and Computation: 2. Classical spin models from ferromagnetic spin systems to spin glasses; 3. Simulated annealing; 4. Quantum spin glass; 5. Quantum dynamics; 6. Quantum annealing; Part II. Additional Notes: 7. Notes on adiabatic quantum computers; 8. Quantum information and quenching dynamics; 9. A brief historical note on the studies of quantum glass, annealing and computation.

Quantum-Enhanced Cyber Security: Experimental Computation on Quantum-Encrypted Data

DTIC Science & Technology

2017-03-02

AFRL-AFOSR-UK-TR-2017-0020 Quantum-Enhanced Cyber Security: Experimental Computation on Quantum-Encrypted Data Philip Walther UNIVERSITT WIEN Final...REPORT TYPE Final 3. DATES COVERED (From - To) 15 Oct 2015 to 31 Dec 2016 4. TITLE AND SUBTITLE Quantum-Enhanced Cyber Security: Experimental Computation...FORM SF 298 Final Report for FA9550-1-6-1-0004 Quantum-enhanced cyber security: Experimental quantum computation with quantum-encrypted data

Computing quantum discord is NP-complete

NASA Astrophysics Data System (ADS)

Huang, Yichen

2014-03-01

We study the computational complexity of quantum discord (a measure of quantum correlation beyond entanglement), and prove that computing quantum discord is NP-complete. Therefore, quantum discord is computationally intractable: the running time of any algorithm for computing quantum discord is believed to grow exponentially with the dimension of the Hilbert space so that computing quantum discord in a quantum system of moderate size is not possible in practice. As by-products, some entanglement measures (namely entanglement cost, entanglement of formation, relative entropy of entanglement, squashed entanglement, classical squashed entanglement, conditional entanglement of mutual information, and broadcast regularization of mutual information) and constrained Holevo capacity are NP-hard/NP-complete to compute. These complexity-theoretic results are directly applicable in common randomness distillation, quantum state merging, entanglement distillation, superdense coding, and quantum teleportation; they may offer significant insights into quantum information processing. Moreover, we prove the NP-completeness of two typical problems: linear optimization over classical states and detecting classical states in a convex set, providing evidence that working with classical states is generically computationally intractable.

Heat engine driven by purely quantum information.

PubMed

Park, Jung Jun; Kim, Kang-Hwan; Sagawa, Takahiro; Kim, Sang Wook

2013-12-06

The key question of this Letter is whether work can be extracted from a heat engine by using purely quantum mechanical information. If the answer is yes, what is its mathematical formula? First, by using a bipartite memory we show that the work extractable from a heat engine is bounded not only by the free energy change and the sum of the entropy change of an individual memory but also by the change of quantum mutual information contained inside the memory. We then find that the engine can be driven by purely quantum information, expressed as the so-called quantum discord, forming a part of the quantum mutual information. To confirm it, as a physical example we present the Szilard engine containing a diatomic molecule with a semipermeable wall.

Quantum Computation

NASA Astrophysics Data System (ADS)

Aharonov, Dorit

In the last few years, theoretical study of quantum systems serving as computational devices has achieved tremendous progress. We now have strong theoretical evidence that quantum computers, if built, might be used as a dramatically powerful computational tool, capable of performing tasks which seem intractable for classical computers. This review is about to tell the story of theoretical quantum computation. I l out the developing topic of experimental realizations of the model, and neglected other closely related topics which are quantum information and quantum communication. As a result of narrowing the scope of this paper, I hope it has gained the benefit of being an almost self contained introduction to the exciting field of quantum computation. The review begins with background on theoretical computer science, Turing machines and Boolean circuits. In light of these models, I define quantum computers, and discuss the issue of universal quantum gates. Quantum algorithms, including Shor's factorization algorithm and Grover's algorithm for searching databases, are explained. I will devote much attention to understanding what the origins of the quantum computational power are, and what the limits of this power are. Finally, I describe the recent theoretical results which show that quantum computers maintain their complexity power even in the presence of noise, inaccuracies and finite precision. This question cannot be separated from that of quantum complexity because any realistic model will inevitably be subjected to such inaccuracies. I tried to put all results in their context, asking what the implications to other issues in computer science and physics are. In the end of this review, I make these connections explicit by discussing the possible implications of quantum computation on fundamental physical questions such as the transition from quantum to classical physics.

Quantum Computing: Selected Internet Resources for Librarians, Researchers, and the Casually Curious

ERIC Educational Resources Information Center

Cirasella, Jill

2009-01-01

This article presents an annotated selection of the most important and informative Internet resources for learning about quantum computing, finding quantum computing literature, and tracking quantum computing news. All of the quantum computing resources described in this article are freely available, English-language web sites that fall into one…

Contextuality as a Resource for Models of Quantum Computation with Qubits

NASA Astrophysics Data System (ADS)

Bermejo-Vega, Juan; Delfosse, Nicolas; Browne, Dan E.; Okay, Cihan; Raussendorf, Robert

2017-09-01

A central question in quantum computation is to identify the resources that are responsible for quantum speed-up. Quantum contextuality has been recently shown to be a resource for quantum computation with magic states for odd-prime dimensional qudits and two-dimensional systems with real wave functions. The phenomenon of state-independent contextuality poses a priori an obstruction to characterizing the case of regular qubits, the fundamental building block of quantum computation. Here, we establish contextuality of magic states as a necessary resource for a large class of quantum computation schemes on qubits. We illustrate our result with a concrete scheme related to measurement-based quantum computation.

Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network

PubMed Central

Goto, Hayato

2016-01-01

The dynamics of nonlinear systems qualitatively change depending on their parameters, which is called bifurcation. A quantum-mechanical nonlinear oscillator can yield a quantum superposition of two oscillation states, known as a Schrödinger cat state, via quantum adiabatic evolution through its bifurcation point. Here we propose a quantum computer comprising such quantum nonlinear oscillators, instead of quantum bits, to solve hard combinatorial optimization problems. The nonlinear oscillator network finds optimal solutions via quantum adiabatic evolution, where nonlinear terms are increased slowly, in contrast to conventional adiabatic quantum computation or quantum annealing, where quantum fluctuation terms are decreased slowly. As a result of numerical simulations, it is concluded that quantum superposition and quantum fluctuation work effectively to find optimal solutions. It is also notable that the present computer is analogous to neural computers, which are also networks of nonlinear components. Thus, the present scheme will open new possibilities for quantum computation, nonlinear science, and artificial intelligence. PMID:26899997

Hybrid quantum-classical modeling of quantum dot devices

NASA Astrophysics Data System (ADS)

Kantner, Markus; Mittnenzweig, Markus; Koprucki, Thomas

2017-11-01

The design of electrically driven quantum dot devices for quantum optical applications asks for modeling approaches combining classical device physics with quantum mechanics. We connect the well-established fields of semiclassical semiconductor transport theory and the theory of open quantum systems to meet this requirement. By coupling the van Roosbroeck system with a quantum master equation in Lindblad form, we introduce a new hybrid quantum-classical modeling approach, which provides a comprehensive description of quantum dot devices on multiple scales: it enables the calculation of quantum optical figures of merit and the spatially resolved simulation of the current flow in realistic semiconductor device geometries in a unified way. We construct the interface between both theories in such a way, that the resulting hybrid system obeys the fundamental axioms of (non)equilibrium thermodynamics. We show that our approach guarantees the conservation of charge, consistency with the thermodynamic equilibrium and the second law of thermodynamics. The feasibility of the approach is demonstrated by numerical simulations of an electrically driven single-photon source based on a single quantum dot in the stationary and transient operation regime.

Architectures and Applications for Scalable Quantum Information Systems

DTIC Science & Technology

2007-01-01

quantum computation models, such as adiabatic quantum computing , can be converted to quantum circuits. Therefore, in our design flow’s first phase...vol. 26, no. 5, pp. 1484–1509, 1997. [19] A. Childs, E. Farhi, and J. Preskill, “Robustness of adiabatic quantum computation ,” Phys. Rev. A, vol. 65...magnetic resonance computer with three quantum bits that simulates an adiabatic quantum optimization algorithm. Adiabatic

QCE: A Simulator for Quantum Computer Hardware

NASA Astrophysics Data System (ADS)

Michielsen, Kristel; de Raedt, Hans

2003-09-01

The Quantum Computer Emulator (QCE) described in this paper consists of a simulator of a generic, general purpose quantum computer and a graphical user interface. The latter is used to control the simulator, to define the hardware of the quantum computer and to debug and execute quantum algorithms. QCE runs in a Windows 98/NT/2000/ME/XP environment. It can be used to validate designs of physically realizable quantum processors and as an interactive educational tool to learn about quantum computers and quantum algorithms. A detailed exposition is given of the implementation of the CNOT and the Toffoli gate, the quantum Fourier transform, Grover's database search algorithm, an order finding algorithm, Shor's algorithm, a three-input adder and a number partitioning algorithm. We also review the results of simulations of an NMR-like quantum computer.

Verification for measurement-only blind quantum computing

NASA Astrophysics Data System (ADS)

Morimae, Tomoyuki

2014-06-01

Blind quantum computing is a new secure quantum computing protocol where a client who does not have any sophisticated quantum technology can delegate her quantum computing to a server without leaking any privacy. It is known that a client who has only a measurement device can perform blind quantum computing [T. Morimae and K. Fujii, Phys. Rev. A 87, 050301(R) (2013), 10.1103/PhysRevA.87.050301]. It has been an open problem whether the protocol can enjoy the verification, i.e., the ability of the client to check the correctness of the computing. In this paper, we propose a protocol of verification for the measurement-only blind quantum computing.

Experimental demonstration of blind quantum computing

NASA Astrophysics Data System (ADS)

Barz, Stefanie; Kashefi, Elham; Broadbent, Anne; Fitzsimons, Joe; Zeilinger, Anton; Walther, Philip

2012-02-01

Quantum computers are among the most promising applications of quantum-enhanced technologies. Quantum effects such as superposition and entanglement enable computational speed-ups that are unattainable using classical computers. The challenges in realising quantum computers suggest that in the near future, only a few facilities worldwide will be capable of operating such devices. In order to exploit these computers, users would seemingly have to give up their privacy. It was recently shown that this is not the case and that, via the universal blind quantum computation protocol, quantum mechanics provides a way to guarantee that the user's data remain private. Here, we demonstrate the first experimental version of this protocol using polarisation-entangled photonic qubits. We demonstrate various blind one- and two-qubit gate operations as well as blind versions of the Deutsch's and Grover's algorithms. When the technology to build quantum computers becomes available, this will become an important privacy-preserving feature of quantum information processing.

Single-server blind quantum computation with quantum circuit model

NASA Astrophysics Data System (ADS)

Zhang, Xiaoqian; Weng, Jian; Li, Xiaochun; Luo, Weiqi; Tan, Xiaoqing; Song, Tingting

2018-06-01

Blind quantum computation (BQC) enables the client, who has few quantum technologies, to delegate her quantum computation to a server, who has strong quantum computabilities and learns nothing about the client's quantum inputs, outputs and algorithms. In this article, we propose a single-server BQC protocol with quantum circuit model by replacing any quantum gate with the combination of rotation operators. The trap quantum circuits are introduced, together with the combination of rotation operators, such that the server is unknown about quantum algorithms. The client only needs to perform operations X and Z, while the server honestly performs rotation operators.

Contextuality supplies the 'magic' for quantum computation.

PubMed

Howard, Mark; Wallman, Joel; Veitch, Victor; Emerson, Joseph

2014-06-19

Quantum computers promise dramatic advantages over their classical counterparts, but the source of the power in quantum computing has remained elusive. Here we prove a remarkable equivalence between the onset of contextuality and the possibility of universal quantum computation via 'magic state' distillation, which is the leading model for experimentally realizing a fault-tolerant quantum computer. This is a conceptually satisfying link, because contextuality, which precludes a simple 'hidden variable' model of quantum mechanics, provides one of the fundamental characterizations of uniquely quantum phenomena. Furthermore, this connection suggests a unifying paradigm for the resources of quantum information: the non-locality of quantum theory is a particular kind of contextuality, and non-locality is already known to be a critical resource for achieving advantages with quantum communication. In addition to clarifying these fundamental issues, this work advances the resource framework for quantum computation, which has a number of practical applications, such as characterizing the efficiency and trade-offs between distinct theoretical and experimental schemes for achieving robust quantum computation, and putting bounds on the overhead cost for the classical simulation of quantum algorithms.

Exploiting Locality in Quantum Computation for Quantum Chemistry.

PubMed

McClean, Jarrod R; Babbush, Ryan; Love, Peter J; Aspuru-Guzik, Alán

2014-12-18

Accurate prediction of chemical and material properties from first-principles quantum chemistry is a challenging task on traditional computers. Recent developments in quantum computation offer a route toward highly accurate solutions with polynomial cost; however, this solution still carries a large overhead. In this Perspective, we aim to bring together known results about the locality of physical interactions from quantum chemistry with ideas from quantum computation. We show that the utilization of spatial locality combined with the Bravyi-Kitaev transformation offers an improvement in the scaling of known quantum algorithms for quantum chemistry and provides numerical examples to help illustrate this point. We combine these developments to improve the outlook for the future of quantum chemistry on quantum computers.

Computational Multiqubit Tunnelling in Programmable Quantum Annealers

DTIC Science & Technology

2016-08-25

ARTICLE Received 3 Jun 2015 | Accepted 26 Nov 2015 | Published 7 Jan 2016 Computational multiqubit tunnelling in programmable quantum annealers...state itself. Quantum tunnelling has been hypothesized as an advantageous physical resource for optimization in quantum annealing. However, computational ...qubit tunnelling plays a computational role in a currently available programmable quantum annealer. We devise a probe for tunnelling, a computational

Complexity Bounds for Quantum Computation

DTIC Science & Technology

2007-06-22

Programs Trustees of Boston University Boston, MA 02215 - Complexity Bounds for Quantum Computation REPORT DOCUMENTATION PAGE 18. SECURITY CLASSIFICATION...Complexity Bounds for Quantum Comp[utation Report Title ABSTRACT This project focused on upper and lower bounds for quantum computability using constant...classical computation models, particularly emphasizing new examples of where quantum circuits are more powerful than their classical counterparts. A second

Data-Driven Learning of Total and Local Energies in Elemental Boron

NASA Astrophysics Data System (ADS)

Deringer, Volker L.; Pickard, Chris J.; Csányi, Gábor

2018-04-01

The allotropes of boron continue to challenge structural elucidation and solid-state theory. Here we use machine learning combined with random structure searching (RSS) algorithms to systematically construct an interatomic potential for boron. Starting from ensembles of randomized atomic configurations, we use alternating single-point quantum-mechanical energy and force computations, Gaussian approximation potential (GAP) fitting, and GAP-driven RSS to iteratively generate a representation of the element's potential-energy surface. Beyond the total energies of the very different boron allotropes, our model readily provides atom-resolved, local energies and thus deepened insight into the frustrated β -rhombohedral boron structure. Our results open the door for the efficient and automated generation of GAPs, and other machine-learning-based interatomic potentials, and suggest their usefulness as a tool for materials discovery.

Data-Driven Learning of Total and Local Energies in Elemental Boron.

PubMed

Deringer, Volker L; Pickard, Chris J; Csányi, Gábor

2018-04-13

The allotropes of boron continue to challenge structural elucidation and solid-state theory. Here we use machine learning combined with random structure searching (RSS) algorithms to systematically construct an interatomic potential for boron. Starting from ensembles of randomized atomic configurations, we use alternating single-point quantum-mechanical energy and force computations, Gaussian approximation potential (GAP) fitting, and GAP-driven RSS to iteratively generate a representation of the element's potential-energy surface. Beyond the total energies of the very different boron allotropes, our model readily provides atom-resolved, local energies and thus deepened insight into the frustrated β-rhombohedral boron structure. Our results open the door for the efficient and automated generation of GAPs, and other machine-learning-based interatomic potentials, and suggest their usefulness as a tool for materials discovery.

Application of Blind Quantum Computation to Two-Party Quantum Computation

NASA Astrophysics Data System (ADS)

Sun, Zhiyuan; Li, Qin; Yu, Fang; Chan, Wai Hong

2018-06-01

Blind quantum computation (BQC) allows a client who has only limited quantum power to achieve quantum computation with the help of a remote quantum server and still keep the client's input, output, and algorithm private. Recently, Kashefi and Wallden extended BQC to achieve two-party quantum computation which allows two parties Alice and Bob to perform a joint unitary transform upon their inputs. However, in their protocol Alice has to prepare rotated single qubits and perform Pauli operations, and Bob needs to have a powerful quantum computer. In this work, we also utilize the idea of BQC to put forward an improved two-party quantum computation protocol in which the operations of both Alice and Bob are simplified since Alice only needs to apply Pauli operations and Bob is just required to prepare and encrypt his input qubits.

Application of Blind Quantum Computation to Two-Party Quantum Computation

NASA Astrophysics Data System (ADS)

Sun, Zhiyuan; Li, Qin; Yu, Fang; Chan, Wai Hong

2018-03-01

Blind quantum computation (BQC) allows a client who has only limited quantum power to achieve quantum computation with the help of a remote quantum server and still keep the client's input, output, and algorithm private. Recently, Kashefi and Wallden extended BQC to achieve two-party quantum computation which allows two parties Alice and Bob to perform a joint unitary transform upon their inputs. However, in their protocol Alice has to prepare rotated single qubits and perform Pauli operations, and Bob needs to have a powerful quantum computer. In this work, we also utilize the idea of BQC to put forward an improved two-party quantum computation protocol in which the operations of both Alice and Bob are simplified since Alice only needs to apply Pauli operations and Bob is just required to prepare and encrypt his input qubits.

Decoherence in adiabatic quantum computation

NASA Astrophysics Data System (ADS)

Albash, Tameem; Lidar, Daniel A.

2015-06-01

Recent experiments with increasingly larger numbers of qubits have sparked renewed interest in adiabatic quantum computation, and in particular quantum annealing. A central question that is repeatedly asked is whether quantum features of the evolution can survive over the long time scales used for quantum annealing relative to standard measures of the decoherence time. We reconsider the role of decoherence in adiabatic quantum computation and quantum annealing using the adiabatic quantum master-equation formalism. We restrict ourselves to the weak-coupling and singular-coupling limits, which correspond to decoherence in the energy eigenbasis and in the computational basis, respectively. We demonstrate that decoherence in the instantaneous energy eigenbasis does not necessarily detrimentally affect adiabatic quantum computation, and in particular that a short single-qubit T2 time need not imply adverse consequences for the success of the quantum adiabatic algorithm. We further demonstrate that boundary cancellation methods, designed to improve the fidelity of adiabatic quantum computing in the closed-system setting, remain beneficial in the open-system setting. To address the high computational cost of master-equation simulations, we also demonstrate that a quantum Monte Carlo algorithm that explicitly accounts for a thermal bosonic bath can be used to interpolate between classical and quantum annealing. Our study highlights and clarifies the significantly different role played by decoherence in the adiabatic and circuit models of quantum computing.

Spin-based quantum computation in multielectron quantum dots

NASA Astrophysics Data System (ADS)

Hu, Xuedong; Das Sarma, S.

2001-10-01

In a quantum computer the hardware and software are intrinsically connected because the quantum Hamiltonian (or more precisely its time development) is the code that runs the computer. We demonstrate this subtle and crucial relationship by considering the example of electron-spin-based solid-state quantum computer in semiconductor quantum dots. We show that multielectron quantum dots with one valence electron in the outermost shell do not behave simply as an effective single-spin system unless special conditions are satisfied. Our work compellingly demonstrates that a delicate synergy between theory and experiment (between software and hardware) is essential for constructing a quantum computer.

Dislocation-driven growth of two-dimensional lateral quantum-well superlattices

PubMed Central

Chen, Jianyi; Li, Dongdong

2018-01-01

The advent of two-dimensional (2D) materials has led to extensive studies of heterostructures for novel applications. 2D lateral multiheterojunctions and superlattices have been recently demonstrated, but the available growth methods can only produce features with widths in the micrometer or, at best, 100-nm scale and usually result in rough and defective interfaces with extensive chemical intermixing. Widths smaller than 5 nm, which are needed for quantum confinement effects and quantum-well applications, have not been achieved. We demonstrate the growth of sub–2-nm quantum-well arrays in semiconductor monolayers, driven by the climb of misfit dislocations in a lattice-mismatched sulfide/selenide heterointerface. Density functional theory calculations provide an atom-by-atom description of the growth mechanism. The calculated energy bands reveal type II alignment suitable for quantum wells, suggesting that the structure could, in principle, be turned into a “conduit” of conductive nanoribbons for interconnects in future 2D integrated circuits via n-type modulation doping. This misfit dislocation–driven growth can be applied to different combinations of 2D monolayers with lattice mismatch, paving the way to a wide range of 2D quantum-well superlattices with controllable band alignment and nanoscale width. PMID:29740600

Elucidating reaction mechanisms on quantum computers.

PubMed

Reiher, Markus; Wiebe, Nathan; Svore, Krysta M; Wecker, Dave; Troyer, Matthias

2017-07-18

With rapid recent advances in quantum technology, we are close to the threshold of quantum devices whose computational powers can exceed those of classical supercomputers. Here, we show that a quantum computer can be used to elucidate reaction mechanisms in complex chemical systems, using the open problem of biological nitrogen fixation in nitrogenase as an example. We discuss how quantum computers can augment classical computer simulations used to probe these reaction mechanisms, to significantly increase their accuracy and enable hitherto intractable simulations. Our resource estimates show that, even when taking into account the substantial overhead of quantum error correction, and the need to compile into discrete gate sets, the necessary computations can be performed in reasonable time on small quantum computers. Our results demonstrate that quantum computers will be able to tackle important problems in chemistry without requiring exorbitant resources.

Elucidating reaction mechanisms on quantum computers

PubMed Central

Reiher, Markus; Wiebe, Nathan; Svore, Krysta M.; Wecker, Dave; Troyer, Matthias

2017-01-01

With rapid recent advances in quantum technology, we are close to the threshold of quantum devices whose computational powers can exceed those of classical supercomputers. Here, we show that a quantum computer can be used to elucidate reaction mechanisms in complex chemical systems, using the open problem of biological nitrogen fixation in nitrogenase as an example. We discuss how quantum computers can augment classical computer simulations used to probe these reaction mechanisms, to significantly increase their accuracy and enable hitherto intractable simulations. Our resource estimates show that, even when taking into account the substantial overhead of quantum error correction, and the need to compile into discrete gate sets, the necessary computations can be performed in reasonable time on small quantum computers. Our results demonstrate that quantum computers will be able to tackle important problems in chemistry without requiring exorbitant resources. PMID:28674011

Elucidating reaction mechanisms on quantum computers

NASA Astrophysics Data System (ADS)

Reiher, Markus; Wiebe, Nathan; Svore, Krysta M.; Wecker, Dave; Troyer, Matthias

2017-07-01

With rapid recent advances in quantum technology, we are close to the threshold of quantum devices whose computational powers can exceed those of classical supercomputers. Here, we show that a quantum computer can be used to elucidate reaction mechanisms in complex chemical systems, using the open problem of biological nitrogen fixation in nitrogenase as an example. We discuss how quantum computers can augment classical computer simulations used to probe these reaction mechanisms, to significantly increase their accuracy and enable hitherto intractable simulations. Our resource estimates show that, even when taking into account the substantial overhead of quantum error correction, and the need to compile into discrete gate sets, the necessary computations can be performed in reasonable time on small quantum computers. Our results demonstrate that quantum computers will be able to tackle important problems in chemistry without requiring exorbitant resources.

Software Systems for High-performance Quantum Computing

DOE Office of Scientific and Technical Information (OSTI.GOV)

Humble, Travis S; Britt, Keith A

Quantum computing promises new opportunities for solving hard computational problems, but harnessing this novelty requires breakthrough concepts in the design, operation, and application of computing systems. We define some of the challenges facing the development of quantum computing systems as well as software-based approaches that can be used to overcome these challenges. Following a brief overview of the state of the art, we present models for the quantum programming and execution models, the development of architectures for hybrid high-performance computing systems, and the realization of software stacks for quantum networking. This leads to a discussion of the role that conventionalmore » computing plays in the quantum paradigm and how some of the current challenges for exascale computing overlap with those facing quantum computing.« less

Homomorphic encryption experiments on IBM's cloud quantum computing platform

NASA Astrophysics Data System (ADS)

Huang, He-Liang; Zhao, You-Wei; Li, Tan; Li, Feng-Guang; Du, Yu-Tao; Fu, Xiang-Qun; Zhang, Shuo; Wang, Xiang; Bao, Wan-Su

2017-02-01

Quantum computing has undergone rapid development in recent years. Owing to limitations on scalability, personal quantum computers still seem slightly unrealistic in the near future. The first practical quantum computer for ordinary users is likely to be on the cloud. However, the adoption of cloud computing is possible only if security is ensured. Homomorphic encryption is a cryptographic protocol that allows computation to be performed on encrypted data without decrypting them, so it is well suited to cloud computing. Here, we first applied homomorphic encryption on IBM's cloud quantum computer platform. In our experiments, we successfully implemented a quantum algorithm for linear equations while protecting our privacy. This demonstration opens a feasible path to the next stage of development of cloud quantum information technology.

A cross-disciplinary introduction to quantum annealing-based algorithms

NASA Astrophysics Data System (ADS)

Venegas-Andraca, Salvador E.; Cruz-Santos, William; McGeoch, Catherine; Lanzagorta, Marco

2018-04-01

A central goal in quantum computing is the development of quantum hardware and quantum algorithms in order to analyse challenging scientific and engineering problems. Research in quantum computation involves contributions from both physics and computer science; hence this article presents a concise introduction to basic concepts from both fields that are used in annealing-based quantum computation, an alternative to the more familiar quantum gate model. We introduce some concepts from computer science required to define difficult computational problems and to realise the potential relevance of quantum algorithms to find novel solutions to those problems. We introduce the structure of quantum annealing-based algorithms as well as two examples of this kind of algorithms for solving instances of the max-SAT and Minimum Multicut problems. An overview of the quantum annealing systems manufactured by D-Wave Systems is also presented.

Some Thoughts Regarding Practical Quantum Computing

NASA Astrophysics Data System (ADS)

Ghoshal, Debabrata; Gomez, Richard; Lanzagorta, Marco; Uhlmann, Jeffrey

2006-03-01

Quantum computing has become an important area of research in computer science because of its potential to provide more efficient algorithmic solutions to certain problems than are possible with classical computing. The ability of performing parallel operations over an exponentially large computational space has proved to be the main advantage of the quantum computing model. In this regard, we are particularly interested in the potential applications of quantum computers to enhance real software systems of interest to the defense, industrial, scientific and financial communities. However, while much has been written in popular and scientific literature about the benefits of the quantum computational model, several of the problems associated to the practical implementation of real-life complex software systems in quantum computers are often ignored. In this presentation we will argue that practical quantum computation is not as straightforward as commonly advertised, even if the technological problems associated to the manufacturing and engineering of large-scale quantum registers were solved overnight. We will discuss some of the frequently overlooked difficulties that plague quantum computing in the areas of memories, I/O, addressing schemes, compilers, oracles, approximate information copying, logical debugging, error correction and fault-tolerant computing protocols.

Energy Exchange in Driven Open Quantum Systems at Strong Coupling

NASA Astrophysics Data System (ADS)

Carrega, Matteo; Solinas, Paolo; Sassetti, Maura; Weiss, Ulrich

2016-06-01

The time-dependent energy transfer in a driven quantum system strongly coupled to a heat bath is studied within an influence functional approach. Exact formal expressions for the statistics of energy dissipation into the different channels are derived. The general method is applied to the driven dissipative two-state system. It is shown that the energy flows obey a balance relation, and that, for strong coupling, the interaction may constitute the major dissipative channel. Results in analytic form are presented for the particular value K =1/2 of strong Ohmic dissipation. The energy flows show interesting behaviors including driving-induced coherences and quantum stochastic resonances. It is found that the general characteristics persists for K near 1/2 .

Demixing in symmetric supersolid mixtures

NASA Astrophysics Data System (ADS)

Jain, Piyush; Moroni, Saverio; Boninsegni, Massimo; Pollet, Lode

2013-09-01

The droplet crystal phase of a symmetric binary mixture of soft-core bosons is studied by computer simulation. At high temperature each droplet comprises on average equal numbers of particles of either component, but the two components demix below the supersolid transition temperature, i.e., droplets mostly consist of particles of one component. Clustering of droplets of the same component is also observed. Demixing is driven by quantum tunneling of particles across droplets over the system and does not take place in an insulating crystal. This effect provides an unambiguous experimental signature of supersolidity.

Programming languages and compiler design for realistic quantum hardware.

PubMed

Chong, Frederic T; Franklin, Diana; Martonosi, Margaret

2017-09-13

Quantum computing sits at an important inflection point. For years, high-level algorithms for quantum computers have shown considerable promise, and recent advances in quantum device fabrication offer hope of utility. A gap still exists, however, between the hardware size and reliability requirements of quantum computing algorithms and the physical machines foreseen within the next ten years. To bridge this gap, quantum computers require appropriate software to translate and optimize applications (toolflows) and abstraction layers. Given the stringent resource constraints in quantum computing, information passed between layers of software and implementations will differ markedly from in classical computing. Quantum toolflows must expose more physical details between layers, so the challenge is to find abstractions that expose key details while hiding enough complexity.

Programming languages and compiler design for realistic quantum hardware

NASA Astrophysics Data System (ADS)

Chong, Frederic T.; Franklin, Diana; Martonosi, Margaret

2017-09-01

Quantum computing sits at an important inflection point. For years, high-level algorithms for quantum computers have shown considerable promise, and recent advances in quantum device fabrication offer hope of utility. A gap still exists, however, between the hardware size and reliability requirements of quantum computing algorithms and the physical machines foreseen within the next ten years. To bridge this gap, quantum computers require appropriate software to translate and optimize applications (toolflows) and abstraction layers. Given the stringent resource constraints in quantum computing, information passed between layers of software and implementations will differ markedly from in classical computing. Quantum toolflows must expose more physical details between layers, so the challenge is to find abstractions that expose key details while hiding enough complexity.

Building an adiabatic quantum computer simulation in the classroom

NASA Astrophysics Data System (ADS)

Rodríguez-Laguna, Javier; Santalla, Silvia N.

2018-05-01

We present a didactic introduction to adiabatic quantum computation (AQC) via the explicit construction of a classical simulator of quantum computers. This constitutes a suitable route to introduce several important concepts for advanced undergraduates in physics: quantum many-body systems, quantum phase transitions, disordered systems, spin-glasses, and computational complexity theory.

Crystalline Symmetry-Protected Majorana Mode in Number-Conserving Dirac Semimetal Nanowires

NASA Astrophysics Data System (ADS)

Zhang, Rui-Xing; Liu, Chao-Xing

2018-04-01

One of the cornerstones for topological quantum computations is the Majorana zero mode, which has been intensively searched in fractional quantum Hall systems and topological superconductors. Several recent works suggest that such an exotic mode can also exist in a one-dimensional (1D) interacting double-wire setup even without long-range superconductivity. A notable instability in these proposals comes from interchannel single-particle tunneling that spoils the topological ground state degeneracy. Here we show that a 1D Dirac semimetal (DSM) nanowire is an ideal number-conserving platform to realize such Majorana physics. By inserting magnetic flux, a DSM nanowire is driven into a 1D crystalline-symmetry-protected semimetallic phase. Interaction enables the emergence of boundary Majorana zero modes, which is robust as a result of crystalline symmetry protection. We also explore several experimental consequences of Majorana signals.

Nontrivial Quantum Effects in Biology: A Skeptical Physicists' View

NASA Astrophysics Data System (ADS)

Wiseman, Howard; Eisert, Jens

The following sections are included: * Introduction * A Quantum Life Principle * A quantum chemistry principle? * The anthropic principle * Quantum Computing in the Brain * Nature did everything first? * Decoherence as the make or break issue * Quantum error correction * Uselessness of quantum algorithms for organisms * Quantum Computing in Genetics * Quantum search * Teleological aspects and the fast-track to life * Quantum Consciousness * Computability and free will * Time scales * Quantum Free Will * Predictability and free will * Determinism and free will * Acknowledgements * References

Algorithmic complexity of quantum capacity

NASA Astrophysics Data System (ADS)

Oskouei, Samad Khabbazi; Mancini, Stefano

2018-04-01

We analyze the notion of quantum capacity from the perspective of algorithmic (descriptive) complexity. To this end, we resort to the concept of semi-computability in order to describe quantum states and quantum channel maps. We introduce algorithmic entropies (like algorithmic quantum coherent information) and derive relevant properties for them. Then we show that quantum capacity based on semi-computable concept equals the entropy rate of algorithmic coherent information, which in turn equals the standard quantum capacity. Thanks to this, we finally prove that the quantum capacity, for a given semi-computable channel, is limit computable.

Computing quantum hashing in the model of quantum branching programs

NASA Astrophysics Data System (ADS)

Ablayev, Farid; Ablayev, Marat; Vasiliev, Alexander

2018-02-01

We investigate the branching program complexity of quantum hashing. We consider a quantum hash function that maps elements of a finite field into quantum states. We require that this function is preimage-resistant and collision-resistant. We consider two complexity measures for Quantum Branching Programs (QBP): a number of qubits and a number of compu-tational steps. We show that the quantum hash function can be computed efficiently. Moreover, we prove that such QBP construction is optimal. That is, we prove lower bounds that match the constructed quantum hash function computation.

Symmetrically private information retrieval based on blind quantum computing

NASA Astrophysics Data System (ADS)

Sun, Zhiwei; Yu, Jianping; Wang, Ping; Xu, Lingling

2015-05-01

Universal blind quantum computation (UBQC) is a new secure quantum computing protocol which allows a user Alice who does not have any sophisticated quantum technology to delegate her computing to a server Bob without leaking any privacy. Using the features of UBQC, we propose a protocol to achieve symmetrically private information retrieval, which allows a quantum limited Alice to query an item from Bob with a fully fledged quantum computer; meanwhile, the privacy of both parties is preserved. The security of our protocol is based on the assumption that malicious Alice has no quantum computer, which avoids the impossibility proof of Lo. For the honest Alice, she is almost classical and only requires minimal quantum resources to carry out the proposed protocol. Therefore, she does not need any expensive laboratory which can maintain the coherence of complicated quantum experimental setups.

Hybrid Quantum-Classical Approach to Quantum Optimal Control.

PubMed

Li, Jun; Yang, Xiaodong; Peng, Xinhua; Sun, Chang-Pu

2017-04-14

A central challenge in quantum computing is to identify more computational problems for which utilization of quantum resources can offer significant speedup. Here, we propose a hybrid quantum-classical scheme to tackle the quantum optimal control problem. We show that the most computationally demanding part of gradient-based algorithms, namely, computing the fitness function and its gradient for a control input, can be accomplished by the process of evolution and measurement on a quantum simulator. By posing queries to and receiving answers from the quantum simulator, classical computing devices update the control parameters until an optimal control solution is found. To demonstrate the quantum-classical scheme in experiment, we use a seven-qubit nuclear magnetic resonance system, on which we have succeeded in optimizing state preparation without involving classical computation of the large Hilbert space evolution.

Reaching Agreement in Quantum Hybrid Networks.

PubMed

Shi, Guodong; Li, Bo; Miao, Zibo; Dower, Peter M; James, Matthew R

2017-07-20

We consider a basic quantum hybrid network model consisting of a number of nodes each holding a qubit, for which the aim is to drive the network to a consensus in the sense that all qubits reach a common state. Projective measurements are applied serving as control means, and the measurement results are exchanged among the nodes via classical communication channels. In this way the quantum-opeartion/classical-communication nature of hybrid quantum networks is captured, although coherent states and joint operations are not taken into consideration in order to facilitate a clear and explicit analysis. We show how to carry out centralized optimal path planning for this network with all-to-all classical communications, in which case the problem becomes a stochastic optimal control problem with a continuous action space. To overcome the computation and communication obstacles facing the centralized solutions, we also develop a distributed Pairwise Qubit Projection (PQP) algorithm, where pairs of nodes meet at a given time and respectively perform measurements at their geometric average. We show that the qubit states are driven to a consensus almost surely along the proposed PQP algorithm, and that the expected qubit density operators converge to the average of the network's initial values.

Quantum tomography for collider physics: illustrations with lepton-pair production

NASA Astrophysics Data System (ADS)

Martens, John C.; Ralston, John P.; Takaki, J. D. Tapia

2018-01-01

Quantum tomography is a method to experimentally extract all that is observable about a quantum mechanical system. We introduce quantum tomography to collider physics with the illustration of the angular distribution of lepton pairs. The tomographic method bypasses much of the field-theoretic formalism to concentrate on what can be observed with experimental data. We provide a practical, experimentally driven guide to model-independent analysis using density matrices at every step. Comparison with traditional methods of analyzing angular correlations of inclusive reactions finds many advantages in the tomographic method, which include manifest Lorentz covariance, direct incorporation of positivity constraints, exhaustively complete polarization information, and new invariants free from frame conventions. For example, experimental data can determine the entanglement entropy of the production process. We give reproducible numerical examples and provide a supplemental standalone computer code that implements the procedure. We also highlight a property of complex positivity that guarantees in a least-squares type fit that a local minimum of a χ 2 statistic will be a global minimum: There are no isolated local minima. This property with an automated implementation of positivity promises to mitigate issues relating to multiple minima and convention dependence that have been problematic in previous work on angular distributions.

Private quantum computation: an introduction to blind quantum computing and related protocols

NASA Astrophysics Data System (ADS)

Fitzsimons, Joseph F.

2017-06-01

Quantum technologies hold the promise of not only faster algorithmic processing of data, via quantum computation, but also of more secure communications, in the form of quantum cryptography. In recent years, a number of protocols have emerged which seek to marry these concepts for the purpose of securing computation rather than communication. These protocols address the task of securely delegating quantum computation to an untrusted device while maintaining the privacy, and in some instances the integrity, of the computation. We present a review of the progress to date in this emerging area.

Exploring the quantum critical behaviour in a driven Tavis–Cummings circuit

PubMed Central

Feng, M.; Zhong, Y.P.; Liu, T.; Yan, L.L.; Yang, W.L.; Twamley, J.; Wang, H.

2015-01-01

Quantum phase transitions play an important role in many-body systems and have been a research focus in conventional condensed-matter physics over the past few decades. Artificial atoms, such as superconducting qubits that can be individually manipulated, provide a new paradigm of realising and exploring quantum phase transitions by engineering an on-chip quantum simulator. Here we demonstrate experimentally the quantum critical behaviour in a highly controllable superconducting circuit, consisting of four qubits coupled to a common resonator mode. By off-resonantly driving the system to renormalize the critical spin-field coupling strength, we have observed a four-qubit nonequilibrium quantum phase transition in a dynamical manner; that is, we sweep the critical coupling strength over time and monitor the four-qubit scaled moments for a signature of a structural change of the system's eigenstates. Our observation of the nonequilibrium quantum phase transition, which is in good agreement with the driven Tavis–Cummings theory under decoherence, offers new experimental approaches towards exploring quantum phase transition-related science, such as scaling behaviours, parity breaking and long-range quantum correlations. PMID:25971985

OpenFlow Extensions for Programmable Quantum Networks

DTIC Science & Technology

2017-06-19

Extensions for Programmable Quantum Networks by Venkat Dasari, Nikolai Snow, and Billy Geerhart Computational and Information Sciences Directorate...distribution is unlimited. 1 1. Introduction Quantum networks and quantum computing have been receiving a surge of interest recently.1–3 However, there has...communicate using entangled particles and perform calculations using quantum logic gates. Additionally, quantum computing uses a quantum bit (qubit

Disciplines, models, and computers: the path to computational quantum chemistry.

PubMed

Lenhard, Johannes

2014-12-01

Many disciplines and scientific fields have undergone a computational turn in the past several decades. This paper analyzes this sort of turn by investigating the case of computational quantum chemistry. The main claim is that the transformation from quantum to computational quantum chemistry involved changes in three dimensions. First, on the side of instrumentation, small computers and a networked infrastructure took over the lead from centralized mainframe architecture. Second, a new conception of computational modeling became feasible and assumed a crucial role. And third, the field of computa- tional quantum chemistry became organized in a market-like fashion and this market is much bigger than the number of quantum theory experts. These claims will be substantiated by an investigation of the so-called density functional theory (DFT), the arguably pivotal theory in the turn to computational quantum chemistry around 1990.

Recent progress of quantum annealing

DOE Office of Scientific and Technical Information (OSTI.GOV)

Suzuki, Sei

2015-03-10

We review the recent progress of quantum annealing. Quantum annealing was proposed as a method to solve generic optimization problems. Recently a Canadian company has drawn a great deal of attention, as it has commercialized a quantum computer based on quantum annealing. Although the performance of quantum annealing is not sufficiently understood, it is likely that quantum annealing will be a practical method both on a conventional computer and on a quantum computer.

DOE pushes for useful quantum computing

NASA Astrophysics Data System (ADS)

Cho, Adrian

2018-01-01

The U.S. Department of Energy (DOE) is joining the quest to develop quantum computers, devices that would exploit quantum mechanics to crack problems that overwhelm conventional computers. The initiative comes as Google and other companies race to build a quantum computer that can demonstrate "quantum supremacy" by beating classical computers on a test problem. But reaching that milestone will not mean practical uses are at hand, and the new $40 million DOE effort is intended to spur the development of useful quantum computing algorithms for its work in chemistry, materials science, nuclear physics, and particle physics. With the resources at its 17 national laboratories, DOE could play a key role in developing the machines, researchers say, although finding problems with which quantum computers can help isn't so easy.

Geometric manipulation of trapped ions for quantum computation.

PubMed

Duan, L M; Cirac, J I; Zoller, P

2001-06-01

We propose an experimentally feasible scheme to achieve quantum computation based solely on geometric manipulations of a quantum system. The desired geometric operations are obtained by driving the quantum system to undergo appropriate adiabatic cyclic evolutions. Our implementation of the all-geometric quantum computation is based on laser manipulation of a set of trapped ions. An all-geometric approach, apart from its fundamental interest, offers a possible method for robust quantum computation.

Cooling the Collective Motion of Trapped Ions to Initialize a Quantum Register

DTIC Science & Technology

2016-09-13

computation [1] provides a gen- eral framework for fundamental investigations into sub- jects such as entanglement, quantum measurement, and quantum ...information theory. Since quantum computation relies on entanglement between qubits, any implementa- tion of a quantum computer must offer isolation from the...for realiz- ing a quantum computer , which is scalable to an arbitrary number of qubits. Their scheme is based on a collection of trapped atomic ions

Quantum computing on encrypted data

NASA Astrophysics Data System (ADS)

Fisher, K. A. G.; Broadbent, A.; Shalm, L. K.; Yan, Z.; Lavoie, J.; Prevedel, R.; Jennewein, T.; Resch, K. J.

2014-01-01

The ability to perform computations on encrypted data is a powerful tool for protecting privacy. Recently, protocols to achieve this on classical computing systems have been found. Here, we present an efficient solution to the quantum analogue of this problem that enables arbitrary quantum computations to be carried out on encrypted quantum data. We prove that an untrusted server can implement a universal set of quantum gates on encrypted quantum bits (qubits) without learning any information about the inputs, while the client, knowing the decryption key, can easily decrypt the results of the computation. We experimentally demonstrate, using single photons and linear optics, the encryption and decryption scheme on a set of gates sufficient for arbitrary quantum computations. As our protocol requires few extra resources compared with other schemes it can be easily incorporated into the design of future quantum servers. These results will play a key role in enabling the development of secure distributed quantum systems.

Quantum computing on encrypted data.

PubMed

Fisher, K A G; Broadbent, A; Shalm, L K; Yan, Z; Lavoie, J; Prevedel, R; Jennewein, T; Resch, K J

2014-01-01

The ability to perform computations on encrypted data is a powerful tool for protecting privacy. Recently, protocols to achieve this on classical computing systems have been found. Here, we present an efficient solution to the quantum analogue of this problem that enables arbitrary quantum computations to be carried out on encrypted quantum data. We prove that an untrusted server can implement a universal set of quantum gates on encrypted quantum bits (qubits) without learning any information about the inputs, while the client, knowing the decryption key, can easily decrypt the results of the computation. We experimentally demonstrate, using single photons and linear optics, the encryption and decryption scheme on a set of gates sufficient for arbitrary quantum computations. As our protocol requires few extra resources compared with other schemes it can be easily incorporated into the design of future quantum servers. These results will play a key role in enabling the development of secure distributed quantum systems.

Research progress on quantum informatics and quantum computation

NASA Astrophysics Data System (ADS)

Zhao, Yusheng

2018-03-01

Quantum informatics is an emerging interdisciplinary subject developed by the combination of quantum mechanics, information science, and computer science in the 1980s. The birth and development of quantum information science has far-reaching significance in science and technology. At present, the application of quantum information technology has become the direction of people’s efforts. The preparation, storage, purification and regulation, transmission, quantum coding and decoding of quantum state have become the hotspot of scientists and technicians, which have a profound impact on the national economy and the people’s livelihood, technology and defense technology. This paper first summarizes the background of quantum information science and quantum computer and the current situation of domestic and foreign research, and then introduces the basic knowledge and basic concepts of quantum computing. Finally, several quantum algorithms are introduced in detail, including Quantum Fourier transform, Deutsch-Jozsa algorithm, Shor’s quantum algorithm, quantum phase estimation.

Elucidating Reaction Mechanisms on Quantum Computers

NASA Astrophysics Data System (ADS)

Wiebe, Nathan; Reiher, Markus; Svore, Krysta; Wecker, Dave; Troyer, Matthias

We show how a quantum computer can be employed to elucidate reaction mechanisms in complex chemical systems, using the open problem of biological nitrogen fixation in nitrogenase as an example. We discuss how quantum computers can augment classical-computer simulations for such problems, to significantly increase their accuracy and enable hitherto intractable simulations. Detailed resource estimates show that, even when taking into account the substantial overhead of quantum error correction, and the need to compile into discrete gate sets, the necessary computations can be performed in reasonable time on small quantum computers. This demonstrates that quantum computers will realistically be able to tackle important problems in chemistry that are both scientifically and economically significant.

Blueprint for a microwave trapped ion quantum computer.

PubMed

Lekitsch, Bjoern; Weidt, Sebastian; Fowler, Austin G; Mølmer, Klaus; Devitt, Simon J; Wunderlich, Christof; Hensinger, Winfried K

2017-02-01

The availability of a universal quantum computer may have a fundamental impact on a vast number of research fields and on society as a whole. An increasingly large scientific and industrial community is working toward the realization of such a device. An arbitrarily large quantum computer may best be constructed using a modular approach. We present a blueprint for a trapped ion-based scalable quantum computer module, making it possible to create a scalable quantum computer architecture based on long-wavelength radiation quantum gates. The modules control all operations as stand-alone units, are constructed using silicon microfabrication techniques, and are within reach of current technology. To perform the required quantum computations, the modules make use of long-wavelength radiation-based quantum gate technology. To scale this microwave quantum computer architecture to a large size, we present a fully scalable design that makes use of ion transport between different modules, thereby allowing arbitrarily many modules to be connected to construct a large-scale device. A high error-threshold surface error correction code can be implemented in the proposed architecture to execute fault-tolerant operations. With appropriate adjustments, the proposed modules are also suitable for alternative trapped ion quantum computer architectures, such as schemes using photonic interconnects.

A scalable quantum computer with ions in an array of microtraps

PubMed

Cirac; Zoller

2000-04-06

Quantum computers require the storage of quantum information in a set of two-level systems (called qubits), the processing of this information using quantum gates and a means of final readout. So far, only a few systems have been identified as potentially viable quantum computer models--accurate quantum control of the coherent evolution is required in order to realize gate operations, while at the same time decoherence must be avoided. Examples include quantum optical systems (such as those utilizing trapped ions or neutral atoms, cavity quantum electrodynamics and nuclear magnetic resonance) and solid state systems (using nuclear spins, quantum dots and Josephson junctions). The most advanced candidates are the quantum optical and nuclear magnetic resonance systems, and we expect that they will allow quantum computing with about ten qubits within the next few years. This is still far from the numbers required for useful applications: for example, the factorization of a 200-digit number requires about 3,500 qubits, rising to 100,000 if error correction is implemented. Scalability of proposed quantum computer architectures to many qubits is thus of central importance. Here we propose a model for an ion trap quantum computer that combines scalability (a feature usually associated with solid state proposals) with the advantages of quantum optical systems (in particular, quantum control and long decoherence times).

Open-System Quantum Annealing in Mean-Field Models with Exponential Degeneracy

DTIC Science & Technology

2016-08-25

life quantum computers are inevitably affected by intrinsic noise resulting in dissipative nonunitary dynamics realized by these devices. We consider an... quantum computer . DOI: 10.1103/PhysRevX.6.021028 Subject Areas: Condensed Matter Physics, Quantum Physics, Quantum Information I. INTRODUCTION Quantum ... computing hardware is affected by a substantial level of intrinsic noise and therefore naturally realizes dis- sipative quantum dynamics [1,2

Dislocation-driven growth of two-dimensional lateral quantum-well superlattices

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhou, Wu; Zhang, Yu -Yang; Chen, Jianyi

Here, the advent of two-dimensional (2D) materials has led to extensive studies of heterostructures for novel applications. 2D lateral multiheterojunctions and superlattices have been recently demonstrated, but the available growth methods can only produce features with widths in the micrometer or, at best, 100-nm scale and usually result in rough and defective interfaces with extensive chemical intermixing. Widths smaller than 5 nm, which are needed for quantum confinement effects and quantum-well applications, have not been achieved. We demonstrate the growth of sub–2-nm quantum-well arrays in semiconductor monolayers, driven by the climb of misfit dislocations in a lattice-mismatched sulfide/selenide heterointerface. Densitymore » functional theory calculations provide an atom-by-atom description of the growth mechanism. The calculated energy bands reveal type II alignment suitable for quantum wells, suggesting that the structure could, in principle, be turned into a “conduit” of conductive nanoribbons for interconnects in future 2D integrated circuits via n-type modulation doping. This misfit dislocation–driven growth can be applied to different combinations of 2D monolayers with lattice mismatch, paving the way to a wide range of 2D quantum-well superlattices with controllable band alignment and nanoscale width.« less

Dislocation-driven growth of two-dimensional lateral quantum-well superlattices

DOE PAGES

Zhou, Wu; Zhang, Yu -Yang; Chen, Jianyi; ...

2018-03-23

Here, the advent of two-dimensional (2D) materials has led to extensive studies of heterostructures for novel applications. 2D lateral multiheterojunctions and superlattices have been recently demonstrated, but the available growth methods can only produce features with widths in the micrometer or, at best, 100-nm scale and usually result in rough and defective interfaces with extensive chemical intermixing. Widths smaller than 5 nm, which are needed for quantum confinement effects and quantum-well applications, have not been achieved. We demonstrate the growth of sub–2-nm quantum-well arrays in semiconductor monolayers, driven by the climb of misfit dislocations in a lattice-mismatched sulfide/selenide heterointerface. Densitymore » functional theory calculations provide an atom-by-atom description of the growth mechanism. The calculated energy bands reveal type II alignment suitable for quantum wells, suggesting that the structure could, in principle, be turned into a “conduit” of conductive nanoribbons for interconnects in future 2D integrated circuits via n-type modulation doping. This misfit dislocation–driven growth can be applied to different combinations of 2D monolayers with lattice mismatch, paving the way to a wide range of 2D quantum-well superlattices with controllable band alignment and nanoscale width.« less

Quantum Accelerators for High-performance Computing Systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Humble, Travis S.; Britt, Keith A.; Mohiyaddin, Fahd A.

We define some of the programming and system-level challenges facing the application of quantum processing to high-performance computing. Alongside barriers to physical integration, prominent differences in the execution of quantum and conventional programs challenges the intersection of these computational models. Following a brief overview of the state of the art, we discuss recent advances in programming and execution models for hybrid quantum-classical computing. We discuss a novel quantum-accelerator framework that uses specialized kernels to offload select workloads while integrating with existing computing infrastructure. We elaborate on the role of the host operating system to manage these unique accelerator resources, themore » prospects for deploying quantum modules, and the requirements placed on the language hierarchy connecting these different system components. We draw on recent advances in the modeling and simulation of quantum computing systems with the development of architectures for hybrid high-performance computing systems and the realization of software stacks for controlling quantum devices. Finally, we present simulation results that describe the expected system-level behavior of high-performance computing systems composed from compute nodes with quantum processing units. We describe performance for these hybrid systems in terms of time-to-solution, accuracy, and energy consumption, and we use simple application examples to estimate the performance advantage of quantum acceleration.« less

Adiabatic topological quantum computing

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cesare, Chris; Landahl, Andrew J.; Bacon, Dave

Topological quantum computing promises error-resistant quantum computation without active error correction. However, there is a worry that during the process of executing quantum gates by braiding anyons around each other, extra anyonic excitations will be created that will disorder the encoded quantum information. Here, we explore this question in detail by studying adiabatic code deformations on Hamiltonians based on topological codes, notably Kitaev’s surface codes and the more recently discovered color codes. We develop protocols that enable universal quantum computing by adiabatic evolution in a way that keeps the energy gap of the system constant with respect to the computationmore » size and introduces only simple local Hamiltonian interactions. This allows one to perform holonomic quantum computing with these topological quantum computing systems. The tools we develop allow one to go beyond numerical simulations and understand these processes analytically.« less

Adiabatic topological quantum computing

DOE PAGES

Cesare, Chris; Landahl, Andrew J.; Bacon, Dave; ...

2015-07-31

Topological quantum computing promises error-resistant quantum computation without active error correction. However, there is a worry that during the process of executing quantum gates by braiding anyons around each other, extra anyonic excitations will be created that will disorder the encoded quantum information. Here, we explore this question in detail by studying adiabatic code deformations on Hamiltonians based on topological codes, notably Kitaev’s surface codes and the more recently discovered color codes. We develop protocols that enable universal quantum computing by adiabatic evolution in a way that keeps the energy gap of the system constant with respect to the computationmore » size and introduces only simple local Hamiltonian interactions. This allows one to perform holonomic quantum computing with these topological quantum computing systems. The tools we develop allow one to go beyond numerical simulations and understand these processes analytically.« less

Quantum computing and probability.

PubMed

Ferry, David K

2009-11-25

Over the past two decades, quantum computing has become a popular and promising approach to trying to solve computationally difficult problems. Missing in many descriptions of quantum computing is just how probability enters into the process. Here, we discuss some simple examples of how uncertainty and probability enter, and how this and the ideas of quantum computing challenge our interpretations of quantum mechanics. It is found that this uncertainty can lead to intrinsic decoherence, and this raises challenges for error correction.

Fast non-Abelian geometric gates via transitionless quantum driving.

PubMed

Zhang, J; Kyaw, Thi Ha; Tong, D M; Sjöqvist, Erik; Kwek, Leong-Chuan

2015-12-21

A practical quantum computer must be capable of performing high fidelity quantum gates on a set of quantum bits (qubits). In the presence of noise, the realization of such gates poses daunting challenges. Geometric phases, which possess intrinsic noise-tolerant features, hold the promise for performing robust quantum computation. In particular, quantum holonomies, i.e., non-Abelian geometric phases, naturally lead to universal quantum computation due to their non-commutativity. Although quantum gates based on adiabatic holonomies have already been proposed, the slow evolution eventually compromises qubit coherence and computational power. Here, we propose a general approach to speed up an implementation of adiabatic holonomic gates by using transitionless driving techniques and show how such a universal set of fast geometric quantum gates in a superconducting circuit architecture can be obtained in an all-geometric approach. Compared with standard non-adiabatic holonomic quantum computation, the holonomies obtained in our approach tends asymptotically to those of the adiabatic approach in the long run-time limit and thus might open up a new horizon for realizing a practical quantum computer.

Fast non-Abelian geometric gates via transitionless quantum driving

PubMed Central

Zhang, J.; Kyaw, Thi Ha; Tong, D. M.; Sjöqvist, Erik; Kwek, Leong-Chuan

2015-01-01

A practical quantum computer must be capable of performing high fidelity quantum gates on a set of quantum bits (qubits). In the presence of noise, the realization of such gates poses daunting challenges. Geometric phases, which possess intrinsic noise-tolerant features, hold the promise for performing robust quantum computation. In particular, quantum holonomies, i.e., non-Abelian geometric phases, naturally lead to universal quantum computation due to their non-commutativity. Although quantum gates based on adiabatic holonomies have already been proposed, the slow evolution eventually compromises qubit coherence and computational power. Here, we propose a general approach to speed up an implementation of adiabatic holonomic gates by using transitionless driving techniques and show how such a universal set of fast geometric quantum gates in a superconducting circuit architecture can be obtained in an all-geometric approach. Compared with standard non-adiabatic holonomic quantum computation, the holonomies obtained in our approach tends asymptotically to those of the adiabatic approach in the long run-time limit and thus might open up a new horizon for realizing a practical quantum computer. PMID:26687580

Verifiable fault tolerance in measurement-based quantum computation

NASA Astrophysics Data System (ADS)

Fujii, Keisuke; Hayashi, Masahito

2017-09-01

Quantum systems, in general, cannot be simulated efficiently by a classical computer, and hence are useful for solving certain mathematical problems and simulating quantum many-body systems. This also implies, unfortunately, that verification of the output of the quantum systems is not so trivial, since predicting the output is exponentially hard. As another problem, the quantum system is very delicate for noise and thus needs an error correction. Here, we propose a framework for verification of the output of fault-tolerant quantum computation in a measurement-based model. In contrast to existing analyses on fault tolerance, we do not assume any noise model on the resource state, but an arbitrary resource state is tested by using only single-qubit measurements to verify whether or not the output of measurement-based quantum computation on it is correct. Verifiability is equipped by a constant time repetition of the original measurement-based quantum computation in appropriate measurement bases. Since full characterization of quantum noise is exponentially hard for large-scale quantum computing systems, our framework provides an efficient way to practically verify the experimental quantum error correction.

Embracing the quantum limit in silicon computing.

PubMed

Morton, John J L; McCamey, Dane R; Eriksson, Mark A; Lyon, Stephen A

2011-11-16

Quantum computers hold the promise of massive performance enhancements across a range of applications, from cryptography and databases to revolutionary scientific simulation tools. Such computers would make use of the same quantum mechanical phenomena that pose limitations on the continued shrinking of conventional information processing devices. Many of the key requirements for quantum computing differ markedly from those of conventional computers. However, silicon, which plays a central part in conventional information processing, has many properties that make it a superb platform around which to build a quantum computer. © 2011 Macmillan Publishers Limited. All rights reserved

Compiling Planning into Quantum Optimization Problems: A Comparative Study

DTIC Science & Technology

2015-06-07

and Sipser, M. 2000. Quantum computation by adiabatic evolution. arXiv:quant- ph/0001106. Fikes, R. E., and Nilsson, N. J. 1972. STRIPS: A new...become available: quantum annealing. Quantum annealing is one of the most accessible quantum algorithms for a computer sci- ence audience not versed...in quantum computing because of its close ties to classical optimization algorithms such as simulated annealing. While large-scale universal quantum

Quantum Computer Science

NASA Astrophysics Data System (ADS)

Mermin, N. David

2007-08-01

Preface; 1. Cbits and Qbits; 2. General features and some simple examples; 3. Breaking RSA encryption with a quantum computer; 4. Searching with a quantum computer; 5. Quantum error correction; 6. Protocols that use just a few Qbits; Appendices; Index.

Visualizing a silicon quantum computer

NASA Astrophysics Data System (ADS)

Sanders, Barry C.; Hollenberg, Lloyd C. L.; Edmundson, Darran; Edmundson, Andrew

2008-12-01

Quantum computation is a fast-growing, multi-disciplinary research field. The purpose of a quantum computer is to execute quantum algorithms that efficiently solve computational problems intractable within the existing paradigm of 'classical' computing built on bits and Boolean gates. While collaboration between computer scientists, physicists, chemists, engineers, mathematicians and others is essential to the project's success, traditional disciplinary boundaries can hinder progress and make communicating the aims of quantum computing and future technologies difficult. We have developed a four minute animation as a tool for representing, understanding and communicating a silicon-based solid-state quantum computer to a variety of audiences, either as a stand-alone animation to be used by expert presenters or embedded into a longer movie as short animated sequences. The paper includes a generally applicable recipe for successful scientific animation production.

Suppression of quantum decoherence via infrared-driven coherent exciton-plasmon coupling: Undamped field and Rabi oscillations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sadeghi, S. M., E-mail: seyed.sadeghi@uah.edu; Nano and Micro Device Center, University of Alabama in Huntsville, Huntsville, Alabama 35899; Patty, K. D.

2014-02-24

We show that when a semiconductor quantum dot is in the vicinity of a metallic nanoparticle and driven by a mid-infrared laser field, its coherent dynamics caused by interaction with a visible laser field can become free of quantum decoherence. We demonstrate that this process, which can offer undamped Rabi and field oscillations, is the result of coherent normalization of the “effective” polarization dephasing time of the quantum dot (T{sub 2}{sup *}). This process indicates formation of infrared-induced coherently forced oscillations, which allows us to control the value of T{sub 2}{sup *} using the infrared laser. The results offer decay-freemore » ultrafast modulation of the effective field experienced by the quantum dot when neither the visible laser field nor the infrared laser changes with time.« less

Quantum resonances in a single plaquette of Josephson junctions: excitations of Rabi oscillations

NASA Astrophysics Data System (ADS)

Fistul, M. V.

2002-03-01

We present a theoretical study of a quantum regime of the resistive (whirling) state of dc driven anisotropic single plaquette containing small Josephson junctions. The current-voltage characteristics of such systems display resonant steps that are due to the resonant interaction between the time dependent Josephson current and the excited electromagnetic oscillations (EOs). The voltage positions of the resonances are determined by the quantum interband transitions of EOs. We show that in the quantum regime as the system is driven on the resonance, coherent Rabi oscillations between the quantum levels of EOs occur. At variance with the classical regime the magnitude and the width of resonances are determined by the frequency of Rabi oscillations that in turn, depends in a peculiar manner on an externally applied magnetic field and the parameters of the system.

Quantum Statistical Mechanics on a Quantum Computer

NASA Astrophysics Data System (ADS)

Raedt, H. D.; Hams, A. H.; Michielsen, K.; Miyashita, S.; Saito, K.

We describe a quantum algorithm to compute the density of states and thermal equilibrium properties of quantum many-body systems. We present results obtained by running this algorithm on a software implementation of a 21-qubit quantum computer for the case of an antiferromagnetic Heisenberg model on triangular lattices of different size.

An approach to quantum-computational hydrologic inverse analysis

DOE PAGES

O'Malley, Daniel

2018-05-02

Making predictions about flow and transport in an aquifer requires knowledge of the heterogeneous properties of the aquifer such as permeability. Computational methods for inverse analysis are commonly used to infer these properties from quantities that are more readily observable such as hydraulic head. We present a method for computational inverse analysis that utilizes a type of quantum computer called a quantum annealer. While quantum computing is in an early stage compared to classical computing, we demonstrate that it is sufficiently developed that it can be used to solve certain subsurface flow problems. We utilize a D-Wave 2X quantum annealermore » to solve 1D and 2D hydrologic inverse problems that, while small by modern standards, are similar in size and sometimes larger than hydrologic inverse problems that were solved with early classical computers. Our results and the rapid progress being made with quantum computing hardware indicate that the era of quantum-computational hydrology may not be too far in the future.« less

An approach to quantum-computational hydrologic inverse analysis.

PubMed

O'Malley, Daniel

2018-05-02

Making predictions about flow and transport in an aquifer requires knowledge of the heterogeneous properties of the aquifer such as permeability. Computational methods for inverse analysis are commonly used to infer these properties from quantities that are more readily observable such as hydraulic head. We present a method for computational inverse analysis that utilizes a type of quantum computer called a quantum annealer. While quantum computing is in an early stage compared to classical computing, we demonstrate that it is sufficiently developed that it can be used to solve certain subsurface flow problems. We utilize a D-Wave 2X quantum annealer to solve 1D and 2D hydrologic inverse problems that, while small by modern standards, are similar in size and sometimes larger than hydrologic inverse problems that were solved with early classical computers. Our results and the rapid progress being made with quantum computing hardware indicate that the era of quantum-computational hydrology may not be too far in the future.

An approach to quantum-computational hydrologic inverse analysis

DOE Office of Scientific and Technical Information (OSTI.GOV)

O'Malley, Daniel

Making predictions about flow and transport in an aquifer requires knowledge of the heterogeneous properties of the aquifer such as permeability. Computational methods for inverse analysis are commonly used to infer these properties from quantities that are more readily observable such as hydraulic head. We present a method for computational inverse analysis that utilizes a type of quantum computer called a quantum annealer. While quantum computing is in an early stage compared to classical computing, we demonstrate that it is sufficiently developed that it can be used to solve certain subsurface flow problems. We utilize a D-Wave 2X quantum annealermore » to solve 1D and 2D hydrologic inverse problems that, while small by modern standards, are similar in size and sometimes larger than hydrologic inverse problems that were solved with early classical computers. Our results and the rapid progress being made with quantum computing hardware indicate that the era of quantum-computational hydrology may not be too far in the future.« less

A novel quantum scheme for secure two-party distance computation

NASA Astrophysics Data System (ADS)

Peng, Zhen-wan; Shi, Run-hua; Zhong, Hong; Cui, Jie; Zhang, Shun

2017-12-01

Secure multiparty computational geometry is an essential field of secure multiparty computation, which computes a computation geometric problem without revealing any private information of each party. Secure two-party distance computation is a primitive of secure multiparty computational geometry, which computes the distance between two points without revealing each point's location information (i.e., coordinate). Secure two-party distance computation has potential applications with high secure requirements in military, business, engineering and so on. In this paper, we present a quantum solution to secure two-party distance computation by subtly using quantum private query. Compared to the classical related protocols, our quantum protocol can ensure higher security and better privacy protection because of the physical principle of quantum mechanics.

High-Threshold Fault-Tolerant Quantum Computation with Analog Quantum Error Correction

NASA Astrophysics Data System (ADS)

Fukui, Kosuke; Tomita, Akihisa; Okamoto, Atsushi; Fujii, Keisuke

2018-04-01

To implement fault-tolerant quantum computation with continuous variables, the Gottesman-Kitaev-Preskill (GKP) qubit has been recognized as an important technological element. However, it is still challenging to experimentally generate the GKP qubit with the required squeezing level, 14.8 dB, of the existing fault-tolerant quantum computation. To reduce this requirement, we propose a high-threshold fault-tolerant quantum computation with GKP qubits using topologically protected measurement-based quantum computation with the surface code. By harnessing analog information contained in the GKP qubits, we apply analog quantum error correction to the surface code. Furthermore, we develop a method to prevent the squeezing level from decreasing during the construction of the large-scale cluster states for the topologically protected, measurement-based, quantum computation. We numerically show that the required squeezing level can be relaxed to less than 10 dB, which is within the reach of the current experimental technology. Hence, this work can considerably alleviate this experimental requirement and take a step closer to the realization of large-scale quantum computation.

Quantum Gauss-Jordan Elimination and Simulation of Accounting Principles on Quantum Computers

NASA Astrophysics Data System (ADS)

Diep, Do Ngoc; Giang, Do Hoang; Van Minh, Nguyen

2017-06-01

The paper is devoted to a version of Quantum Gauss-Jordan Elimination and its applications. In the first part, we construct the Quantum Gauss-Jordan Elimination (QGJE) Algorithm and estimate the complexity of computation of Reduced Row Echelon Form (RREF) of N × N matrices. The main result asserts that QGJE has computation time is of order 2 N/2. The second part is devoted to a new idea of simulation of accounting by quantum computing. We first expose the actual accounting principles in a pure mathematics language. Then, we simulate the accounting principles on quantum computers. We show that, all accounting actions are exhousted by the described basic actions. The main problems of accounting are reduced to some system of linear equations in the economic model of Leontief. In this simulation, we use our constructed Quantum Gauss-Jordan Elimination to solve the problems and the complexity of quantum computing is a square root order faster than the complexity in classical computing.

Blueprint for a microwave trapped ion quantum computer

PubMed Central

Lekitsch, Bjoern; Weidt, Sebastian; Fowler, Austin G.; Mølmer, Klaus; Devitt, Simon J.; Wunderlich, Christof; Hensinger, Winfried K.

2017-01-01

The availability of a universal quantum computer may have a fundamental impact on a vast number of research fields and on society as a whole. An increasingly large scientific and industrial community is working toward the realization of such a device. An arbitrarily large quantum computer may best be constructed using a modular approach. We present a blueprint for a trapped ion–based scalable quantum computer module, making it possible to create a scalable quantum computer architecture based on long-wavelength radiation quantum gates. The modules control all operations as stand-alone units, are constructed using silicon microfabrication techniques, and are within reach of current technology. To perform the required quantum computations, the modules make use of long-wavelength radiation–based quantum gate technology. To scale this microwave quantum computer architecture to a large size, we present a fully scalable design that makes use of ion transport between different modules, thereby allowing arbitrarily many modules to be connected to construct a large-scale device. A high error–threshold surface error correction code can be implemented in the proposed architecture to execute fault-tolerant operations. With appropriate adjustments, the proposed modules are also suitable for alternative trapped ion quantum computer architectures, such as schemes using photonic interconnects. PMID:28164154

Silicon CMOS architecture for a spin-based quantum computer.

PubMed

Veldhorst, M; Eenink, H G J; Yang, C H; Dzurak, A S

2017-12-15

Recent advances in quantum error correction codes for fault-tolerant quantum computing and physical realizations of high-fidelity qubits in multiple platforms give promise for the construction of a quantum computer based on millions of interacting qubits. However, the classical-quantum interface remains a nascent field of exploration. Here, we propose an architecture for a silicon-based quantum computer processor based on complementary metal-oxide-semiconductor (CMOS) technology. We show how a transistor-based control circuit together with charge-storage electrodes can be used to operate a dense and scalable two-dimensional qubit system. The qubits are defined by the spin state of a single electron confined in quantum dots, coupled via exchange interactions, controlled using a microwave cavity, and measured via gate-based dispersive readout. We implement a spin qubit surface code, showing the prospects for universal quantum computation. We discuss the challenges and focus areas that need to be addressed, providing a path for large-scale quantum computing.

Experimental Identification of Non-Abelian Topological Orders on a Quantum Simulator.

PubMed

Li, Keren; Wan, Yidun; Hung, Ling-Yan; Lan, Tian; Long, Guilu; Lu, Dawei; Zeng, Bei; Laflamme, Raymond

2017-02-24

Topological orders can be used as media for topological quantum computing-a promising quantum computation model due to its invulnerability against local errors. Conversely, a quantum simulator, often regarded as a quantum computing device for special purposes, also offers a way of characterizing topological orders. Here, we show how to identify distinct topological orders via measuring their modular S and T matrices. In particular, we employ a nuclear magnetic resonance quantum simulator to study the properties of three topologically ordered matter phases described by the string-net model with two string types, including the Z_{2} toric code, doubled semion, and doubled Fibonacci. The third one, non-Abelian Fibonacci order is notably expected to be the simplest candidate for universal topological quantum computing. Our experiment serves as the basic module, built on which one can simulate braiding of non-Abelian anyons and ultimately, topological quantum computation via the braiding, and thus provides a new approach of investigating topological orders using quantum computers.

Noise Threshold and Resource Cost of Fault-Tolerant Quantum Computing with Majorana Fermions in Hybrid Systems.

PubMed

Li, Ying

2016-09-16

Fault-tolerant quantum computing in systems composed of both Majorana fermions and topologically unprotected quantum systems, e.g., superconducting circuits or quantum dots, is studied in this Letter. Errors caused by topologically unprotected quantum systems need to be corrected with error-correction schemes, for instance, the surface code. We find that the error-correction performance of such a hybrid topological quantum computer is not superior to a normal quantum computer unless the topological charge of Majorana fermions is insusceptible to noise. If errors changing the topological charge are rare, the fault-tolerance threshold is much higher than the threshold of a normal quantum computer and a surface-code logical qubit could be encoded in only tens of topological qubits instead of about 1,000 normal qubits.

Demonstration of a small programmable quantum computer with atomic qubits.

PubMed

Debnath, S; Linke, N M; Figgatt, C; Landsman, K A; Wright, K; Monroe, C

2016-08-04

Quantum computers can solve certain problems more efficiently than any possible conventional computer. Small quantum algorithms have been demonstrated on multiple quantum computing platforms, many specifically tailored in hardware to implement a particular algorithm or execute a limited number of computational paths. Here we demonstrate a five-qubit trapped-ion quantum computer that can be programmed in software to implement arbitrary quantum algorithms by executing any sequence of universal quantum logic gates. We compile algorithms into a fully connected set of gate operations that are native to the hardware and have a mean fidelity of 98 per cent. Reconfiguring these gate sequences provides the flexibility to implement a variety of algorithms without altering the hardware. As examples, we implement the Deutsch-Jozsa and Bernstein-Vazirani algorithms with average success rates of 95 and 90 per cent, respectively. We also perform a coherent quantum Fourier transform on five trapped-ion qubits for phase estimation and period finding with average fidelities of 62 and 84 per cent, respectively. This small quantum computer can be scaled to larger numbers of qubits within a single register, and can be further expanded by connecting several such modules through ion shuttling or photonic quantum channels.

Demonstration of a small programmable quantum computer with atomic qubits

NASA Astrophysics Data System (ADS)

Debnath, S.; Linke, N. M.; Figgatt, C.; Landsman, K. A.; Wright, K.; Monroe, C.

2016-08-01

Quantum computers can solve certain problems more efficiently than any possible conventional computer. Small quantum algorithms have been demonstrated on multiple quantum computing platforms, many specifically tailored in hardware to implement a particular algorithm or execute a limited number of computational paths. Here we demonstrate a five-qubit trapped-ion quantum computer that can be programmed in software to implement arbitrary quantum algorithms by executing any sequence of universal quantum logic gates. We compile algorithms into a fully connected set of gate operations that are native to the hardware and have a mean fidelity of 98 per cent. Reconfiguring these gate sequences provides the flexibility to implement a variety of algorithms without altering the hardware. As examples, we implement the Deutsch-Jozsa and Bernstein-Vazirani algorithms with average success rates of 95 and 90 per cent, respectively. We also perform a coherent quantum Fourier transform on five trapped-ion qubits for phase estimation and period finding with average fidelities of 62 and 84 per cent, respectively. This small quantum computer can be scaled to larger numbers of qubits within a single register, and can be further expanded by connecting several such modules through ion shuttling or photonic quantum channels.

Two-spectral Yang-Baxter operators in topological quantum computation

NASA Astrophysics Data System (ADS)

Sanchez, William F.

2011-05-01

One of the current trends in quantum computing is the application of algebraic topological methods in the design of new algorithms and quantum computers, giving rise to topological quantum computing. One of the tools used in it is the Yang-Baxter equation whose solutions are interpreted as universal quantum gates. Lately, more general Yang-Baxter equations have been investigated, making progress as two-spectral equations and Yang-Baxter systems. This paper intends to apply these new findings to the field of topological quantum computation, more specifically, the proposition of the two-spectral Yang-Baxter operators as universal quantum gates for 2 qubits and 2 qutrits systems, obtaining 4x4 and 9x9 matrices respectively, and further elaboration of the corresponding Hamiltonian by the use of computer algebra software Mathematica® and its Qucalc package. In addition, possible physical systems to which the Yang-Baxter operators obtained can be applied are considered. In the present work it is demonstrated the utility of the Yang-Baxter equation to generate universal quantum gates and the power of computer algebra to design them; it is expected that these mathematical studies contribute to the further development of quantum computers

Electric dipole spin resonance in a quantum spin dimer system driven by magnetoelectric coupling

NASA Astrophysics Data System (ADS)

Kimura, Shojiro; Matsumoto, Masashige; Akaki, Mitsuru; Hagiwara, Masayuki; Kindo, Koichi; Tanaka, Hidekazu

2018-04-01

In this Rapid Communication, we propose a mechanism for electric dipole active spin resonance caused by spin-dependent electric polarization in a quantum spin gapped system. This proposal was successfully confirmed by high-frequency electron spin resonance (ESR) measurements of the quantum spin dimer system KCuCl3. ESR measurements by an illuminating linearly polarized electromagnetic wave reveal that the optical transition between the singlet and triplet states in KCuCl3 is driven by an ac electric field. The selection rule of the observed transition agrees with the calculation by taking into account spin-dependent electric polarization. We suggest that spin-dependent electric polarization is effective in achieving fast control of quantum spins by an ac electric field.

Perfect Spin Filter by Periodic Drive of a Ferromagnetic Quantum Barrier

NASA Astrophysics Data System (ADS)

Thuberg, Daniel; Muñoz, Enrique; Eggert, Sebastian; Reyes, Sebastián A.

2017-12-01

We consider the problem of particle tunneling through a periodically driven ferromagnetic quantum barrier connected to two leads. The barrier is modeled by an impurity site representing a ferromagnetic layer or a quantum dot in a tight-binding Hamiltonian with a local magnetic field and an ac-driven potential, which is solved using the Floquet formalism. The repulsive interactions in the quantum barrier are also taken into account. Our results show that the time-periodic potential causes sharp resonances of perfect transmission and reflection, which can be tuned by the frequency, the driving strength, and the magnetic field. We demonstrate that a device based on this configuration could act as a highly tunable spin valve for spintronic applications.

Universal non-adiabatic holonomic quantum computation in decoherence-free subspaces with quantum dots inside a cavity

NASA Astrophysics Data System (ADS)

Liu, Jun; Dong, Ping; Zhou, Jian; Cao, Zhuo-Liang

2017-05-01

A scheme for implementing the non-adiabatic holonomic quantum computation in decoherence-free subspaces is proposed with the interactions between a microcavity and quantum dots. A universal set of quantum gates can be constructed on the encoded logical qubits with high fidelities. The current scheme can suppress both local and collective noises, which is very important for achieving universal quantum computation. Discussions about the gate fidelities with the experimental parameters show that our schemes can be implemented in current experimental technology. Therefore, our scenario offers a method for universal and robust solid-state quantum computation.

Causal and causally separable processes

NASA Astrophysics Data System (ADS)

Oreshkov, Ognyan; Giarmatzi, Christina

2016-09-01

The idea that events are equipped with a partial causal order is central to our understanding of physics in the tested regimes: given two pointlike events A and B, either A is in the causal past of B, B is in the causal past of A, or A and B are space-like separated. Operationally, the meaning of these order relations corresponds to constraints on the possible correlations between experiments performed in the vicinities of the respective events: if A is in the causal past of B, an experimenter at A could signal to an experimenter at B but not the other way around, while if A and B are space-like separated, no signaling is possible in either direction. In the context of a concrete physical theory, the correlations compatible with a given causal configuration may obey further constraints. For instance, space-like correlations in quantum mechanics arise from local measurements on joint quantum states, while time-like correlations are established via quantum channels. Similarly to other variables, however, the causal order of a set of events could be random, and little is understood about the constraints that causality implies in this case. A main difficulty concerns the fact that the order of events can now generally depend on the operations performed at the locations of these events, since, for instance, an operation at A could influence the order in which B and C occur in A’s future. So far, no formal theory of causality compatible with such dynamical causal order has been developed. Apart from being of fundamental interest in the context of inferring causal relations, such a theory is imperative for understanding recent suggestions that the causal order of events in quantum mechanics can be indefinite. Here, we develop such a theory in the general multipartite case. Starting from a background-independent definition of causality, we derive an iteratively formulated canonical decomposition of multipartite causal correlations. For a fixed number of settings and outcomes for each party, these correlations form a polytope whose facets define causal inequalities. The case of quantum correlations in this paradigm is captured by the process matrix formalism. We investigate the link between causality and the closely related notion of causal separability of quantum processes, which we here define rigorously in analogy with the link between Bell locality and separability of quantum states. We show that causality and causal separability are not equivalent in general by giving an example of a physically admissible tripartite quantum process that is causal but not causally separable. We also show that there are causally separable quantum processes that become non-causal if extended by supplying the parties with entangled ancillas. This motivates the concepts of extensibly causal and extensibly causally separable (ECS) processes, for which the respective property remains invariant under extension. We characterize the class of ECS quantum processes in the tripartite case via simple conditions on the form of the process matrix. We show that the processes realizable by classically controlled quantum circuits are ECS and conjecture that the reverse also holds.

Efficient quantum walk on a quantum processor

PubMed Central

Qiang, Xiaogang; Loke, Thomas; Montanaro, Ashley; Aungskunsiri, Kanin; Zhou, Xiaoqi; O'Brien, Jeremy L.; Wang, Jingbo B.; Matthews, Jonathan C. F.

2016-01-01

The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise, quantum walks have shown much potential as a framework for developing new quantum algorithms. Here we present explicit efficient quantum circuits for implementing continuous-time quantum walks on the circulant class of graphs. These circuits allow us to sample from the output probability distributions of quantum walks on circulant graphs efficiently. We also show that solving the same sampling problem for arbitrary circulant quantum circuits is intractable for a classical computer, assuming conjectures from computational complexity theory. This is a new link between continuous-time quantum walks and computational complexity theory and it indicates a family of tasks that could ultimately demonstrate quantum supremacy over classical computers. As a proof of principle, we experimentally implement the proposed quantum circuit on an example circulant graph using a two-qubit photonics quantum processor. PMID:27146471

Estimating the Resources for Quantum Computation with the QuRE Toolbox

DTIC Science & Technology

2013-05-31

quantum computing. Quantum Info. Comput., 9(7):666–682, July 2009. [13] M. Saffman, T. G. Walker, and K. Mølmer. Quantum information with rydberg atoms...109(5):735–750, 2011. [24] Aram Harrow , Avinatan Hassidim, and Seth Lloyd. Quantum algorithm for solving linear systems of equations. Phys. Rev

Non-Markovian dynamics in chiral quantum networks with spins and photons

NASA Astrophysics Data System (ADS)

Ramos, Tomás; Vermersch, Benoît; Hauke, Philipp; Pichler, Hannes; Zoller, Peter

2016-06-01

We study the dynamics of chiral quantum networks consisting of nodes coupled by unidirectional or asymmetric bidirectional quantum channels. In contrast to familiar photonic networks where driven two-level atoms exchange photons via 1D photonic nanostructures, we propose and study a setup where interactions between the atoms are mediated by spin excitations (magnons) in 1D X X spin chains representing spin waveguides. While Markovian quantum network theory eliminates quantum channels as structureless reservoirs in a Born-Markov approximation to obtain a master equation for the nodes, we are interested in non-Markovian dynamics. This arises from the nonlinear character of the dispersion with band-edge effects, and from finite spin propagation velocities leading to time delays in interactions. To account for the non-Markovian dynamics we treat the quantum degrees of freedom of the nodes and connecting channel as a composite spin system with the surrounding of the quantum network as a Markovian bath, allowing for an efficient solution with time-dependent density matrix renormalization-group techniques. We illustrate our approach showing non-Markovian effects in the driven-dissipative formation of quantum dimers, and we present examples for quantum information protocols involving quantum state transfer with engineered elements as basic building blocks of quantum spintronic circuits.

Entanglement in a Quantum Annealing Processor

DTIC Science & Technology

2016-09-07

that QA is a viable technology for large- scale quantum computing . DOI: 10.1103/PhysRevX.4.021041 Subject Areas: Quantum Physics, Quantum Information...Superconductivity I. INTRODUCTION The past decade has been exciting for the field of quantum computation . A wide range of physical imple- mentations...measurements used in studying prototype universal quantum computers [9–14]. These constraints make it challenging to experimentally determine whether a scalable

Quantum Optical Implementations of Current Quantum Computing Paradigms

DTIC Science & Technology

2005-05-01

Conferences and Proceedings: The results were presented at several conferences. These include: 1. M. O. Scully, " Foundations of Quantum Mechanics ", in...applications have revealed a strong connection between the fundamental aspects of quantum mechanics that governs physical systems and the informational...could be solved in polynomial time using quantum computers. Another set of problems where quantum mechanics can carry out computations substantially

Dynamics of Single-Photon Emission from Electrically Pumped Color Centers

NASA Astrophysics Data System (ADS)

Khramtsov, Igor A.; Agio, Mario; Fedyanin, Dmitry Yu.

2017-08-01

Low-power, high-speed, and bright electrically driven true single-photon sources, which are able to operate at room temperature, are vital for the practical realization of quantum-communication networks and optical quantum computations. Color centers in semiconductors are currently the best candidates; however, in spite of their intensive study in the past decade, the behavior of color centers in electrically controlled systems is poorly understood. Here we present a physical model and establish a theoretical approach to address single-photon emission dynamics of electrically pumped color centers, which interprets experimental results. We support our analysis with self-consistent numerical simulations of a single-photon emitting diode based on a single nitrogen-vacancy center in diamond and predict the second-order autocorrelation function and other emission characteristics. Our theoretical findings demonstrate remarkable agreement with the experimental results and pave the way to the understanding of single-electron and single-photon processes in semiconductors.

Experimental Adiabatic Quantum Factorization under Ambient Conditions Based on a Solid-State Single Spin System.

PubMed

Xu, Kebiao; Xie, Tianyu; Li, Zhaokai; Xu, Xiangkun; Wang, Mengqi; Ye, Xiangyu; Kong, Fei; Geng, Jianpei; Duan, Changkui; Shi, Fazhan; Du, Jiangfeng

2017-03-31

The adiabatic quantum computation is a universal and robust method of quantum computing. In this architecture, the problem can be solved by adiabatically evolving the quantum processor from the ground state of a simple initial Hamiltonian to that of a final one, which encodes the solution of the problem. Adiabatic quantum computation has been proved to be a compatible candidate for scalable quantum computation. In this Letter, we report on the experimental realization of an adiabatic quantum algorithm on a single solid spin system under ambient conditions. All elements of adiabatic quantum computation, including initial state preparation, adiabatic evolution (simulated by optimal control), and final state read-out, are realized experimentally. As an example, we found the ground state of the problem Hamiltonian S_{z}I_{z} on our adiabatic quantum processor, which can be mapped to the factorization of 35 into its prime factors 5 and 7.

Experimental Adiabatic Quantum Factorization under Ambient Conditions Based on a Solid-State Single Spin System

NASA Astrophysics Data System (ADS)

Xu, Kebiao; Xie, Tianyu; Li, Zhaokai; Xu, Xiangkun; Wang, Mengqi; Ye, Xiangyu; Kong, Fei; Geng, Jianpei; Duan, Changkui; Shi, Fazhan; Du, Jiangfeng

2017-03-01

The adiabatic quantum computation is a universal and robust method of quantum computing. In this architecture, the problem can be solved by adiabatically evolving the quantum processor from the ground state of a simple initial Hamiltonian to that of a final one, which encodes the solution of the problem. Adiabatic quantum computation has been proved to be a compatible candidate for scalable quantum computation. In this Letter, we report on the experimental realization of an adiabatic quantum algorithm on a single solid spin system under ambient conditions. All elements of adiabatic quantum computation, including initial state preparation, adiabatic evolution (simulated by optimal control), and final state read-out, are realized experimentally. As an example, we found the ground state of the problem Hamiltonian SzIz on our adiabatic quantum processor, which can be mapped to the factorization of 35 into its prime factors 5 and 7.

Compressed quantum computation using a remote five-qubit quantum computer

NASA Astrophysics Data System (ADS)

Hebenstreit, M.; Alsina, D.; Latorre, J. I.; Kraus, B.

2017-05-01

The notion of compressed quantum computation is employed to simulate the Ising interaction of a one-dimensional chain consisting of n qubits using the universal IBM cloud quantum computer running on log2(n ) qubits. The external field parameter that controls the quantum phase transition of this model translates into particular settings of the quantum gates that generate the circuit. We measure the magnetization, which displays the quantum phase transition, on a two-qubit system, which simulates a four-qubit Ising chain, and show its agreement with the theoretical prediction within a certain error. We also discuss the relevant point of how to assess errors when using a cloud quantum computer with a limited amount of runs. As a solution, we propose to use validating circuits, that is, to run independent controlled quantum circuits of similar complexity to the circuit of interest.

Experimental comparison of two quantum computing architectures.

PubMed

Linke, Norbert M; Maslov, Dmitri; Roetteler, Martin; Debnath, Shantanu; Figgatt, Caroline; Landsman, Kevin A; Wright, Kenneth; Monroe, Christopher

2017-03-28

We run a selection of algorithms on two state-of-the-art 5-qubit quantum computers that are based on different technology platforms. One is a publicly accessible superconducting transmon device (www. ibm.com/ibm-q) with limited connectivity, and the other is a fully connected trapped-ion system. Even though the two systems have different native quantum interactions, both can be programed in a way that is blind to the underlying hardware, thus allowing a comparison of identical quantum algorithms between different physical systems. We show that quantum algorithms and circuits that use more connectivity clearly benefit from a better-connected system of qubits. Although the quantum systems here are not yet large enough to eclipse classical computers, this experiment exposes critical factors of scaling quantum computers, such as qubit connectivity and gate expressivity. In addition, the results suggest that codesigning particular quantum applications with the hardware itself will be paramount in successfully using quantum computers in the future.

Continuous-variable quantum Gaussian process regression and quantum singular value decomposition of nonsparse low-rank matrices

NASA Astrophysics Data System (ADS)

Das, Siddhartha; Siopsis, George; Weedbrook, Christian

2018-02-01

With the significant advancement in quantum computation during the past couple of decades, the exploration of machine-learning subroutines using quantum strategies has become increasingly popular. Gaussian process regression is a widely used technique in supervised classical machine learning. Here we introduce an algorithm for Gaussian process regression using continuous-variable quantum systems that can be realized with technology based on photonic quantum computers under certain assumptions regarding distribution of data and availability of efficient quantum access. Our algorithm shows that by using a continuous-variable quantum computer a dramatic speedup in computing Gaussian process regression can be achieved, i.e., the possibility of exponentially reducing the time to compute. Furthermore, our results also include a continuous-variable quantum-assisted singular value decomposition method of nonsparse low rank matrices and forms an important subroutine in our Gaussian process regression algorithm.

Non-classical light generated by quantum-noise-driven cavity optomechanics.

PubMed

Brooks, Daniel W C; Botter, Thierry; Schreppler, Sydney; Purdy, Thomas P; Brahms, Nathan; Stamper-Kurn, Dan M

2012-08-23

Optomechanical systems, in which light drives and is affected by the motion of a massive object, will comprise a new framework for nonlinear quantum optics, with applications ranging from the storage and transduction of quantum information to enhanced detection sensitivity in gravitational wave detectors. However, quantum optical effects in optomechanical systems have remained obscure, because their detection requires the object’s motion to be dominated by vacuum fluctuations in the optical radiation pressure; so far, direct observations have been stymied by technical and thermal noise. Here we report an implementation of cavity optomechanics using ultracold atoms in which the collective atomic motion is dominantly driven by quantum fluctuations in radiation pressure. The back-action of this motion onto the cavity light field produces ponderomotive squeezing. We detect this quantum phenomenon by measuring sub-shot-noise optical squeezing. Furthermore, the system acts as a low-power, high-gain, nonlinear parametric amplifier for optical fluctuations, demonstrating a gain of 20 dB with a pump corresponding to an average of only seven intracavity photons. These findings may pave the way for low-power quantum optical devices, surpassing quantum limits on position and force sensing, and the control and measurement of motion in quantum gases.

Scalable quantum computer architecture with coupled donor-quantum dot qubits

DOEpatents

Schenkel, Thomas; Lo, Cheuk Chi; Weis, Christoph; Lyon, Stephen; Tyryshkin, Alexei; Bokor, Jeffrey

2014-08-26

A quantum bit computing architecture includes a plurality of single spin memory donor atoms embedded in a semiconductor layer, a plurality of quantum dots arranged with the semiconductor layer and aligned with the donor atoms, wherein a first voltage applied across at least one pair of the aligned quantum dot and donor atom controls a donor-quantum dot coupling. A method of performing quantum computing in a scalable architecture quantum computing apparatus includes arranging a pattern of single spin memory donor atoms in a semiconductor layer, forming a plurality of quantum dots arranged with the semiconductor layer and aligned with the donor atoms, applying a first voltage across at least one aligned pair of a quantum dot and donor atom to control a donor-quantum dot coupling, and applying a second voltage between one or more quantum dots to control a Heisenberg exchange J coupling between quantum dots and to cause transport of a single spin polarized electron between quantum dots.

From Computational Photobiology to the Design of Vibrationally Coherent Molecular Devices and Motors

NASA Astrophysics Data System (ADS)

Olivucci, Massimo

2014-03-01

In the past multi-configurational quantum chemical computations coupled with molecular mechanics force fields have been employed to investigate spectroscopic, thermal and photochemical properties of visual pigments. Here we show how the same computational technology can nowadays be used to design, characterize and ultimately, prepare light-driven molecular switches which mimics the photophysics of the visual pigment bovine rhodopsin (Rh). When embedded in the protein cavity the chromophore of Rh undergoes an ultrafast and coherent photoisomerization. In order to design a synthetic chromophore displaying similar properties in common solvents, we recently focused on indanylidene-pyrroline (NAIP) systems. We found that these systems display light-induced ground state coherent vibrational motion similar to the one detected in Rh. Semi-classical trajectories provide a mechanistic description of the structural changes associated to the observed coherent motion which is shown to be ultimately due to periodic changes in the π-conjugation.

Experimental realization of universal geometric quantum gates with solid-state spins.

PubMed

Zu, C; Wang, W-B; He, L; Zhang, W-G; Dai, C-Y; Wang, F; Duan, L-M

2014-10-02

Experimental realization of a universal set of quantum logic gates is the central requirement for the implementation of a quantum computer. In an 'all-geometric' approach to quantum computation, the quantum gates are implemented using Berry phases and their non-Abelian extensions, holonomies, from geometric transformation of quantum states in the Hilbert space. Apart from its fundamental interest and rich mathematical structure, the geometric approach has some built-in noise-resilience features. On the experimental side, geometric phases and holonomies have been observed in thermal ensembles of liquid molecules using nuclear magnetic resonance; however, such systems are known to be non-scalable for the purposes of quantum computing. There are proposals to implement geometric quantum computation in scalable experimental platforms such as trapped ions, superconducting quantum bits and quantum dots, and a recent experiment has realized geometric single-bit gates in a superconducting system. Here we report the experimental realization of a universal set of geometric quantum gates using the solid-state spins of diamond nitrogen-vacancy centres. These diamond defects provide a scalable experimental platform with the potential for room-temperature quantum computing, which has attracted strong interest in recent years. Our experiment shows that all-geometric and potentially robust quantum computation can be realized with solid-state spin quantum bits, making use of recent advances in the coherent control of this system.

Universal quantum gates for Single Cooper Pair Box based quantum computing

NASA Technical Reports Server (NTRS)

Echternach, P.; Williams, C. P.; Dultz, S. C.; Braunstein, S.; Dowling, J. P.

2000-01-01

We describe a method for achieving arbitrary 1-qubit gates and controlled-NOT gates within the context of the Single Cooper Pair Box (SCB) approach to quantum computing. Such gates are sufficient to support universal quantum computation.

Dissipative quantum computing with open quantum walks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sinayskiy, Ilya; Petruccione, Francesco

An open quantum walk approach to the implementation of a dissipative quantum computing scheme is presented. The formalism is demonstrated for the example of an open quantum walk implementation of a 3 qubit quantum circuit consisting of 10 gates.

Nonadiabatic holonomic quantum computation in decoherence-free subspaces.

PubMed

Xu, G F; Zhang, J; Tong, D M; Sjöqvist, Erik; Kwek, L C

2012-10-26

Quantum computation that combines the coherence stabilization virtues of decoherence-free subspaces and the fault tolerance of geometric holonomic control is of great practical importance. Some schemes of adiabatic holonomic quantum computation in decoherence-free subspaces have been proposed in the past few years. However, nonadiabatic holonomic quantum computation in decoherence-free subspaces, which avoids a long run-time requirement but with all the robust advantages, remains an open problem. Here, we demonstrate how to realize nonadiabatic holonomic quantum computation in decoherence-free subspaces. By using only three neighboring physical qubits undergoing collective dephasing to encode one logical qubit, we realize a universal set of quantum gates.

Hybrid architecture for encoded measurement-based quantum computation

PubMed Central

Zwerger, M.; Briegel, H. J.; Dür, W.

2014-01-01

We present a hybrid scheme for quantum computation that combines the modular structure of elementary building blocks used in the circuit model with the advantages of a measurement-based approach to quantum computation. We show how to construct optimal resource states of minimal size to implement elementary building blocks for encoded quantum computation in a measurement-based way, including states for error correction and encoded gates. The performance of the scheme is determined by the quality of the resource states, where within the considered error model a threshold of the order of 10% local noise per particle for fault-tolerant quantum computation and quantum communication. PMID:24946906

Simulating chemistry using quantum computers.

PubMed

Kassal, Ivan; Whitfield, James D; Perdomo-Ortiz, Alejandro; Yung, Man-Hong; Aspuru-Guzik, Alán

2011-01-01

The difficulty of simulating quantum systems, well known to quantum chemists, prompted the idea of quantum computation. One can avoid the steep scaling associated with the exact simulation of increasingly large quantum systems on conventional computers, by mapping the quantum system to another, more controllable one. In this review, we discuss to what extent the ideas in quantum computation, now a well-established field, have been applied to chemical problems. We describe algorithms that achieve significant advantages for the electronic-structure problem, the simulation of chemical dynamics, protein folding, and other tasks. Although theory is still ahead of experiment, we outline recent advances that have led to the first chemical calculations on small quantum information processors.

A software methodology for compiling quantum programs

NASA Astrophysics Data System (ADS)

Häner, Thomas; Steiger, Damian S.; Svore, Krysta; Troyer, Matthias

2018-04-01

Quantum computers promise to transform our notions of computation by offering a completely new paradigm. To achieve scalable quantum computation, optimizing compilers and a corresponding software design flow will be essential. We present a software architecture for compiling quantum programs from a high-level language program to hardware-specific instructions. We describe the necessary layers of abstraction and their differences and similarities to classical layers of a computer-aided design flow. For each layer of the stack, we discuss the underlying methods for compilation and optimization. Our software methodology facilitates more rapid innovation among quantum algorithm designers, quantum hardware engineers, and experimentalists. It enables scalable compilation of complex quantum algorithms and can be targeted to any specific quantum hardware implementation.

Resonant transition-based quantum computation

NASA Astrophysics Data System (ADS)

Chiang, Chen-Fu; Hsieh, Chang-Yu

2017-05-01

In this article we assess a novel quantum computation paradigm based on the resonant transition (RT) phenomenon commonly associated with atomic and molecular systems. We thoroughly analyze the intimate connections between the RT-based quantum computation and the well-established adiabatic quantum computation (AQC). Both quantum computing frameworks encode solutions to computational problems in the spectral properties of a Hamiltonian and rely on the quantum dynamics to obtain the desired output state. We discuss how one can adapt any adiabatic quantum algorithm to a corresponding RT version and the two approaches are limited by different aspects of Hamiltonians' spectra. The RT approach provides a compelling alternative to the AQC under various circumstances. To better illustrate the usefulness of the novel framework, we analyze the time complexity of an algorithm for 3-SAT problems and discuss straightforward methods to fine tune its efficiency.

Quantum computing without wavefunctions: time-dependent density functional theory for universal quantum computation.

PubMed

Tempel, David G; Aspuru-Guzik, Alán

2012-01-01

We prove that the theorems of TDDFT can be extended to a class of qubit Hamiltonians that are universal for quantum computation. The theorems of TDDFT applied to universal Hamiltonians imply that single-qubit expectation values can be used as the basic variables in quantum computation and information theory, rather than wavefunctions. From a practical standpoint this opens the possibility of approximating observables of interest in quantum computations directly in terms of single-qubit quantities (i.e. as density functionals). Additionally, we also demonstrate that TDDFT provides an exact prescription for simulating universal Hamiltonians with other universal Hamiltonians that have different, and possibly easier-to-realize two-qubit interactions. This establishes the foundations of TDDFT for quantum computation and opens the possibility of developing density functionals for use in quantum algorithms.

Quantum Computing: Solving Complex Problems

ScienceCinema

DiVincenzo, David

2018-05-22

One of the motivating ideas of quantum computation was that there could be a new kind of machine that would solve hard problems in quantum mechanics. There has been significant progress towards the experimental realization of these machines (which I will review), but there are still many questions about how such a machine could solve computational problems of interest in quantum physics. New categorizations of the complexity of computational problems have now been invented to describe quantum simulation. The bad news is that some of these problems are believed to be intractable even on a quantum computer, falling into a quantum analog of the NP class. The good news is that there are many other new classifications of tractability that may apply to several situations of physical interest.

Cloud Quantum Computing of an Atomic Nucleus

NASA Astrophysics Data System (ADS)

Dumitrescu, E. F.; McCaskey, A. J.; Hagen, G.; Jansen, G. R.; Morris, T. D.; Papenbrock, T.; Pooser, R. C.; Dean, D. J.; Lougovski, P.

2018-05-01

We report a quantum simulation of the deuteron binding energy on quantum processors accessed via cloud servers. We use a Hamiltonian from pionless effective field theory at leading order. We design a low-depth version of the unitary coupled-cluster ansatz, use the variational quantum eigensolver algorithm, and compute the binding energy to within a few percent. Our work is the first step towards scalable nuclear structure computations on a quantum processor via the cloud, and it sheds light on how to map scientific computing applications onto nascent quantum devices.

Cloud Quantum Computing of an Atomic Nucleus

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dumitrescu, Eugene F.; McCaskey, Alex J.; Hagen, Gaute

Here, we report a quantum simulation of the deuteron binding energy on quantum processors accessed via cloud servers. We use a Hamiltonian from pionless effective field theory at leading order. We design a low-depth version of the unitary coupled-cluster ansatz, use the variational quantum eigensolver algorithm, and compute the binding energy to within a few percent. Our work is the first step towards scalable nuclear structure computations on a quantum processor via the cloud, and it sheds light on how to map scientific computing applications onto nascent quantum devices.

Cloud Quantum Computing of an Atomic Nucleus.

PubMed

Dumitrescu, E F; McCaskey, A J; Hagen, G; Jansen, G R; Morris, T D; Papenbrock, T; Pooser, R C; Dean, D J; Lougovski, P

2018-05-25

We report a quantum simulation of the deuteron binding energy on quantum processors accessed via cloud servers. We use a Hamiltonian from pionless effective field theory at leading order. We design a low-depth version of the unitary coupled-cluster ansatz, use the variational quantum eigensolver algorithm, and compute the binding energy to within a few percent. Our work is the first step towards scalable nuclear structure computations on a quantum processor via the cloud, and it sheds light on how to map scientific computing applications onto nascent quantum devices.

Cloud Quantum Computing of an Atomic Nucleus

DOE PAGES

Dumitrescu, Eugene F.; McCaskey, Alex J.; Hagen, Gaute; ...

2018-05-23

Here, we report a quantum simulation of the deuteron binding energy on quantum processors accessed via cloud servers. We use a Hamiltonian from pionless effective field theory at leading order. We design a low-depth version of the unitary coupled-cluster ansatz, use the variational quantum eigensolver algorithm, and compute the binding energy to within a few percent. Our work is the first step towards scalable nuclear structure computations on a quantum processor via the cloud, and it sheds light on how to map scientific computing applications onto nascent quantum devices.

QPSO-Based Adaptive DNA Computing Algorithm

PubMed Central

Karakose, Mehmet; Cigdem, Ugur

2013-01-01

DNA (deoxyribonucleic acid) computing that is a new computation model based on DNA molecules for information storage has been increasingly used for optimization and data analysis in recent years. However, DNA computing algorithm has some limitations in terms of convergence speed, adaptability, and effectiveness. In this paper, a new approach for improvement of DNA computing is proposed. This new approach aims to perform DNA computing algorithm with adaptive parameters towards the desired goal using quantum-behaved particle swarm optimization (QPSO). Some contributions provided by the proposed QPSO based on adaptive DNA computing algorithm are as follows: (1) parameters of population size, crossover rate, maximum number of operations, enzyme and virus mutation rate, and fitness function of DNA computing algorithm are simultaneously tuned for adaptive process, (2) adaptive algorithm is performed using QPSO algorithm for goal-driven progress, faster operation, and flexibility in data, and (3) numerical realization of DNA computing algorithm with proposed approach is implemented in system identification. Two experiments with different systems were carried out to evaluate the performance of the proposed approach with comparative results. Experimental results obtained with Matlab and FPGA demonstrate ability to provide effective optimization, considerable convergence speed, and high accuracy according to DNA computing algorithm. PMID:23935409

Electrically driven quantum light emission in electromechanically tuneable photonic crystal cavities

NASA Astrophysics Data System (ADS)

Petruzzella, M.; Pagliano, F. M.; Zobenica, Ž.; Birindelli, S.; Cotrufo, M.; van Otten, F. W. M.; van der Heijden, R. W.; Fiore, A.

2017-12-01

A single quantum dot deterministically coupled to a photonic crystal environment constitutes an indispensable elementary unit to both generate and manipulate single-photons in next-generation quantum photonic circuits. To date, the scaling of the number of these quantum nodes on a fully integrated chip has been prevented by the use of optical pumping strategies that require a bulky off-chip laser along with the lack of methods to control the energies of nano-cavities and emitters. Here, we concurrently overcome these limitations by demonstrating electrical injection of single excitonic lines within a nano-electro-mechanically tuneable photonic crystal cavity. When an electrically driven dot line is brought into resonance with a photonic crystal mode, its emission rate is enhanced. Anti-bunching experiments reveal the quantum nature of these on-demand sources emitting in the telecom range. These results represent an important step forward in the realization of integrated quantum optics experiments featuring multiple electrically triggered Purcell-enhanced single-photon sources embedded in a reconfigurable semiconductor architecture.

Probing the strongly driven spin-boson model in a superconducting quantum circuit.

PubMed

Magazzù, L; Forn-Díaz, P; Belyansky, R; Orgiazzi, J-L; Yurtalan, M A; Otto, M R; Lupascu, A; Wilson, C M; Grifoni, M

2018-04-11

Quantum two-level systems interacting with the surroundings are ubiquitous in nature. The interaction suppresses quantum coherence and forces the system towards a steady state. Such dissipative processes are captured by the paradigmatic spin-boson model, describing a two-state particle, the "spin", interacting with an environment formed by harmonic oscillators. A fundamental question to date is to what extent intense coherent driving impacts a strongly dissipative system. Here we investigate experimentally and theoretically a superconducting qubit strongly coupled to an electromagnetic environment and subjected to a coherent drive. This setup realizes the driven Ohmic spin-boson model. We show that the drive reinforces environmental suppression of quantum coherence, and that a coherent-to-incoherent transition can be achieved by tuning the drive amplitude. An out-of-equilibrium detailed balance relation is demonstrated. These results advance fundamental understanding of open quantum systems and bear potential for the design of entangled light-matter states.

Designing, programming, and optimizing a (small) quantum computer

NASA Astrophysics Data System (ADS)

Svore, Krysta

In 1982, Richard Feynman proposed to use a computer founded on the laws of quantum physics to simulate physical systems. In the more than thirty years since, quantum computers have shown promise to solve problems in number theory, chemistry, and materials science that would otherwise take longer than the lifetime of the universe to solve on an exascale classical machine. The practical realization of a quantum computer requires understanding and manipulating subtle quantum states while experimentally controlling quantum interference. It also requires an end-to-end software architecture for programming, optimizing, and implementing a quantum algorithm on the quantum device hardware. In this talk, we will introduce recent advances in connecting abstract theory to present-day real-world applications through software. We will highlight recent advancement of quantum algorithms and the challenges in ultimately performing a scalable solution on a quantum device.

Quantum Walk Schemes for Universal Quantum Computation

NASA Astrophysics Data System (ADS)

Underwood, Michael S.

Random walks are a powerful tool for the efficient implementation of algorithms in classical computation. Their quantum-mechanical analogues, called quantum walks, hold similar promise. Quantum walks provide a model of quantum computation that has recently been shown to be equivalent in power to the standard circuit model. As in the classical case, quantum walks take place on graphs and can undergo discrete or continuous evolution, though quantum evolution is unitary and therefore deterministic until a measurement is made. This thesis considers the usefulness of continuous-time quantum walks to quantum computation from the perspectives of both their fundamental power under various formulations, and their applicability in practical experiments. In one extant scheme, logical gates are effected by scattering processes. The results of an exhaustive search for single-qubit operations in this model are presented. It is shown that the number of distinct operations increases exponentially with the number of vertices in the scattering graph. A catalogue of all graphs on up to nine vertices that implement single-qubit unitaries at a specific set of momenta is included in an appendix. I develop a novel scheme for universal quantum computation called the discontinuous quantum walk, in which a continuous-time quantum walker takes discrete steps of evolution via perfect quantum state transfer through small 'widget' graphs. The discontinuous quantum-walk scheme requires an exponentially sized graph, as do prior discrete and continuous schemes. To eliminate the inefficient vertex resource requirement, a computation scheme based on multiple discontinuous walkers is presented. In this model, n interacting walkers inhabiting a graph with 2n vertices can implement an arbitrary quantum computation on an input of length n, an exponential savings over previous universal quantum walk schemes. This is the first quantum walk scheme that allows for the application of quantum error correction. The many-particle quantum walk can be viewed as a single quantum walk undergoing perfect state transfer on a larger weighted graph, obtained via equitable partitioning. I extend this formalism to non-simple graphs. Examples of the application of equitable partitioning to the analysis of quantum walks and many-particle quantum systems are discussed.

Adiabatic markovian dynamics.

PubMed

Oreshkov, Ognyan; Calsamiglia, John

2010-07-30

We propose a theory of adiabaticity in quantum markovian dynamics based on a decomposition of the Hilbert space induced by the asymptotic behavior of the Lindblad semigroup. A central idea of our approach is that the natural generalization of the concept of eigenspace of the Hamiltonian in the case of markovian dynamics is a noiseless subsystem with a minimal noisy cofactor. Unlike previous attempts to define adiabaticity for open systems, our approach deals exclusively with physical entities and provides a simple, intuitive picture at the Hilbert-space level, linking the notion of adiabaticity to the theory of noiseless subsystems. As two applications of our theory, we propose a general framework for decoherence-assisted computation in noiseless codes and a dissipation-driven approach to holonomic computation based on adiabatic dragging of subsystems that is generally not achievable by nondissipative means.

Step-by-step magic state encoding for efficient fault-tolerant quantum computation

PubMed Central

Goto, Hayato

2014-01-01

Quantum error correction allows one to make quantum computers fault-tolerant against unavoidable errors due to decoherence and imperfect physical gate operations. However, the fault-tolerant quantum computation requires impractically large computational resources for useful applications. This is a current major obstacle to the realization of a quantum computer. In particular, magic state distillation, which is a standard approach to universality, consumes the most resources in fault-tolerant quantum computation. For the resource problem, here we propose step-by-step magic state encoding for concatenated quantum codes, where magic states are encoded step by step from the physical level to the logical one. To manage errors during the encoding, we carefully use error detection. Since the sizes of intermediate codes are small, it is expected that the resource overheads will become lower than previous approaches based on the distillation at the logical level. Our simulation results suggest that the resource requirements for a logical magic state will become comparable to those for a single logical controlled-NOT gate. Thus, the present method opens a new possibility for efficient fault-tolerant quantum computation. PMID:25511387

Step-by-step magic state encoding for efficient fault-tolerant quantum computation.

PubMed

Goto, Hayato

2014-12-16

Quantum error correction allows one to make quantum computers fault-tolerant against unavoidable errors due to decoherence and imperfect physical gate operations. However, the fault-tolerant quantum computation requires impractically large computational resources for useful applications. This is a current major obstacle to the realization of a quantum computer. In particular, magic state distillation, which is a standard approach to universality, consumes the most resources in fault-tolerant quantum computation. For the resource problem, here we propose step-by-step magic state encoding for concatenated quantum codes, where magic states are encoded step by step from the physical level to the logical one. To manage errors during the encoding, we carefully use error detection. Since the sizes of intermediate codes are small, it is expected that the resource overheads will become lower than previous approaches based on the distillation at the logical level. Our simulation results suggest that the resource requirements for a logical magic state will become comparable to those for a single logical controlled-NOT gate. Thus, the present method opens a new possibility for efficient fault-tolerant quantum computation.

Secure entanglement distillation for double-server blind quantum computation.

PubMed

Morimae, Tomoyuki; Fujii, Keisuke

2013-07-12

Blind quantum computation is a new secure quantum computing protocol where a client, who does not have enough quantum technologies at her disposal, can delegate her quantum computation to a server, who has a fully fledged quantum computer, in such a way that the server cannot learn anything about the client's input, output, and program. If the client interacts with only a single server, the client has to have some minimum quantum power, such as the ability of emitting randomly rotated single-qubit states or the ability of measuring states. If the client interacts with two servers who share Bell pairs but cannot communicate with each other, the client can be completely classical. For such a double-server scheme, two servers have to share clean Bell pairs, and therefore the entanglement distillation is necessary in a realistic noisy environment. In this Letter, we show that it is possible to perform entanglement distillation in the double-server scheme without degrading the security of blind quantum computing.

Efficient universal blind quantum computation.

PubMed

Giovannetti, Vittorio; Maccone, Lorenzo; Morimae, Tomoyuki; Rudolph, Terry G

2013-12-06

We give a cheat sensitive protocol for blind universal quantum computation that is efficient in terms of computational and communication resources: it allows one party to perform an arbitrary computation on a second party's quantum computer without revealing either which computation is performed, or its input and output. The first party's computational capabilities can be extremely limited: she must only be able to create and measure single-qubit superposition states. The second party is not required to use measurement-based quantum computation. The protocol requires the (optimal) exchange of O(Jlog2(N)) single-qubit states, where J is the computational depth and N is the number of qubits needed for the computation.

High-speed linear optics quantum computing using active feed-forward.

PubMed

Prevedel, Robert; Walther, Philip; Tiefenbacher, Felix; Böhi, Pascal; Kaltenbaek, Rainer; Jennewein, Thomas; Zeilinger, Anton

2007-01-04

As information carriers in quantum computing, photonic qubits have the advantage of undergoing negligible decoherence. However, the absence of any significant photon-photon interaction is problematic for the realization of non-trivial two-qubit gates. One solution is to introduce an effective nonlinearity by measurements resulting in probabilistic gate operations. In one-way quantum computation, the random quantum measurement error can be overcome by applying a feed-forward technique, such that the future measurement basis depends on earlier measurement results. This technique is crucial for achieving deterministic quantum computation once a cluster state (the highly entangled multiparticle state on which one-way quantum computation is based) is prepared. Here we realize a concatenated scheme of measurement and active feed-forward in a one-way quantum computing experiment. We demonstrate that, for a perfect cluster state and no photon loss, our quantum computation scheme would operate with good fidelity and that our feed-forward components function with very high speed and low error for detected photons. With present technology, the individual computational step (in our case the individual feed-forward cycle) can be operated in less than 150 ns using electro-optical modulators. This is an important result for the future development of one-way quantum computers, whose large-scale implementation will depend on advances in the production and detection of the required highly entangled cluster states.

Atomic-scale investigations of current and future devices: from nitride-based transistors to quantum computing

NASA Astrophysics Data System (ADS)

Gordon, Luke

Our era is defined by its technology, and our future is dependent on its continued evolution. Over the past few decades, we have witnessed the expansion of advanced technology into all walks of life and all industries, driven by the exponential increase in the speed and power of semiconductor-based devices. However, as the length scale of devices reaches the atomic scale, a deep understanding of atomistic theory and its application is increasingly crucial. In order to illustrate the power of an atomistic approach to understanding devices, we will present results and conclusions from three interlinked projects: n-type doping of III-nitride semiconductors, defects for quantum computing, and macroscopic simulations of devices. First, we will study effective n-type doping of III-nitride semiconductors and their alloys, and analyze the barriers to effective n-type doping of III-nitrides and their alloys. In particular, we will study the formation of DX centers, and predict alloy composition onsets for various III-nitride alloys. In addition, we will perform a comprehensive study of alternative dopants, and provide potential alternative dopants to improve n-type conductivity in AlN and wide-band-gap nitride alloys. Next, we will discuss how atomic-scale defects can act as a curse for the development of quantum computers by contributing to decoherence at an atomic scale, specifically investigating the effect of two-level state defects (TLS) systems in alumina as a source of decoherence in superconducting qubits based on Josephson junctions; and also as a blessing, by allowing the identification of wholly new qubits in different materials, specifically showing calculations on defects in SiC for quantum computing applications. Finally, we will provide examples of recent calculations we have performed for devices using macrosopic device simulations, largely in conjunction with first-principles calculations. Specifically, we will discuss the power of using a multi-scale approach to accurately model oxide and nitride-based heterostructures, and thereby illustrate our ability to predict device performance on scales unreachable using a purely first-principles approach.

A Decoherence-Free Quantum Memory Using Trapped Ions

DTIC Science & Technology

2016-09-22

superpo- sitions. Robust quantum memories are there- fore essential to realizing the potential gains of quantum computing (3). However, inter- action of a...tolerant quantum logic (13, 14). These properties suggest that DFSs will be intrinsic to future quantum computing architectures. Logic gates on DFS...practi- cal quantum computing will in any case re- quire logic gates of a much higher fidelity than those used in this work. We therefore expect that, once

Harnessing Disordered-Ensemble Quantum Dynamics for Machine Learning

NASA Astrophysics Data System (ADS)

Fujii, Keisuke; Nakajima, Kohei

2017-08-01

The quantum computer has an amazing potential of fast information processing. However, the realization of a digital quantum computer is still a challenging problem requiring highly accurate controls and key application strategies. Here we propose a platform, quantum reservoir computing, to solve these issues successfully by exploiting the natural quantum dynamics of ensemble systems, which are ubiquitous in laboratories nowadays, for machine learning. This framework enables ensemble quantum systems to universally emulate nonlinear dynamical systems including classical chaos. A number of numerical experiments show that quantum systems consisting of 5-7 qubits possess computational capabilities comparable to conventional recurrent neural networks of 100-500 nodes. This discovery opens up a paradigm for information processing with artificial intelligence powered by quantum physics.

QCCM Center for Quantum Algorithms

DTIC Science & Technology

2008-10-17

algorithms (e.g., quantum walks and adiabatic computing ), as well as theoretical advances relating algorithms to physical implementations (e.g...Park, NC 27709-2211 15. SUBJECT TERMS Quantum algorithms, quantum computing , fault-tolerant error correction Richard Cleve MITACS East Academic...0511200 Algebraic results on quantum automata A. Ambainis, M. Beaudry, M. Golovkins, A. Kikusts, M. Mercer, D. Thrien Theory of Computing Systems 39(2006

Self-guaranteed measurement-based quantum computation

NASA Astrophysics Data System (ADS)

Hayashi, Masahito; Hajdušek, Michal

2018-05-01

In order to guarantee the output of a quantum computation, we usually assume that the component devices are trusted. However, when the total computation process is large, it is not easy to guarantee the whole system when we have scaling effects, unexpected noise, or unaccounted for correlations between several subsystems. If we do not trust the measurement basis or the prepared entangled state, we do need to be worried about such uncertainties. To this end, we propose a self-guaranteed protocol for verification of quantum computation under the scheme of measurement-based quantum computation where no prior-trusted devices (measurement basis or entangled state) are needed. The approach we present enables the implementation of verifiable quantum computation using the measurement-based model in the context of a particular instance of delegated quantum computation where the server prepares the initial computational resource and sends it to the client, who drives the computation by single-qubit measurements. Applying self-testing procedures, we are able to verify the initial resource as well as the operation of the quantum devices and hence the computation itself. The overhead of our protocol scales with the size of the initial resource state to the power of 4 times the natural logarithm of the initial state's size.

Limits on efficient computation in the physical world

NASA Astrophysics Data System (ADS)

Aaronson, Scott Joel

More than a speculative technology, quantum computing seems to challenge our most basic intuitions about how the physical world should behave. In this thesis I show that, while some intuitions from classical computer science must be jettisoned in the light of modern physics, many others emerge nearly unscathed; and I use powerful tools from computational complexity theory to help determine which are which. In the first part of the thesis, I attack the common belief that quantum computing resembles classical exponential parallelism, by showing that quantum computers would face serious limitations on a wider range of problems than was previously known. In particular, any quantum algorithm that solves the collision problem---that of deciding whether a sequence of n integers is one-to-one or two-to-one---must query the sequence O (n1/5) times. This resolves a question that was open for years; previously no lower bound better than constant was known. A corollary is that there is no "black-box" quantum algorithm to break cryptographic hash functions or solve the Graph Isomorphism problem in polynomial time. I also show that relative to an oracle, quantum computers could not solve NP-complete problems in polynomial time, even with the help of nonuniform "quantum advice states"; and that any quantum algorithm needs O (2n/4/n) queries to find a local minimum of a black-box function on the n-dimensional hypercube. Surprisingly, the latter result also leads to new classical lower bounds for the local search problem. Finally, I give new lower bounds on quantum one-way communication complexity, and on the quantum query complexity of total Boolean functions and recursive Fourier sampling. The second part of the thesis studies the relationship of the quantum computing model to physical reality. I first examine the arguments of Leonid Levin, Stephen Wolfram, and others who believe quantum computing to be fundamentally impossible. I find their arguments unconvincing without a "Sure/Shor separator"---a criterion that separates the already-verified quantum states from those that appear in Shor's factoring algorithm. I argue that such a separator should be based on a complexity classification of quantum states, and go on to create such a classification. Next I ask what happens to the quantum computing model if we take into account that the speed of light is finite---and in particular, whether Grover's algorithm still yields a quadratic speedup for searching a database. Refuting a claim by Benioff, I show that the surprising answer is yes. Finally, I analyze hypothetical models of computation that go even beyond quantum computing. I show that many such models would be as powerful as the complexity class PP, and use this fact to give a simple, quantum computing based proof that PP is closed under intersection. On the other hand, I also present one model---wherein we could sample the entire history of a hidden variable---that appears to be more powerful than standard quantum computing, but only slightly so.

Architectures for Quantum Simulation Showing a Quantum Speedup

NASA Astrophysics Data System (ADS)

Bermejo-Vega, Juan; Hangleiter, Dominik; Schwarz, Martin; Raussendorf, Robert; Eisert, Jens

2018-04-01

One of the main aims in the field of quantum simulation is to achieve a quantum speedup, often referred to as "quantum computational supremacy," referring to the experimental realization of a quantum device that computationally outperforms classical computers. In this work, we show that one can devise versatile and feasible schemes of two-dimensional, dynamical, quantum simulators showing such a quantum speedup, building on intermediate problems involving nonadaptive, measurement-based, quantum computation. In each of the schemes, an initial product state is prepared, potentially involving an element of randomness as in disordered models, followed by a short-time evolution under a basic translationally invariant Hamiltonian with simple nearest-neighbor interactions and a mere sampling measurement in a fixed basis. The correctness of the final-state preparation in each scheme is fully efficiently certifiable. We discuss experimental necessities and possible physical architectures, inspired by platforms of cold atoms in optical lattices and a number of others, as well as specific assumptions that enter the complexity-theoretic arguments. This work shows that benchmark settings exhibiting a quantum speedup may require little control, in contrast to universal quantum computing. Thus, our proposal puts a convincing experimental demonstration of a quantum speedup within reach in the near term.

Demonstration of measurement-only blind quantum computing

NASA Astrophysics Data System (ADS)

Greganti, Chiara; Roehsner, Marie-Christine; Barz, Stefanie; Morimae, Tomoyuki; Walther, Philip

2016-01-01

Blind quantum computing allows for secure cloud networks of quasi-classical clients and a fully fledged quantum server. Recently, a new protocol has been proposed, which requires a client to perform only measurements. We demonstrate a proof-of-principle implementation of this measurement-only blind quantum computing, exploiting a photonic setup to generate four-qubit cluster states for computation and verification. Feasible technological requirements for the client and the device-independent blindness make this scheme very applicable for future secure quantum networks.

Quantum machine learning.

PubMed

Biamonte, Jacob; Wittek, Peter; Pancotti, Nicola; Rebentrost, Patrick; Wiebe, Nathan; Lloyd, Seth

2017-09-13

Fuelled by increasing computer power and algorithmic advances, machine learning techniques have become powerful tools for finding patterns in data. Quantum systems produce atypical patterns that classical systems are thought not to produce efficiently, so it is reasonable to postulate that quantum computers may outperform classical computers on machine learning tasks. The field of quantum machine learning explores how to devise and implement quantum software that could enable machine learning that is faster than that of classical computers. Recent work has produced quantum algorithms that could act as the building blocks of machine learning programs, but the hardware and software challenges are still considerable.

Quantum machine learning

NASA Astrophysics Data System (ADS)

Biamonte, Jacob; Wittek, Peter; Pancotti, Nicola; Rebentrost, Patrick; Wiebe, Nathan; Lloyd, Seth

2017-09-01

Fuelled by increasing computer power and algorithmic advances, machine learning techniques have become powerful tools for finding patterns in data. Quantum systems produce atypical patterns that classical systems are thought not to produce efficiently, so it is reasonable to postulate that quantum computers may outperform classical computers on machine learning tasks. The field of quantum machine learning explores how to devise and implement quantum software that could enable machine learning that is faster than that of classical computers. Recent work has produced quantum algorithms that could act as the building blocks of machine learning programs, but the hardware and software challenges are still considerable.

Mapping repulsive to attractive interaction in driven-dissipative quantum systems

NASA Astrophysics Data System (ADS)

Li, Andy C. Y.; Koch, Jens

2017-11-01

Repulsive and attractive interactions usually lead to very different physics. Striking exceptions exist in the dynamics of driven-dissipative quantum systems. For the example of a photonic Bose-Hubbard dimer, we establish a one-to-one mapping relating cases of onsite repulsion and attraction. We prove that the mapping is valid for an entire class of Markovian open quantum systems with a time-reversal-invariant Hamiltonian and physically meaningful inverse-sign Hamiltonian. To underline the broad applicability of the mapping, we illustrate the one-to-one correspondence between the nonequilibrium dynamics in a geometrically frustrated spin lattice and those in a non-frustrated partner lattice.

Period doubling in period-one steady states

NASA Astrophysics Data System (ADS)

Wang, Reuben R. W.; Xing, Bo; Carlo, Gabriel G.; Poletti, Dario

2018-02-01

Nonlinear classical dissipative systems present a rich phenomenology in their "route to chaos," including period doubling, i.e., the system evolves with a period which is twice that of the driving. However, typically the attractor of a periodically driven quantum open system evolves with a period which exactly matches that of the driving. Here, we analyze a periodically driven many-body open quantum system whose classical correspondent presents period doubling. We show that by studying the dynamical correlations, it is possible to show the occurrence of period doubling in the quantum (period-one) steady state. We also discuss that such systems are natural candidates for clean and intrinsically robust Floquet time crystals.

Third-harmonic generation of a laser-driven quantum dot with impurity

NASA Astrophysics Data System (ADS)

Sakiroglu, S.; Kilic, D. Gul; Yesilgul, U.; Ungan, F.; Kasapoglu, E.; Sari, H.; Sokmen, I.

2018-06-01

The third-harmonic generation (THG) coefficient for a laser-driven quantum dot with an on-center Gaussian impurity under static magnetic field is theoretically investigated. Laser field effect is treated within the high-frequency Floquet approach and the analytical expression of the THG coefficient is deduced from the compact density-matrix approach. The numerical results demonstrate that the application of intense laser field causes substantial changes on the behavior of THG. In addition the position and magnitude of the resonant peak of THG coefficient is significantly affected by the magnetic field, quantum dot size and the characteristic parameters of the impurity potential.

Experimental comparison of two quantum computing architectures

PubMed Central

Linke, Norbert M.; Maslov, Dmitri; Roetteler, Martin; Debnath, Shantanu; Figgatt, Caroline; Landsman, Kevin A.; Wright, Kenneth; Monroe, Christopher

2017-01-01

We run a selection of algorithms on two state-of-the-art 5-qubit quantum computers that are based on different technology platforms. One is a publicly accessible superconducting transmon device (www.research.ibm.com/ibm-q) with limited connectivity, and the other is a fully connected trapped-ion system. Even though the two systems have different native quantum interactions, both can be programed in a way that is blind to the underlying hardware, thus allowing a comparison of identical quantum algorithms between different physical systems. We show that quantum algorithms and circuits that use more connectivity clearly benefit from a better-connected system of qubits. Although the quantum systems here are not yet large enough to eclipse classical computers, this experiment exposes critical factors of scaling quantum computers, such as qubit connectivity and gate expressivity. In addition, the results suggest that codesigning particular quantum applications with the hardware itself will be paramount in successfully using quantum computers in the future. PMID:28325879

Complex Instruction Set Quantum Computing

NASA Astrophysics Data System (ADS)

Sanders, G. D.; Kim, K. W.; Holton, W. C.

1998-03-01

In proposed quantum computers, electromagnetic pulses are used to implement logic gates on quantum bits (qubits). Gates are unitary transformations applied to coherent qubit wavefunctions and a universal computer can be created using a minimal set of gates. By applying many elementary gates in sequence, desired quantum computations can be performed. This reduced instruction set approach to quantum computing (RISC QC) is characterized by serial application of a few basic pulse shapes and a long coherence time. However, the unitary matrix of the overall computation is ultimately a unitary matrix of the same size as any of the elementary matrices. This suggests that we might replace a sequence of reduced instructions with a single complex instruction using an optimally taylored pulse. We refer to this approach as complex instruction set quantum computing (CISC QC). One trades the requirement for long coherence times for the ability to design and generate potentially more complex pulses. We consider a model system of coupled qubits interacting through nearest neighbor coupling and show that CISC QC can reduce the time required to perform quantum computations.

Quantum Error Correction

NASA Astrophysics Data System (ADS)

Lidar, Daniel A.; Brun, Todd A.

2013-09-01

Prologue; Preface; Part I. Background: 1. Introduction to decoherence and noise in open quantum systems Daniel Lidar and Todd Brun; 2. Introduction to quantum error correction Dave Bacon; 3. Introduction to decoherence-free subspaces and noiseless subsystems Daniel Lidar; 4. Introduction to quantum dynamical decoupling Lorenza Viola; 5. Introduction to quantum fault tolerance Panos Aliferis; Part II. Generalized Approaches to Quantum Error Correction: 6. Operator quantum error correction David Kribs and David Poulin; 7. Entanglement-assisted quantum error-correcting codes Todd Brun and Min-Hsiu Hsieh; 8. Continuous-time quantum error correction Ognyan Oreshkov; Part III. Advanced Quantum Codes: 9. Quantum convolutional codes Mark Wilde; 10. Non-additive quantum codes Markus Grassl and Martin Rötteler; 11. Iterative quantum coding systems David Poulin; 12. Algebraic quantum coding theory Andreas Klappenecker; 13. Optimization-based quantum error correction Andrew Fletcher; Part IV. Advanced Dynamical Decoupling: 14. High order dynamical decoupling Zhen-Yu Wang and Ren-Bao Liu; 15. Combinatorial approaches to dynamical decoupling Martin Rötteler and Pawel Wocjan; Part V. Alternative Quantum Computation Approaches: 16. Holonomic quantum computation Paolo Zanardi; 17. Fault tolerance for holonomic quantum computation Ognyan Oreshkov, Todd Brun and Daniel Lidar; 18. Fault tolerant measurement-based quantum computing Debbie Leung; Part VI. Topological Methods: 19. Topological codes Héctor Bombín; 20. Fault tolerant topological cluster state quantum computing Austin Fowler and Kovid Goyal; Part VII. Applications and Implementations: 21. Experimental quantum error correction Dave Bacon; 22. Experimental dynamical decoupling Lorenza Viola; 23. Architectures Jacob Taylor; 24. Error correction in quantum communication Mark Wilde; Part VIII. Critical Evaluation of Fault Tolerance: 25. Hamiltonian methods in QEC and fault tolerance Eduardo Novais, Eduardo Mucciolo and Harold Baranger; 26. Critique of fault-tolerant quantum information processing Robert Alicki; References; Index.

Simple proof of equivalence between adiabatic quantum computation and the circuit model.

PubMed

Mizel, Ari; Lidar, Daniel A; Mitchell, Morgan

2007-08-17

We prove the equivalence between adiabatic quantum computation and quantum computation in the circuit model. An explicit adiabatic computation procedure is given that generates a ground state from which the answer can be extracted. The amount of time needed is evaluated by computing the gap. We show that the procedure is computationally efficient.

Layered Architectures for Quantum Computers and Quantum Repeaters

NASA Astrophysics Data System (ADS)

Jones, Nathan C.

This chapter examines how to organize quantum computers and repeaters using a systematic framework known as layered architecture, where machine control is organized in layers associated with specialized tasks. The framework is flexible and could be used for analysis and comparison of quantum information systems. To demonstrate the design principles in practice, we develop architectures for quantum computers and quantum repeaters based on optically controlled quantum dots, showing how a myriad of technologies must operate synchronously to achieve fault-tolerance. Optical control makes information processing in this system very fast, scalable to large problem sizes, and extendable to quantum communication.

Spin and topological order in a periodically driven spin chain

NASA Astrophysics Data System (ADS)

Russomanno, Angelo; Friedman, Bat-el; Dalla Torre, Emanuele G.

2017-07-01

The periodically driven quantum Ising chain has recently attracted a large attention in the context of Floquet engineering. In addition to the common paramagnet and ferromagnet, this driven model can give rise to new topological phases. In this work, we systematically explore its quantum phase diagram by examining the properties of its Floquet ground state. We specifically focus on driving protocols with time-reversal invariant points, and demonstrate the existence of an infinite number of distinct phases. These phases are separated by second-order quantum phase transitions, accompanied by continuous changes of local and string order parameters, as well as sudden changes of a topological winding number and of the number of protected edge states. When one of these phase transitions is adiabatically crossed, the correlator associated to the order parameter is nonvanishing over a length scale which shows a Kibble-Zurek scaling. In some phases, the Floquet ground state spontaneously breaks the discrete time-translation symmetry of the Hamiltonian. Our findings provide a better understanding of topological phases in periodically driven clean integrable models.

Radio-frequency measurement in semiconductor quantum computation

NASA Astrophysics Data System (ADS)

Han, TianYi; Chen, MingBo; Cao, Gang; Li, HaiOu; Xiao, Ming; Guo, GuoPing

2017-05-01

Semiconductor quantum dots have attracted wide interest for the potential realization of quantum computation. To realize efficient quantum computation, fast manipulation and the corresponding readout are necessary. In the past few decades, considerable progress of quantum manipulation has been achieved experimentally. To meet the requirements of high-speed readout, radio-frequency (RF) measurement has been developed in recent years, such as RF-QPC (radio-frequency quantum point contact) and RF-DGS (radio-frequency dispersive gate sensor). Here we specifically demonstrate the principle of the radio-frequency reflectometry, then review the development and applications of RF measurement, which provides a feasible way to achieve high-bandwidth readout in quantum coherent control and also enriches the methods to study these artificial mesoscopic quantum systems. Finally, we prospect the future usage of radio-frequency reflectometry in scaling-up of the quantum computing models.

Magnetic resonance force microscopy quantum computer with tellurium donors in silicon.

PubMed

Berman, G P; Doolen, G D; Hammel, P C; Tsifrinovich, V I

2001-03-26

We propose a magnetic resonance force microscopy (MRFM)-based nuclear spin quantum computer using tellurium impurities in silicon. This approach to quantum computing combines well-developed silicon technology and expected advances in MRFM. Our proposal does not use electrostatic gates to realize quantum logic operations.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Andrianov, S N; Moiseev, S A

We propose a scheme of a quantum computer based on nanophotonic elements: two buses in the form of nanowaveguide resonators, two nanosized units of multiatom multiqubit quantum memory and a set of nanoprocessors in the form of photonic quantum transistors, each containing a pair of nanowaveguide ring resonators coupled via a quantum dot. The operation modes of nanoprocessor photonic quantum transistors are theoretically studied and the execution of main logical operations by means of them is demonstrated. We also discuss the prospects of the proposed nanophotonic quantum computer for operating in high-speed optical fibre networks. (quantum computations)

Beyond Moore's law: towards competitive quantum devices

NASA Astrophysics Data System (ADS)

Troyer, Matthias

2015-05-01

A century after the invention of quantum theory and fifty years after Bell's inequality we see the first quantum devices emerge as products that aim to be competitive with the best classical computing devices. While a universal quantum computer of non-trivial size is still out of reach there exist a number commercial and experimental devices: quantum random number generators, quantum simulators and quantum annealers. In this colloquium I will present some of these devices and validation tests we performed on them. Quantum random number generators use the inherent randomness in quantum measurements to produce true random numbers, unlike classical pseudorandom number generators which are inherently deterministic. Optical lattice emulators use ultracold atomic gases in optical lattices to mimic typical models of condensed matter physics. In my talk I will focus especially on the devices built by Canadian company D-Wave systems, which are special purpose quantum simulators for solving hard classical optimization problems. I will review the controversy around the quantum nature of these devices and will compare them to state of the art classical algorithms. I will end with an outlook towards universal quantum computing and end with the question: which important problems that are intractable even for post-exa-scale classical computers could we expect to solve once we have a universal quantum computer?

Thermodynamics of Weakly Measured Quantum Systems.

PubMed

Alonso, Jose Joaquin; Lutz, Eric; Romito, Alessandro

2016-02-26

We consider continuously monitored quantum systems and introduce definitions of work and heat along individual quantum trajectories that are valid for coherent superposition of energy eigenstates. We use these quantities to extend the first and second laws of stochastic thermodynamics to the quantum domain. We illustrate our results with the case of a weakly measured driven two-level system and show how to distinguish between quantum work and heat contributions. We finally employ quantum feedback control to suppress detector backaction and determine the work statistics.

Thermoelectric energy harvesting with quantum dots

NASA Astrophysics Data System (ADS)

Sothmann, Björn; Sánchez, Rafael; Jordan, Andrew N.

2015-01-01

We review recent theoretical work on thermoelectric energy harvesting in multi-terminal quantum-dot setups. We first discuss several examples of nanoscale heat engines based on Coulomb-coupled conductors. In particular, we focus on quantum dots in the Coulomb-blockade regime, chaotic cavities and resonant tunneling through quantum dots and wells. We then turn toward quantum-dot heat engines that are driven by bosonic degrees of freedom such as phonons, magnons and microwave photons. These systems provide interesting connections to spin caloritronics and circuit quantum electrodynamics.

A review of selected topics in physics based modeling for tunnel field-effect transistors

NASA Astrophysics Data System (ADS)

Esseni, David; Pala, Marco; Palestri, Pierpaolo; Alper, Cem; Rollo, Tommaso

2017-08-01

The research field on tunnel-FETs (TFETs) has been rapidly developing in the last ten years, driven by the quest for a new electronic switch operating at a supply voltage well below 1 V and thus delivering substantial improvements in the energy efficiency of integrated circuits. This paper reviews several aspects related to physics based modeling in TFETs, and shows how the description of these transistors implies a remarkable innovation and poses new challenges compared to conventional MOSFETs. A hierarchy of numerical models exist for TFETs covering a wide range of predictive capabilities and computational complexities. We start by reviewing seminal contributions on direct and indirect band-to-band tunneling (BTBT) modeling in semiconductors, from which most TCAD models have been actually derived. Then we move to the features and limitations of TCAD models themselves and to the discussion of what we define non-self-consistent quantum models, where BTBT is computed with rigorous quantum-mechanical models starting from frozen potential profiles and closed-boundary Schrödinger equation problems. We will then address models that solve the open-boundary Schrödinger equation problem, based either on the non-equilibrium Green’s function NEGF or on the quantum-transmitting-boundary formalism, and show how the computational burden of these models may vary in a wide range depending on the Hamiltonian employed in the calculations. A specific section is devoted to TFETs based on 2D crystals and van der Waals hetero-structures. The main goal of this paper is to provide the reader with an introduction to the most important physics based models for TFETs, and with a possible guidance to the wide and rapidly developing literature in this exciting research field.

Millimeter-wave interconnects for microwave-frequency quantum machines

NASA Astrophysics Data System (ADS)

Pechal, Marek; Safavi-Naeini, Amir H.

2017-10-01

Superconducting microwave circuits form a versatile platform for storing and manipulating quantum information. A major challenge to further scalability is to find approaches for connecting these systems over long distances and at high rates. One approach is to convert the quantum state of a microwave circuit to optical photons that can be transmitted over kilometers at room temperature with little loss. Many proposals for electro-optic conversion between microwave and optics use optical driving of a weak three-wave mixing nonlinearity to convert the frequency of an excitation. Residual absorption of this optical pump leads to heating, which is problematic at cryogenic temperatures. Here we propose an alternative approach where a nonlinear superconducting circuit is driven to interconvert between microwave-frequency (7 ×109 Hz) and millimeter-wave-frequency photons (3 ×1011 Hz). To understand the potential for quantum state conversion between microwave and millimeter-wave photons, we consider the driven four-wave mixing quantum dynamics of nonlinear circuits. In contrast to the linear dynamics of the driven three-wave mixing converters, the proposed four-wave mixing converter has nonlinear decoherence channels that lead to a more complex parameter space of couplings and pump powers that we map out. We consider physical realizations of such converter circuits by deriving theoretically the upper bound on the maximum obtainable nonlinear coupling between any two modes in a lossless circuit, and synthesizing an optimal circuit based on realistic materials that saturates this bound. Our proposed circuit dissipates less than 10-9 times the energy of current electro-optic converters per qubit. Finally, we outline the quantum link budget for optical, microwave, and millimeter-wave connections, showing that our approach is viable for realizing interconnected quantum processors for intracity or quantum data center environments.

Quantum simulation of quantum field theory using continuous variables

DOE PAGES

Marshall, Kevin; Pooser, Raphael C.; Siopsis, George; ...

2015-12-14

Much progress has been made in the field of quantum computing using continuous variables over the last couple of years. This includes the generation of extremely large entangled cluster states (10,000 modes, in fact) as well as a fault tolerant architecture. This has lead to the point that continuous-variable quantum computing can indeed be thought of as a viable alternative for universal quantum computing. With that in mind, we present a new algorithm for continuous-variable quantum computers which gives an exponential speedup over the best known classical methods. Specifically, this relates to efficiently calculating the scattering amplitudes in scalar bosonicmore » quantum field theory, a problem that is known to be hard using a classical computer. Thus, we give an experimental implementation based on cluster states that is feasible with today's technology.« less

Quantum simulation of quantum field theory using continuous variables

DOE Office of Scientific and Technical Information (OSTI.GOV)

Marshall, Kevin; Pooser, Raphael C.; Siopsis, George

Much progress has been made in the field of quantum computing using continuous variables over the last couple of years. This includes the generation of extremely large entangled cluster states (10,000 modes, in fact) as well as a fault tolerant architecture. This has lead to the point that continuous-variable quantum computing can indeed be thought of as a viable alternative for universal quantum computing. With that in mind, we present a new algorithm for continuous-variable quantum computers which gives an exponential speedup over the best known classical methods. Specifically, this relates to efficiently calculating the scattering amplitudes in scalar bosonicmore » quantum field theory, a problem that is known to be hard using a classical computer. Thus, we give an experimental implementation based on cluster states that is feasible with today's technology.« less

Gate sequence for continuous variable one-way quantum computation

PubMed Central

Su, Xiaolong; Hao, Shuhong; Deng, Xiaowei; Ma, Lingyu; Wang, Meihong; Jia, Xiaojun; Xie, Changde; Peng, Kunchi

2013-01-01

Measurement-based one-way quantum computation using cluster states as resources provides an efficient model to perform computation and information processing of quantum codes. Arbitrary Gaussian quantum computation can be implemented sufficiently by long single-mode and two-mode gate sequences. However, continuous variable gate sequences have not been realized so far due to an absence of cluster states larger than four submodes. Here we present the first continuous variable gate sequence consisting of a single-mode squeezing gate and a two-mode controlled-phase gate based on a six-mode cluster state. The quantum property of this gate sequence is confirmed by the fidelities and the quantum entanglement of two output modes, which depend on both the squeezing and controlled-phase gates. The experiment demonstrates the feasibility of implementing Gaussian quantum computation by means of accessible gate sequences.

Quantum Computer Games: Quantum Minesweeper

ERIC Educational Resources Information Center

Gordon, Michal; Gordon, Goren

2010-01-01

The computer game of quantum minesweeper is introduced as a quantum extension of the well-known classical minesweeper. Its main objective is to teach the unique concepts of quantum mechanics in a fun way. Quantum minesweeper demonstrates the effects of superposition, entanglement and their non-local characteristics. While in the classical…

Toward a superconducting quantum computer. Harnessing macroscopic quantum coherence.

PubMed

Tsai, Jaw-Shen

2010-01-01

Intensive research on the construction of superconducting quantum computers has produced numerous important achievements. The quantum bit (qubit), based on the Josephson junction, is at the heart of this research. This macroscopic system has the ability to control quantum coherence. This article reviews the current state of quantum computing as well as its history, and discusses its future. Although progress has been rapid, the field remains beset with unsolved issues, and there are still many new research opportunities open to physicists and engineers.

Novel Image Encryption based on Quantum Walks

PubMed Central

Yang, Yu-Guang; Pan, Qing-Xiang; Sun, Si-Jia; Xu, Peng

2015-01-01

Quantum computation has achieved a tremendous success during the last decades. In this paper, we investigate the potential application of a famous quantum computation model, i.e., quantum walks (QW) in image encryption. It is found that QW can serve as an excellent key generator thanks to its inherent nonlinear chaotic dynamic behavior. Furthermore, we construct a novel QW-based image encryption algorithm. Simulations and performance comparisons show that the proposal is secure enough for image encryption and outperforms prior works. It also opens the door towards introducing quantum computation into image encryption and promotes the convergence between quantum computation and image processing. PMID:25586889

Characterizing quantum supremacy in near-term devices

NASA Astrophysics Data System (ADS)

Boixo, Sergio; Isakov, Sergei V.; Smelyanskiy, Vadim N.; Babbush, Ryan; Ding, Nan; Jiang, Zhang; Bremner, Michael J.; Martinis, John M.; Neven, Hartmut

2018-06-01

A critical question for quantum computing in the near future is whether quantum devices without error correction can perform a well-defined computational task beyond the capabilities of supercomputers. Such a demonstration of what is referred to as quantum supremacy requires a reliable evaluation of the resources required to solve tasks with classical approaches. Here, we propose the task of sampling from the output distribution of random quantum circuits as a demonstration of quantum supremacy. We extend previous results in computational complexity to argue that this sampling task must take exponential time in a classical computer. We introduce cross-entropy benchmarking to obtain the experimental fidelity of complex multiqubit dynamics. This can be estimated and extrapolated to give a success metric for a quantum supremacy demonstration. We study the computational cost of relevant classical algorithms and conclude that quantum supremacy can be achieved with circuits in a two-dimensional lattice of 7 × 7 qubits and around 40 clock cycles. This requires an error rate of around 0.5% for two-qubit gates (0.05% for one-qubit gates), and it would demonstrate the basic building blocks for a fault-tolerant quantum computer.

STIC: Photonic Quantum Computation through Cavity Assisted Interaction

DTIC Science & Technology

2007-12-28

PRA ; available as quant-ph/06060791. Report for the grant “Photonic Quantum Computation through Cavity Assisted Interaction” from DTO Luming Duan...cavity •B. Wang, L.-M. Duan, PRA 72 (in press, 2005) Single-photon source Photonic Quantum Computation through Cavity-Assisted Interaction H. Jeff Kimble...interaction [Duan, Wang, Kimble, PRA 05] • “Investigate more efficient methods for combating noise in photonic quantum computation ” • Partial progress

Robust Quantum Computing using Molecules with Switchable Dipole

DTIC Science & Technology

2010-06-15

REPORT Robust quantum computing using molecules with switchable dipole 14. ABSTRACT 16. SECURITY CLASSIFICATION OF: Of the many systems studied to...Research Office P.O. Box 12211 Research Triangle Park, NC 27709-2211 15. SUBJECT TERMS Ultracold polar molecules, quantum computing , phase gates...From - To) 30-Aug-2006 Standard Form 298 (Rev 8/98) Prescribed by ANSI Std. Z39.18 - 31-Aug-2009 Robust quantum computing using molecules with

Trapped-Ion Quantum Logic with Global Radiation Fields.

PubMed

Weidt, S; Randall, J; Webster, S C; Lake, K; Webb, A E; Cohen, I; Navickas, T; Lekitsch, B; Retzker, A; Hensinger, W K

2016-11-25

Trapped ions are a promising tool for building a large-scale quantum computer. However, the number of required radiation fields for the realization of quantum gates in any proposed ion-based architecture scales with the number of ions within the quantum computer, posing a major obstacle when imagining a device with millions of ions. Here, we present a fundamentally different approach for trapped-ion quantum computing where this detrimental scaling vanishes. The method is based on individually controlled voltages applied to each logic gate location to facilitate the actual gate operation analogous to a traditional transistor architecture within a classical computer processor. To demonstrate the key principle of this approach we implement a versatile quantum gate method based on long-wavelength radiation and use this method to generate a maximally entangled state of two quantum engineered clock qubits with fidelity 0.985(12). This quantum gate also constitutes a simple-to-implement tool for quantum metrology, sensing, and simulation.

Quantum Computing and Second Quantization

DOE PAGES

Makaruk, Hanna Ewa

2017-02-10

Quantum computers are by their nature many particle quantum systems. Both the many-particle arrangement and being quantum are necessary for the existence of the entangled states, which are responsible for the parallelism of the quantum computers. Second quantization is a very important approximate method of describing such systems. This lecture will present the general idea of the second quantization, and discuss shortly some of the most important formulations of second quantization.

Quantum Computing and Second Quantization

DOE Office of Scientific and Technical Information (OSTI.GOV)

Makaruk, Hanna Ewa

Quantum computers are by their nature many particle quantum systems. Both the many-particle arrangement and being quantum are necessary for the existence of the entangled states, which are responsible for the parallelism of the quantum computers. Second quantization is a very important approximate method of describing such systems. This lecture will present the general idea of the second quantization, and discuss shortly some of the most important formulations of second quantization.

Numerical characteristics of quantum computer simulation

NASA Astrophysics Data System (ADS)

Chernyavskiy, A.; Khamitov, K.; Teplov, A.; Voevodin, V.; Voevodin, Vl.

2016-12-01

The simulation of quantum circuits is significantly important for the implementation of quantum information technologies. The main difficulty of such modeling is the exponential growth of dimensionality, thus the usage of modern high-performance parallel computations is relevant. As it is well known, arbitrary quantum computation in circuit model can be done by only single- and two-qubit gates, and we analyze the computational structure and properties of the simulation of such gates. We investigate the fact that the unique properties of quantum nature lead to the computational properties of the considered algorithms: the quantum parallelism make the simulation of quantum gates highly parallel, and on the other hand, quantum entanglement leads to the problem of computational locality during simulation. We use the methodology of the AlgoWiki project (algowiki-project.org) to analyze the algorithm. This methodology consists of theoretical (sequential and parallel complexity, macro structure, and visual informational graph) and experimental (locality and memory access, scalability and more specific dynamic characteristics) parts. Experimental part was made by using the petascale Lomonosov supercomputer (Moscow State University, Russia). We show that the simulation of quantum gates is a good base for the research and testing of the development methods for data intense parallel software, and considered methodology of the analysis can be successfully used for the improvement of the algorithms in quantum information science.

Experimental Blind Quantum Computing for a Classical Client.

PubMed

Huang, He-Liang; Zhao, Qi; Ma, Xiongfeng; Liu, Chang; Su, Zu-En; Wang, Xi-Lin; Li, Li; Liu, Nai-Le; Sanders, Barry C; Lu, Chao-Yang; Pan, Jian-Wei

2017-08-04

To date, blind quantum computing demonstrations require clients to have weak quantum devices. Here we implement a proof-of-principle experiment for completely classical clients. Via classically interacting with two quantum servers that share entanglement, the client accomplishes the task of having the number 15 factorized by servers who are denied information about the computation itself. This concealment is accompanied by a verification protocol that tests servers' honesty and correctness. Our demonstration shows the feasibility of completely classical clients and thus is a key milestone towards secure cloud quantum computing.

Experimental Blind Quantum Computing for a Classical Client

NASA Astrophysics Data System (ADS)

Huang, He-Liang; Zhao, Qi; Ma, Xiongfeng; Liu, Chang; Su, Zu-En; Wang, Xi-Lin; Li, Li; Liu, Nai-Le; Sanders, Barry C.; Lu, Chao-Yang; Pan, Jian-Wei

2017-08-01

To date, blind quantum computing demonstrations require clients to have weak quantum devices. Here we implement a proof-of-principle experiment for completely classical clients. Via classically interacting with two quantum servers that share entanglement, the client accomplishes the task of having the number 15 factorized by servers who are denied information about the computation itself. This concealment is accompanied by a verification protocol that tests servers' honesty and correctness. Our demonstration shows the feasibility of completely classical clients and thus is a key milestone towards secure cloud quantum computing.

Microwave-Driven Coherent Operation of a Semiconductor Quantum Dot Charge Qubit

DTIC Science & Technology

2015-02-16

indicating that understanding high frequency charge noise as well as charge relaxation at the sweet spot will be important for further development. The...Microwave-driven coherent operation of a semiconductor quantum dot charge qubit Dohun Kim,1 D. R. Ward,1 C. B. Simmons,1 John King Gamble,2 Robin...University of Wisconsin-Madison, Madison, WI 53706, USA A most intuitive realization of a qubit is a sin- gle electron charge sitting at two well -defined

Consistent description of quantum Brownian motors operating at strong friction.

PubMed

Machura, L; Kostur, M; Hänggi, P; Talkner, P; Luczka, J

2004-09-01

A quantum Smoluchowski equation is put forward that consistently describes thermal quantum states. In particular, it notably does not induce a violation of the second law of thermodynamics. This so modified kinetic equation is applied to study analytically directed quantum transport at strong friction in arbitrarily shaped ratchet potentials that are driven by nonthermal two-state noise. Depending on the mutual interplay of quantum tunneling and quantum reflection these quantum corrections can induce both, a sizable enhancement or a suppression of transport. Moreover, the threshold for current reversals becomes markedly shifted due to such quantum fluctuations.

Mathematical Theory of Generalized Duality Quantum Computers Acting on Vector-States

NASA Astrophysics Data System (ADS)

Cao, Huai-Xin; Long, Gui-Lu; Guo, Zhi-Hua; Chen, Zheng-Li

2013-06-01

Following the idea of duality quantum computation, a generalized duality quantum computer (GDQC) acting on vector-states is defined as a tuple consisting of a generalized quantum wave divider (GQWD) and a finite number of unitary operators as well as a generalized quantum wave combiner (GQWC). It is proved that the GQWD and GQWC of a GDQC are an isometry and a co-isometry, respectively, and mutually dual. It is also proved that every GDQC gives a contraction, called a generalized duality quantum gate (GDQG). A classification of GDQCs is given and the properties of GDQGs are discussed. Some applications are obtained, including two orthogonal duality quantum computer algorithms for unsorted database search and an understanding of the Mach-Zehnder interferometer.

Semiquantum key distribution with secure delegated quantum computation

PubMed Central

Li, Qin; Chan, Wai Hong; Zhang, Shengyu

2016-01-01

Semiquantum key distribution allows a quantum party to share a random key with a “classical” party who only can prepare and measure qubits in the computational basis or reorder some qubits when he has access to a quantum channel. In this work, we present a protocol where a secret key can be established between a quantum user and an almost classical user who only needs the quantum ability to access quantum channels, by securely delegating quantum computation to a quantum server. We show the proposed protocol is robust even when the delegated quantum server is a powerful adversary, and is experimentally feasible with current technology. As one party of our protocol is the most quantum-resource efficient, it can be more practical and significantly widen the applicability scope of quantum key distribution. PMID:26813384

Parallel Photonic Quantum Computation Assisted by Quantum Dots in One-Side Optical Microcavities

PubMed Central

Luo, Ming-Xing; Wang, Xiaojun

2014-01-01

Universal quantum logic gates are important elements for a quantum computer. In contrast to previous constructions on one degree of freedom (DOF) of quantum systems, we investigate the possibility of parallel quantum computations dependent on two DOFs of photon systems. We construct deterministic hyper-controlled-not (hyper-CNOT) gates operating on the spatial-mode and the polarization DOFs of two-photon or one-photon systems by exploring the giant optical circular birefringence induced by quantum-dot spins in one-sided optical microcavities. These hyper-CNOT gates show that the quantum states of two DOFs can be viewed as independent qubits without requiring auxiliary DOFs in theory. This result can reduce the quantum resources by half for quantum applications with large qubit systems, such as the quantum Shor algorithm. PMID:25030424

Parallel photonic quantum computation assisted by quantum dots in one-side optical microcavities.

PubMed

Luo, Ming-Xing; Wang, Xiaojun

2014-07-17

Universal quantum logic gates are important elements for a quantum computer. In contrast to previous constructions on one degree of freedom (DOF) of quantum systems, we investigate the possibility of parallel quantum computations dependent on two DOFs of photon systems. We construct deterministic hyper-controlled-not (hyper-CNOT) gates operating on the spatial-mode and the polarization DOFs of two-photon or one-photon systems by exploring the giant optical circular birefringence induced by quantum-dot spins in one-sided optical microcavities. These hyper-CNOT gates show that the quantum states of two DOFs can be viewed as independent qubits without requiring auxiliary DOFs in theory. This result can reduce the quantum resources by half for quantum applications with large qubit systems, such as the quantum Shor algorithm.

Performing quantum computing experiments in the cloud

NASA Astrophysics Data System (ADS)

Devitt, Simon J.

2016-09-01

Quantum computing technology has reached a second renaissance in the past five years. Increased interest from both the private and public sector combined with extraordinary theoretical and experimental progress has solidified this technology as a major advancement in the 21st century. As anticipated my many, some of the first realizations of quantum computing technology has occured over the cloud, with users logging onto dedicated hardware over the classical internet. Recently, IBM has released the Quantum Experience, which allows users to access a five-qubit quantum processor. In this paper we take advantage of this online availability of actual quantum hardware and present four quantum information experiments. We utilize the IBM chip to realize protocols in quantum error correction, quantum arithmetic, quantum graph theory, and fault-tolerant quantum computation by accessing the device remotely through the cloud. While the results are subject to significant noise, the correct results are returned from the chip. This demonstrates the power of experimental groups opening up their technology to a wider audience and will hopefully allow for the next stage of development in quantum information technology.

Greenberger-Horne-Zeilinger states-based blind quantum computation with entanglement concentration.

PubMed

Zhang, Xiaoqian; Weng, Jian; Lu, Wei; Li, Xiaochun; Luo, Weiqi; Tan, Xiaoqing

2017-09-11

In blind quantum computation (BQC) protocol, the quantum computability of servers are complicated and powerful, while the clients are not. It is still a challenge for clients to delegate quantum computation to servers and keep the clients' inputs, outputs and algorithms private. Unfortunately, quantum channel noise is unavoidable in the practical transmission. In this paper, a novel BQC protocol based on maximally entangled Greenberger-Horne-Zeilinger (GHZ) states is proposed which doesn't need a trusted center. The protocol includes a client and two servers, where the client only needs to own quantum channels with two servers who have full-advantage quantum computers. Two servers perform entanglement concentration used to remove the noise, where the success probability can almost reach 100% in theory. But they learn nothing in the process of concentration because of the no-signaling principle, so this BQC protocol is secure and feasible.

From transistor to trapped-ion computers for quantum chemistry.

PubMed

Yung, M-H; Casanova, J; Mezzacapo, A; McClean, J; Lamata, L; Aspuru-Guzik, A; Solano, E

2014-01-07

Over the last few decades, quantum chemistry has progressed through the development of computational methods based on modern digital computers. However, these methods can hardly fulfill the exponentially-growing resource requirements when applied to large quantum systems. As pointed out by Feynman, this restriction is intrinsic to all computational models based on classical physics. Recently, the rapid advancement of trapped-ion technologies has opened new possibilities for quantum control and quantum simulations. Here, we present an efficient toolkit that exploits both the internal and motional degrees of freedom of trapped ions for solving problems in quantum chemistry, including molecular electronic structure, molecular dynamics, and vibronic coupling. We focus on applications that go beyond the capacity of classical computers, but may be realizable on state-of-the-art trapped-ion systems. These results allow us to envision a new paradigm of quantum chemistry that shifts from the current transistor to a near-future trapped-ion-based technology.

From transistor to trapped-ion computers for quantum chemistry

PubMed Central

Yung, M.-H.; Casanova, J.; Mezzacapo, A.; McClean, J.; Lamata, L.; Aspuru-Guzik, A.; Solano, E.

2014-01-01

Over the last few decades, quantum chemistry has progressed through the development of computational methods based on modern digital computers. However, these methods can hardly fulfill the exponentially-growing resource requirements when applied to large quantum systems. As pointed out by Feynman, this restriction is intrinsic to all computational models based on classical physics. Recently, the rapid advancement of trapped-ion technologies has opened new possibilities for quantum control and quantum simulations. Here, we present an efficient toolkit that exploits both the internal and motional degrees of freedom of trapped ions for solving problems in quantum chemistry, including molecular electronic structure, molecular dynamics, and vibronic coupling. We focus on applications that go beyond the capacity of classical computers, but may be realizable on state-of-the-art trapped-ion systems. These results allow us to envision a new paradigm of quantum chemistry that shifts from the current transistor to a near-future trapped-ion-based technology. PMID:24395054

Protecting Information

NASA Astrophysics Data System (ADS)

Loepp, Susan; Wootters, William K.

2006-09-01

For many everyday transmissions, it is essential to protect digital information from noise or eavesdropping. This undergraduate introduction to error correction and cryptography is unique in devoting several chapters to quantum cryptography and quantum computing, thus providing a context in which ideas from mathematics and physics meet. By covering such topics as Shor's quantum factoring algorithm, this text informs the reader about current thinking in quantum information theory and encourages an appreciation of the connections between mathematics and science.Of particular interest are the potential impacts of quantum physics:(i) a quantum computer, if built, could crack our currently used public-key cryptosystems; and (ii) quantum cryptography promises to provide an alternative to these cryptosystems, basing its security on the laws of nature rather than on computational complexity. No prior knowledge of quantum mechanics is assumed, but students should have a basic knowledge of complex numbers, vectors, and matrices. Accessible to readers familiar with matrix algebra, vector spaces and complex numbers First undergraduate text to cover cryptography, error-correction, and quantum computation together Features exercises designed to enhance understanding, including a number of computational problems, available from www.cambridge.org/9780521534765

Universal measurement-based quantum computation in two-dimensional symmetry-protected topological phases

NASA Astrophysics Data System (ADS)

Wei, Tzu-Chieh; Huang, Ching-Yu

2017-09-01

Recent progress in the characterization of gapped quantum phases has also triggered the search for a universal resource for quantum computation in symmetric gapped phases. Prior works in one dimension suggest that it is a feature more common than previously thought, in that nontrivial one-dimensional symmetry-protected topological (SPT) phases provide quantum computational power characterized by the algebraic structure defining these phases. Progress in two and higher dimensions so far has been limited to special fixed points. Here we provide two families of two-dimensional Z2 symmetric wave functions such that there exists a finite region of the parameter in the SPT phases that supports universal quantum computation. The quantum computational power appears to lose its universality at the boundary between the SPT and the symmetry-breaking phases.

Towards quantum chemistry on a quantum computer.

PubMed

Lanyon, B P; Whitfield, J D; Gillett, G G; Goggin, M E; Almeida, M P; Kassal, I; Biamonte, J D; Mohseni, M; Powell, B J; Barbieri, M; Aspuru-Guzik, A; White, A G

2010-02-01

Exact first-principles calculations of molecular properties are currently intractable because their computational cost grows exponentially with both the number of atoms and basis set size. A solution is to move to a radically different model of computing by building a quantum computer, which is a device that uses quantum systems themselves to store and process data. Here we report the application of the latest photonic quantum computer technology to calculate properties of the smallest molecular system: the hydrogen molecule in a minimal basis. We calculate the complete energy spectrum to 20 bits of precision and discuss how the technique can be expanded to solve large-scale chemical problems that lie beyond the reach of modern supercomputers. These results represent an early practical step toward a powerful tool with a broad range of quantum-chemical applications.

Universal Quantum Computing with Arbitrary Continuous-Variable Encoding.

PubMed

Lau, Hoi-Kwan; Plenio, Martin B

2016-09-02

Implementing a qubit quantum computer in continuous-variable systems conventionally requires the engineering of specific interactions according to the encoding basis states. In this work, we present a unified formalism to conduct universal quantum computation with a fixed set of operations but arbitrary encoding. By storing a qubit in the parity of two or four qumodes, all computing processes can be implemented by basis state preparations, continuous-variable exponential-swap operations, and swap tests. Our formalism inherits the advantages that the quantum information is decoupled from collective noise, and logical qubits with different encodings can be brought to interact without decoding. We also propose a possible implementation of the required operations by using interactions that are available in a variety of continuous-variable systems. Our work separates the "hardware" problem of engineering quantum-computing-universal interactions, from the "software" problem of designing encodings for specific purposes. The development of quantum computer architecture could hence be simplified.

Universal Quantum Computing with Arbitrary Continuous-Variable Encoding

NASA Astrophysics Data System (ADS)

Lau, Hoi-Kwan; Plenio, Martin B.

2016-09-01

Implementing a qubit quantum computer in continuous-variable systems conventionally requires the engineering of specific interactions according to the encoding basis states. In this work, we present a unified formalism to conduct universal quantum computation with a fixed set of operations but arbitrary encoding. By storing a qubit in the parity of two or four qumodes, all computing processes can be implemented by basis state preparations, continuous-variable exponential-swap operations, and swap tests. Our formalism inherits the advantages that the quantum information is decoupled from collective noise, and logical qubits with different encodings can be brought to interact without decoding. We also propose a possible implementation of the required operations by using interactions that are available in a variety of continuous-variable systems. Our work separates the "hardware" problem of engineering quantum-computing-universal interactions, from the "software" problem of designing encodings for specific purposes. The development of quantum computer architecture could hence be simplified.

Two-Dimensional Arrays of Neutral Atom Quantum Gates

DTIC Science & Technology

2012-10-20

Box 12211 Research Triangle Park, NC 27709-2211 15. SUBJECT TERMS quantum computing , Rydberg atoms, entanglement Mark Saffman University of...Nature Physics, (01 2009): 0. doi: 10.1038/nphys1178 10/19/2012 9.00 K. Mølmer, M. Saffman. Scaling the neutral-atom Rydberg gate quantum computer by...Saffman, E. Brion, K. Mølmer. Error Correction in Ensemble Registers for Quantum Repeaters and Quantum Computers , Physical Review Letters, (3 2008): 0

QUANTUM COMPUTING: Quantum Entangled Bits Step Closer to IT.

PubMed

Zeilinger, A

2000-07-21

In contrast to today's computers, quantum computers and information technologies may in future be able to store and transmit information not only in the state "0" or "1," but also in superpositions of the two; information will then be stored and transmitted in entangled quantum states. Zeilinger discusses recent advances toward using this principle for quantum cryptography and highlights studies into the entanglement (or controlled superposition) of several photons, atoms, or ions.

Integrated Visible Photonics for Trapped-Ion Quantum Computing

DTIC Science & Technology

2017-06-10

necessarily reflect the views of the Department of Defense. Abstract- A scalable trapped-ion-based quantum - computing architecture requires the... Quantum Computing Dave Kharas, Cheryl Sorace-Agaskar, Suraj Bramhavar, William Loh, Jeremy M. Sage, Paul W. Juodawlkis, and John...coherence times, strong coulomb interactions, and optical addressability, hold great promise for implementation of practical quantum information

Algorithms Bridging Quantum Computation and Chemistry

NASA Astrophysics Data System (ADS)

McClean, Jarrod Ryan

The design of new materials and chemicals derived entirely from computation has long been a goal of computational chemistry, and the governing equation whose solution would permit this dream is known. Unfortunately, the exact solution to this equation has been far too expensive and clever approximations fail in critical situations. Quantum computers offer a novel solution to this problem. In this work, we develop not only new algorithms to use quantum computers to study hard problems in chemistry, but also explore how such algorithms can help us to better understand and improve our traditional approaches. In particular, we first introduce a new method, the variational quantum eigensolver, which is designed to maximally utilize the quantum resources available in a device to solve chemical problems. We apply this method in a real quantum photonic device in the lab to study the dissociation of the helium hydride (HeH+) molecule. We also enhance this methodology with architecture specific optimizations on ion trap computers and show how linear-scaling techniques from traditional quantum chemistry can be used to improve the outlook of similar algorithms on quantum computers. We then show how studying quantum algorithms such as these can be used to understand and enhance the development of classical algorithms. In particular we use a tool from adiabatic quantum computation, Feynman's Clock, to develop a new discrete time variational principle and further establish a connection between real-time quantum dynamics and ground state eigenvalue problems. We use these tools to develop two novel parallel-in-time quantum algorithms that outperform competitive algorithms as well as offer new insights into the connection between the fermion sign problem of ground states and the dynamical sign problem of quantum dynamics. Finally we use insights gained in the study of quantum circuits to explore a general notion of sparsity in many-body quantum systems. In particular we use developments from the field of compressed sensing to find compact representations of ground states. As an application we study electronic systems and find solutions dramatically more compact than traditional configuration interaction expansions, offering hope to extend this methodology to challenging systems in chemical and material design.

Field-Driven Quantum Criticality in the Spinel Magnet ZnCr2 Se4

NASA Astrophysics Data System (ADS)

Gu, C. C.; Zhao, Z. Y.; Chen, X. L.; Lee, M.; Choi, E. S.; Han, Y. Y.; Ling, L. S.; Pi, L.; Zhang, Y. H.; Chen, G.; Yang, Z. R.; Zhou, H. D.; Sun, X. F.

2018-04-01

We report detailed dc and ac magnetic susceptibilities, specific heat, and thermal conductivity measurements on the frustrated magnet ZnCr2 Se4 . At low temperatures, with an increasing magnetic field, this spinel material goes through a series of spin state transitions from the helix spin state to the spiral spin state and then to the fully polarized state. Our results indicate a direct quantum phase transition from the spiral spin state to the fully polarized state. As the system approaches the quantum criticality, we find strong quantum fluctuations of the spins with behaviors such as an unconventional T2 -dependent specific heat and temperature-independent mean free path for the thermal transport. We complete the full phase diagram of ZnCr2 Se4 under the external magnetic field and propose the possibility of frustrated quantum criticality with extended densities of critical modes to account for the unusual low-energy excitations in the vicinity of the criticality. Our results reveal that ZnCr2 Se4 is a rare example of a 3D magnet exhibiting a field-driven quantum criticality with unconventional properties.

Geometry dependent suppression of collective quantum jumps in Rydberg atoms

NASA Astrophysics Data System (ADS)

Lees, Eitan; Clemens, James

2015-05-01

We consider N driven, damped Rydberg atoms in different spatial arrangements. Treating the atoms as two-level systems we model the coupling to the environment via the Lehmberg-Agarwal master equation which interpolates between fully independent and fully collective spontaneous emission depending on the specific locations of the atoms. We also include a collective dipole-dipole energy shift in the excited Rydberg state which leads to collective quantum jumps in the atomic excitation when the system is driven off resonance. We show that the quantum jumps are suppressed as the system makes a transition from independent to collective emission as the spacing of a linear array of atoms is decreased below the emission wavelength.

Models of optical quantum computing

NASA Astrophysics Data System (ADS)

Krovi, Hari

2017-03-01

I review some work on models of quantum computing, optical implementations of these models, as well as the associated computational power. In particular, we discuss the circuit model and cluster state implementations using quantum optics with various encodings such as dual rail encoding, Gottesman-Kitaev-Preskill encoding, and coherent state encoding. Then we discuss intermediate models of optical computing such as boson sampling and its variants. Finally, we review some recent work in optical implementations of adiabatic quantum computing and analog optical computing. We also provide a brief description of the relevant aspects from complexity theory needed to understand the results surveyed.

On the 'principle of the quantumness', the quantumness of Relativity, and the computational grand-unification

DOE Office of Scientific and Technical Information (OSTI.GOV)

D'Ariano, Giacomo Mauro

2010-05-04

I will argue that the proposal of establishing operational foundations of Quantum Theory should have top-priority, and that the Lucien Hardy's program on Quantum Gravity should be paralleled by an analogous program on Quantum Field Theory (QFT), which needs to be reformulated, notwithstanding its experimental success. In this paper, after reviewing recently suggested operational 'principles of the quantumness', I address the problem on whether Quantum Theory and Special Relativity are unrelated theories, or instead, if the one implies the other. I show how Special Relativity can be indeed derived from causality of Quantum Theory, within the computational paradigm 'the universemore » is a huge quantum computer', reformulating QFT as a Quantum-Computational Field Theory (QCFT). In QCFT Special Relativity emerges from the fabric of the computational network, which also naturally embeds gauge invariance. In this scheme even the quantization rule and the Planck constant can in principle be derived as emergent from the underlying causal tapestry of space-time. In this way Quantum Theory remains the only theory operating the huge computer of the universe.Is the computational paradigm only a speculative tautology (theory as simulation of reality), or does it have a scientific value? The answer will come from Occam's razor, depending on the mathematical simplicity of QCFT. Here I will just start scratching the surface of QCFT, analyzing simple field theories, including Dirac's. The number of problems and unmotivated recipes that plague QFT strongly motivates us to undertake the QCFT project, since QCFT makes all such problems manifest, and forces a re-foundation of QFT.« less

Enhancing the brightness of electrically driven single-photon sources using color centers in silicon carbide

NASA Astrophysics Data System (ADS)

Khramtsov, Igor A.; Vyshnevyy, Andrey A.; Fedyanin, Dmitry Yu.

2018-03-01

Practical applications of quantum information technologies exploiting the quantum nature of light require efficient and bright true single-photon sources which operate under ambient conditions. Currently, point defects in the crystal lattice of diamond known as color centers have taken the lead in the race for the most promising quantum system for practical non-classical light sources. This work is focused on a different quantum optoelectronic material, namely a color center in silicon carbide, and reveals the physics behind the process of single-photon emission from color centers in SiC under electrical pumping. We show that color centers in silicon carbide can be far superior to any other quantum light emitter under electrical control at room temperature. Using a comprehensive theoretical approach and rigorous numerical simulations, we demonstrate that at room temperature, the photon emission rate from a p-i-n silicon carbide single-photon emitting diode can exceed 5 Gcounts/s, which is higher than what can be achieved with electrically driven color centers in diamond or epitaxial quantum dots. These findings lay the foundation for the development of practical photonic quantum devices which can be produced in a well-developed CMOS compatible process flow.

Research on Quantum Authentication Methods for the Secure Access Control Among Three Elements of Cloud Computing

NASA Astrophysics Data System (ADS)

Dong, Yumin; Xiao, Shufen; Ma, Hongyang; Chen, Libo

2016-12-01

Cloud computing and big data have become the developing engine of current information technology (IT) as a result of the rapid development of IT. However, security protection has become increasingly important for cloud computing and big data, and has become a problem that must be solved to develop cloud computing. The theft of identity authentication information remains a serious threat to the security of cloud computing. In this process, attackers intrude into cloud computing services through identity authentication information, thereby threatening the security of data from multiple perspectives. Therefore, this study proposes a model for cloud computing protection and management based on quantum authentication, introduces the principle of quantum authentication, and deduces the quantum authentication process. In theory, quantum authentication technology can be applied in cloud computing for security protection. This technology cannot be cloned; thus, it is more secure and reliable than classical methods.

Digitized adiabatic quantum computing with a superconducting circuit.

PubMed

Barends, R; Shabani, A; Lamata, L; Kelly, J; Mezzacapo, A; Las Heras, U; Babbush, R; Fowler, A G; Campbell, B; Chen, Yu; Chen, Z; Chiaro, B; Dunsworth, A; Jeffrey, E; Lucero, E; Megrant, A; Mutus, J Y; Neeley, M; Neill, C; O'Malley, P J J; Quintana, C; Roushan, P; Sank, D; Vainsencher, A; Wenner, J; White, T C; Solano, E; Neven, H; Martinis, John M

2016-06-09

Quantum mechanics can help to solve complex problems in physics and chemistry, provided they can be programmed in a physical device. In adiabatic quantum computing, a system is slowly evolved from the ground state of a simple initial Hamiltonian to a final Hamiltonian that encodes a computational problem. The appeal of this approach lies in the combination of simplicity and generality; in principle, any problem can be encoded. In practice, applications are restricted by limited connectivity, available interactions and noise. A complementary approach is digital quantum computing, which enables the construction of arbitrary interactions and is compatible with error correction, but uses quantum circuit algorithms that are problem-specific. Here we combine the advantages of both approaches by implementing digitized adiabatic quantum computing in a superconducting system. We tomographically probe the system during the digitized evolution and explore the scaling of errors with system size. We then let the full system find the solution to random instances of the one-dimensional Ising problem as well as problem Hamiltonians that involve more complex interactions. This digital quantum simulation of the adiabatic algorithm consists of up to nine qubits and up to 1,000 quantum logic gates. The demonstration of digitized adiabatic quantum computing in the solid state opens a path to synthesizing long-range correlations and solving complex computational problems. When combined with fault-tolerance, our approach becomes a general-purpose algorithm that is scalable.

Quantum market games: implementing tactics via measurements

NASA Astrophysics Data System (ADS)

Pakula, I.; Piotrowski, E. W.; Sladkowski, J.

2006-02-01

A major development in applying quantum mechanical formalism to various fields has been made during the last few years. Quantum counterparts of Game Theory, Economy, as well as diverse approaches to Quantum Information Theory have been found and currently are being explored. Using connections between Quantum Game Theory and Quantum Computations, an application of the universality of a measurement based computation in Quantum Market Theory is presented.

Benchmarking gate-based quantum computers

NASA Astrophysics Data System (ADS)

Michielsen, Kristel; Nocon, Madita; Willsch, Dennis; Jin, Fengping; Lippert, Thomas; De Raedt, Hans

2017-11-01

With the advent of public access to small gate-based quantum processors, it becomes necessary to develop a benchmarking methodology such that independent researchers can validate the operation of these processors. We explore the usefulness of a number of simple quantum circuits as benchmarks for gate-based quantum computing devices and show that circuits performing identity operations are very simple, scalable and sensitive to gate errors and are therefore very well suited for this task. We illustrate the procedure by presenting benchmark results for the IBM Quantum Experience, a cloud-based platform for gate-based quantum computing.

Quantum Hash function and its application to privacy amplification in quantum key distribution, pseudo-random number generation and image encryption

NASA Astrophysics Data System (ADS)

Yang, Yu-Guang; Xu, Peng; Yang, Rui; Zhou, Yi-Hua; Shi, Wei-Min

2016-01-01

Quantum information and quantum computation have achieved a huge success during the last years. In this paper, we investigate the capability of quantum Hash function, which can be constructed by subtly modifying quantum walks, a famous quantum computation model. It is found that quantum Hash function can act as a hash function for the privacy amplification process of quantum key distribution systems with higher security. As a byproduct, quantum Hash function can also be used for pseudo-random number generation due to its inherent chaotic dynamics. Further we discuss the application of quantum Hash function to image encryption and propose a novel image encryption algorithm. Numerical simulations and performance comparisons show that quantum Hash function is eligible for privacy amplification in quantum key distribution, pseudo-random number generation and image encryption in terms of various hash tests and randomness tests. It extends the scope of application of quantum computation and quantum information.

Quantum Hash function and its application to privacy amplification in quantum key distribution, pseudo-random number generation and image encryption

PubMed Central

Yang, Yu-Guang; Xu, Peng; Yang, Rui; Zhou, Yi-Hua; Shi, Wei-Min

2016-01-01

Quantum information and quantum computation have achieved a huge success during the last years. In this paper, we investigate the capability of quantum Hash function, which can be constructed by subtly modifying quantum walks, a famous quantum computation model. It is found that quantum Hash function can act as a hash function for the privacy amplification process of quantum key distribution systems with higher security. As a byproduct, quantum Hash function can also be used for pseudo-random number generation due to its inherent chaotic dynamics. Further we discuss the application of quantum Hash function to image encryption and propose a novel image encryption algorithm. Numerical simulations and performance comparisons show that quantum Hash function is eligible for privacy amplification in quantum key distribution, pseudo-random number generation and image encryption in terms of various hash tests and randomness tests. It extends the scope of application of quantum computation and quantum information. PMID:26823196

Quantum Hash function and its application to privacy amplification in quantum key distribution, pseudo-random number generation and image encryption.

PubMed

Yang, Yu-Guang; Xu, Peng; Yang, Rui; Zhou, Yi-Hua; Shi, Wei-Min

2016-01-29

Quantum information and quantum computation have achieved a huge success during the last years. In this paper, we investigate the capability of quantum Hash function, which can be constructed by subtly modifying quantum walks, a famous quantum computation model. It is found that quantum Hash function can act as a hash function for the privacy amplification process of quantum key distribution systems with higher security. As a byproduct, quantum Hash function can also be used for pseudo-random number generation due to its inherent chaotic dynamics. Further we discuss the application of quantum Hash function to image encryption and propose a novel image encryption algorithm. Numerical simulations and performance comparisons show that quantum Hash function is eligible for privacy amplification in quantum key distribution, pseudo-random number generation and image encryption in terms of various hash tests and randomness tests. It extends the scope of application of quantum computation and quantum information.

Procedural Quantum Programming

NASA Astrophysics Data System (ADS)

Ömer, Bernhard

2002-09-01

While classical computing science has developed a variety of methods and programming languages around the concept of the universal computer, the typical description of quantum algorithms still uses a purely mathematical, non-constructive formalism which makes no difference between a hydrogen atom and a quantum computer. This paper investigates, how the concept of procedural programming languages, the most widely used classical formalism for describing and implementing algorithms, can be adopted to the field of quantum computing, and how non-classical features like the reversibility of unitary transformations, the non-observability of quantum states or the lack of copy and erase operations can be reflected semantically. It introduces the key concepts of procedural quantum programming (hybrid target architecture, operator hierarchy, quantum data types, memory management, etc.) and presents the experimental language QCL, which implements these principles.

The Quantum Human Computer (QHC) Hypothesis

ERIC Educational Resources Information Center

Salmani-Nodoushan, Mohammad Ali

2008-01-01

This article attempts to suggest the existence of a human computer called Quantum Human Computer (QHC) on the basis of an analogy between human beings and computers. To date, there are two types of computers: Binary and Quantum. The former operates on the basis of binary logic where an object is said to exist in either of the two states of 1 and…

Performance Models for Split-execution Computing Systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Humble, Travis S; McCaskey, Alex; Schrock, Jonathan

Split-execution computing leverages the capabilities of multiple computational models to solve problems, but splitting program execution across different computational models incurs costs associated with the translation between domains. We analyze the performance of a split-execution computing system developed from conventional and quantum processing units (QPUs) by using behavioral models that track resource usage. We focus on asymmetric processing models built using conventional CPUs and a family of special-purpose QPUs that employ quantum computing principles. Our performance models account for the translation of a classical optimization problem into the physical representation required by the quantum processor while also accounting for hardwaremore » limitations and conventional processor speed and memory. We conclude that the bottleneck in this split-execution computing system lies at the quantum-classical interface and that the primary time cost is independent of quantum processor behavior.« less

QM Automata: A New Class of Restricted Quantum Membrane Automata.

PubMed

Giannakis, Konstantinos; Singh, Alexandros; Kastampolidou, Kalliopi; Papalitsas, Christos; Andronikos, Theodore

2017-01-01

The term "Unconventional Computing" describes the use of non-standard methods and models in computing. It is a recently established field, with many interesting and promising results. In this work we combine notions from quantum computing with aspects of membrane computing to define what we call QM automata. Specifically, we introduce a variant of quantum membrane automata that operate in accordance with the principles of quantum computing. We explore the functionality and capabilities of the QM automata through indicative examples. Finally we suggest future directions for research on QM automata.

Secure Multiparty Quantum Computation for Summation and Multiplication.

PubMed

Shi, Run-hua; Mu, Yi; Zhong, Hong; Cui, Jie; Zhang, Shun

2016-01-21

As a fundamental primitive, Secure Multiparty Summation and Multiplication can be used to build complex secure protocols for other multiparty computations, specially, numerical computations. However, there is still lack of systematical and efficient quantum methods to compute Secure Multiparty Summation and Multiplication. In this paper, we present a novel and efficient quantum approach to securely compute the summation and multiplication of multiparty private inputs, respectively. Compared to classical solutions, our proposed approach can ensure the unconditional security and the perfect privacy protection based on the physical principle of quantum mechanics.

Secure Multiparty Quantum Computation for Summation and Multiplication

PubMed Central

Shi, Run-hua; Mu, Yi; Zhong, Hong; Cui, Jie; Zhang, Shun

2016-01-01

As a fundamental primitive, Secure Multiparty Summation and Multiplication can be used to build complex secure protocols for other multiparty computations, specially, numerical computations. However, there is still lack of systematical and efficient quantum methods to compute Secure Multiparty Summation and Multiplication. In this paper, we present a novel and efficient quantum approach to securely compute the summation and multiplication of multiparty private inputs, respectively. Compared to classical solutions, our proposed approach can ensure the unconditional security and the perfect privacy protection based on the physical principle of quantum mechanics. PMID:26792197

Experimental quantum computing to solve systems of linear equations.

PubMed

Cai, X-D; Weedbrook, C; Su, Z-E; Chen, M-C; Gu, Mile; Zhu, M-J; Li, Li; Liu, Nai-Le; Lu, Chao-Yang; Pan, Jian-Wei

2013-06-07

Solving linear systems of equations is ubiquitous in all areas of science and engineering. With rapidly growing data sets, such a task can be intractable for classical computers, as the best known classical algorithms require a time proportional to the number of variables N. A recently proposed quantum algorithm shows that quantum computers could solve linear systems in a time scale of order log(N), giving an exponential speedup over classical computers. Here we realize the simplest instance of this algorithm, solving 2×2 linear equations for various input vectors on a quantum computer. We use four quantum bits and four controlled logic gates to implement every subroutine required, demonstrating the working principle of this algorithm.

Multi-party Semi-quantum Key Agreement with Delegating Quantum Computation

NASA Astrophysics Data System (ADS)

Liu, Wen-Jie; Chen, Zhen-Yu; Ji, Sai; Wang, Hai-Bin; Zhang, Jun

2017-10-01

A multi-party semi-quantum key agreement (SQKA) protocol based on delegating quantum computation (DQC) model is proposed by taking Bell states as quantum resources. In the proposed protocol, the participants only need the ability of accessing quantum channel and preparing single photons {|0〉, |1〉, |+〉, |-〉}, while the complicated quantum operations, such as the unitary operations and Bell measurement, will be delegated to the remote quantum center. Compared with previous quantum key agreement protocols, this client-server model is more feasible in the early days of the emergence of quantum computers. In order to prevent the attacks from outside eavesdroppers, inner participants and quantum center, two single photon sequences are randomly inserted into Bell states: the first sequence is used to perform the quantum channel detection, while the second is applied to disorder the positions of message qubits, which guarantees the security of the protocol.

FAST TRACK COMMUNICATION: Quantum anomalies and linear response theory

NASA Astrophysics Data System (ADS)

Sela, Itamar; Aisenberg, James; Kottos, Tsampikos; Cohen, Doron

2010-08-01

The analysis of diffusive energy spreading in quantized chaotic driven systems leads to a universal paradigm for the emergence of a quantum anomaly. In the classical approximation, a driven chaotic system exhibits stochastic-like diffusion in energy space with a coefficient D that is proportional to the intensity ɛ2 of the driving. In the corresponding quantized problem the coherent transitions are characterized by a generalized Wigner time tɛ, and a self-generated (intrinsic) dephasing process leads to nonlinear dependence of D on ɛ2.

Probing the energy reactance with adiabatically driven quantum dots

NASA Astrophysics Data System (ADS)

Ludovico, María Florencia; Arrachea, Liliana; Moskalets, Michael; Sánchez, David

2018-02-01

The tunneling Hamiltonian describes a particle transfer from one region to another. Although there is no particle storage in the tunneling region itself, it has an associated amount of energy. The corresponding energy flux was named reactance since, such as an electrical reactance, it manifests itself in time-dependent transport only. We show here that the existence of the energy reactance leads to the universal response of a mesoscopic thermometer, a floating contact coupled to an adiabatically driven quantum dot.

Adiabatic Quantum Computation: Coherent Control Back Action.

PubMed

Goswami, Debabrata

2006-11-22

Though attractive from scalability aspects, optical approaches to quantum computing are highly prone to decoherence and rapid population loss due to nonradiative processes such as vibrational redistribution. We show that such effects can be reduced by adiabatic coherent control, in which quantum interference between multiple excitation pathways is used to cancel coupling to the unwanted, non-radiative channels. We focus on experimentally demonstrated adiabatic controlled population transfer experiments wherein the details on the coherence aspects are yet to be explored theoretically but are important for quantum computation. Such quantum computing schemes also form a back-action connection to coherent control developments.

Enhanced fault-tolerant quantum computing in d-level systems.

PubMed

Campbell, Earl T

2014-12-05

Error-correcting codes protect quantum information and form the basis of fault-tolerant quantum computing. Leading proposals for fault-tolerant quantum computation require codes with an exceedingly rare property, a transversal non-Clifford gate. Codes with the desired property are presented for d-level qudit systems with prime d. The codes use n=d-1 qudits and can detect up to ∼d/3 errors. We quantify the performance of these codes for one approach to quantum computation known as magic-state distillation. Unlike prior work, we find performance is always enhanced by increasing d.

Arbitrated Quantum Signature with Hamiltonian Algorithm Based on Blind Quantum Computation

NASA Astrophysics Data System (ADS)

Shi, Ronghua; Ding, Wanting; Shi, Jinjing

2018-03-01

A novel arbitrated quantum signature (AQS) scheme is proposed motivated by the Hamiltonian algorithm (HA) and blind quantum computation (BQC). The generation and verification of signature algorithm is designed based on HA, which enables the scheme to rely less on computational complexity. It is unnecessary to recover original messages when verifying signatures since the blind quantum computation is applied, which can improve the simplicity and operability of our scheme. It is proved that the scheme can be deployed securely, and the extended AQS has some extensive applications in E-payment system, E-government, E-business, etc.

Arbitrated Quantum Signature with Hamiltonian Algorithm Based on Blind Quantum Computation

NASA Astrophysics Data System (ADS)

Shi, Ronghua; Ding, Wanting; Shi, Jinjing

2018-07-01

A novel arbitrated quantum signature (AQS) scheme is proposed motivated by the Hamiltonian algorithm (HA) and blind quantum computation (BQC). The generation and verification of signature algorithm is designed based on HA, which enables the scheme to rely less on computational complexity. It is unnecessary to recover original messages when verifying signatures since the blind quantum computation is applied, which can improve the simplicity and operability of our scheme. It is proved that the scheme can be deployed securely, and the extended AQS has some extensive applications in E-payment system, E-government, E-business, etc.

An Integrated Development Environment for Adiabatic Quantum Programming

DOE Office of Scientific and Technical Information (OSTI.GOV)

Humble, Travis S; McCaskey, Alex; Bennink, Ryan S

2014-01-01

Adiabatic quantum computing is a promising route to the computational power afforded by quantum information processing. The recent availability of adiabatic hardware raises the question of how well quantum programs perform. Benchmarking behavior is challenging since the multiple steps to synthesize an adiabatic quantum program are highly tunable. We present an adiabatic quantum programming environment called JADE that provides control over all the steps taken during program development. JADE captures the workflow needed to rigorously benchmark performance while also allowing a variety of problem types, programming techniques, and processor configurations. We have also integrated JADE with a quantum simulation enginemore » that enables program profiling using numerical calculation. The computational engine supports plug-ins for simulation methodologies tailored to various metrics and computing resources. We present the design, integration, and deployment of JADE and discuss its use for benchmarking adiabatic quantum programs.« less

Defects in Quantum Computers

DOE PAGES

Gardas, Bartłomiej; Dziarmaga, Jacek; Zurek, Wojciech H.; ...

2018-03-14

The shift of interest from general purpose quantum computers to adiabatic quantum computing or quantum annealing calls for a broadly applicable and easy to implement test to assess how quantum or adiabatic is a specific hardware. Here we propose such a test based on an exactly solvable many body system–the quantum Ising chain in transverse field–and implement it on the D-Wave machine. An ideal adiabatic quench of the quantum Ising chain should lead to an ordered broken symmetry ground state with all spins aligned in the same direction. An actual quench can be imperfect due to decoherence, noise, flaws inmore » the implemented Hamiltonian, or simply too fast to be adiabatic. Imperfections result in topological defects: Spins change orientation, kinks punctuating ordered sections of the chain. Therefore, the number of such defects quantifies the extent by which the quantum computer misses the ground state, and is imperfect.« less

Exploiting Quantum Resonance to Solve Combinatorial Problems

NASA Technical Reports Server (NTRS)

Zak, Michail; Fijany, Amir

2006-01-01

Quantum resonance would be exploited in a proposed quantum-computing approach to the solution of combinatorial optimization problems. In quantum computing in general, one takes advantage of the fact that an algorithm cannot be decoupled from the physical effects available to implement it. Prior approaches to quantum computing have involved exploitation of only a subset of known quantum physical effects, notably including parallelism and entanglement, but not including resonance. In the proposed approach, one would utilize the combinatorial properties of tensor-product decomposability of unitary evolution of many-particle quantum systems for physically simulating solutions to NP-complete problems (a class of problems that are intractable with respect to classical methods of computation). In this approach, reinforcement and selection of a desired solution would be executed by means of quantum resonance. Classes of NP-complete problems that are important in practice and could be solved by the proposed approach include planning, scheduling, search, and optimal design.

Defects in Quantum Computers

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gardas, Bartłomiej; Dziarmaga, Jacek; Zurek, Wojciech H.

The shift of interest from general purpose quantum computers to adiabatic quantum computing or quantum annealing calls for a broadly applicable and easy to implement test to assess how quantum or adiabatic is a specific hardware. Here we propose such a test based on an exactly solvable many body system–the quantum Ising chain in transverse field–and implement it on the D-Wave machine. An ideal adiabatic quench of the quantum Ising chain should lead to an ordered broken symmetry ground state with all spins aligned in the same direction. An actual quench can be imperfect due to decoherence, noise, flaws inmore » the implemented Hamiltonian, or simply too fast to be adiabatic. Imperfections result in topological defects: Spins change orientation, kinks punctuating ordered sections of the chain. Therefore, the number of such defects quantifies the extent by which the quantum computer misses the ground state, and is imperfect.« less

Quantum and classical dynamics in adiabatic computation

NASA Astrophysics Data System (ADS)

Crowley, P. J. D.; Äńurić, T.; Vinci, W.; Warburton, P. A.; Green, A. G.

2014-10-01

Adiabatic transport provides a powerful way to manipulate quantum states. By preparing a system in a readily initialized state and then slowly changing its Hamiltonian, one may achieve quantum states that would otherwise be inaccessible. Moreover, a judicious choice of final Hamiltonian whose ground state encodes the solution to a problem allows adiabatic transport to be used for universal quantum computation. However, the dephasing effects of the environment limit the quantum correlations that an open system can support and degrade the power of such adiabatic computation. We quantify this effect by allowing the system to evolve over a restricted set of quantum states, providing a link between physically inspired classical optimization algorithms and quantum adiabatic optimization. This perspective allows us to develop benchmarks to bound the quantum correlations harnessed by an adiabatic computation. We apply these to the D-Wave Vesuvius machine with revealing—though inconclusive—results.

Quantum Computing since Democritus

NASA Astrophysics Data System (ADS)

Aaronson, Scott

2013-03-01

1. Atoms and the void; 2. Sets; 3. Gödel, Turing, and friends; 4. Minds and machines; 5. Paleocomplexity; 6. P, NP, and friends; 7. Randomness; 8. Crypto; 9. Quantum; 10. Quantum computing; 11. Penrose; 12. Decoherence and hidden variables; 13. Proofs; 14. How big are quantum states?; 15. Skepticism of quantum computing; 16. Learning; 17. Interactive proofs and more; 18. Fun with the Anthropic Principle; 19. Free will; 20. Time travel; 21. Cosmology and complexity; 22. Ask me anything.

Quantum computing with incoherent resources and quantum jumps.

PubMed

Santos, M F; Cunha, M Terra; Chaves, R; Carvalho, A R R

2012-04-27

Spontaneous emission and the inelastic scattering of photons are two natural processes usually associated with decoherence and the reduction in the capacity to process quantum information. Here we show that, when suitably detected, these photons are sufficient to build all the fundamental blocks needed to perform quantum computation in the emitting qubits while protecting them from deleterious dissipative effects. We exemplify this by showing how to efficiently prepare graph states for the implementation of measurement-based quantum computation.

Optimal subsystem approach to multi-qubit quantum state discrimination and experimental investigation

NASA Astrophysics Data System (ADS)

Xue, ShiChuan; Wu, JunJie; Xu, Ping; Yang, XueJun

2018-02-01

Quantum computing is a significant computing capability which is superior to classical computing because of its superposition feature. Distinguishing several quantum states from quantum algorithm outputs is often a vital computational task. In most cases, the quantum states tend to be non-orthogonal due to superposition; quantum mechanics has proved that perfect outcomes could not be achieved by measurements, forcing repetitive measurement. Hence, it is important to determine the optimum measuring method which requires fewer repetitions and a lower error rate. However, extending current measurement approaches mainly aiming at quantum cryptography to multi-qubit situations for quantum computing confronts challenges, such as conducting global operations which has considerable costs in the experimental realm. Therefore, in this study, we have proposed an optimum subsystem method to avoid these difficulties. We have provided an analysis of the comparison between the reduced subsystem method and the global minimum error method for two-qubit problems; the conclusions have been verified experimentally. The results showed that the subsystem method could effectively discriminate non-orthogonal two-qubit states, such as separable states, entangled pure states, and mixed states; the cost of the experimental process had been significantly reduced, in most circumstances, with acceptable error rate. We believe the optimal subsystem method is the most valuable and promising approach for multi-qubit quantum computing applications.

Introduction to Quantum Intelligence

NASA Technical Reports Server (NTRS)

Zak, Michail

1996-01-01

An impact of ideas associated with the concept of a hypothetical quantum computer upon classical computing is analyzed. Two fundamental properties of quantum computing: direct simulations of probabilities, and influence between different branches of probabilistic scenarios, as well as their classical versions, are discussed.

Duality quantum algorithm efficiently simulates open quantum systems

PubMed Central

Wei, Shi-Jie; Ruan, Dong; Long, Gui-Lu

2016-01-01

Because of inevitable coupling with the environment, nearly all practical quantum systems are open system, where the evolution is not necessarily unitary. In this paper, we propose a duality quantum algorithm for simulating Hamiltonian evolution of an open quantum system. In contrast to unitary evolution in a usual quantum computer, the evolution operator in a duality quantum computer is a linear combination of unitary operators. In this duality quantum algorithm, the time evolution of the open quantum system is realized by using Kraus operators which is naturally implemented in duality quantum computer. This duality quantum algorithm has two distinct advantages compared to existing quantum simulation algorithms with unitary evolution operations. Firstly, the query complexity of the algorithm is O(d3) in contrast to O(d4) in existing unitary simulation algorithm, where d is the dimension of the open quantum system. Secondly, By using a truncated Taylor series of the evolution operators, this duality quantum algorithm provides an exponential improvement in precision compared with previous unitary simulation algorithm. PMID:27464855

ProjectQ Software Framework

NASA Astrophysics Data System (ADS)

Steiger, Damian S.; Haener, Thomas; Troyer, Matthias

Quantum computers promise to transform our notions of computation by offering a completely new paradigm. A high level quantum programming language and optimizing compilers are essential components to achieve scalable quantum computation. In order to address this, we introduce the ProjectQ software framework - an open source effort to support both theorists and experimentalists by providing intuitive tools to implement and run quantum algorithms. Here, we present our ProjectQ quantum compiler, which compiles a quantum algorithm from our high-level Python-embedded language down to low-level quantum gates available on the target system. We demonstrate how this compiler can be used to control actual hardware and to run high-performance simulations.

Continuous-variable quantum computing in optical time-frequency modes using quantum memories.

PubMed

Humphreys, Peter C; Kolthammer, W Steven; Nunn, Joshua; Barbieri, Marco; Datta, Animesh; Walmsley, Ian A

2014-09-26

We develop a scheme for time-frequency encoded continuous-variable cluster-state quantum computing using quantum memories. In particular, we propose a method to produce, manipulate, and measure two-dimensional cluster states in a single spatial mode by exploiting the intrinsic time-frequency selectivity of Raman quantum memories. Time-frequency encoding enables the scheme to be extremely compact, requiring a number of memories that are a linear function of only the number of different frequencies in which the computational state is encoded, independent of its temporal duration. We therefore show that quantum memories can be a powerful component for scalable photonic quantum information processing architectures.

Superadiabatic holonomic quantum computation in cavity QED

NASA Astrophysics Data System (ADS)

Liu, Bao-Jie; Huang, Zhen-Hua; Xue, Zheng-Yuan; Zhang, Xin-Ding

2017-06-01

Adiabatic quantum control is a powerful tool for quantum engineering and a key component in some quantum computation models, where accurate control over the timing of the involved pulses is not needed. However, the adiabatic condition requires that the process be very slow and thus limits its application in quantum computation, where quantum gates are preferred to be fast due to the limited coherent times of the quantum systems. Here, we propose a feasible scheme to implement universal holonomic quantum computation based on non-Abelian geometric phases with superadiabatic quantum control, where the adiabatic manipulation is sped up while retaining its robustness against errors in the timing control. Consolidating the advantages of both strategies, our proposal is thus both robust and fast. The cavity QED system is adopted as a typical example to illustrate the merits where the proposed scheme can be realized in a tripod configuration by appropriately controlling the pulse shapes and their relative strength. To demonstrate the distinct performance of our proposal, we also compare our scheme with the conventional adiabatic strategy.

Towards topological quantum computer

NASA Astrophysics Data System (ADS)

Melnikov, D.; Mironov, A.; Mironov, S.; Morozov, A.; Morozov, An.

2018-01-01

Quantum R-matrices, the entangling deformations of non-entangling (classical) permutations, provide a distinguished basis in the space of unitary evolutions and, consequently, a natural choice for a minimal set of basic operations (universal gates) for quantum computation. Yet they play a special role in group theory, integrable systems and modern theory of non-perturbative calculations in quantum field and string theory. Despite recent developments in those fields the idea of topological quantum computing and use of R-matrices, in particular, practically reduce to reinterpretation of standard sets of quantum gates, and subsequently algorithms, in terms of available topological ones. In this paper we summarize a modern view on quantum R-matrix calculus and propose to look at the R-matrices acting in the space of irreducible representations, which are unitary for the real-valued couplings in Chern-Simons theory, as the fundamental set of universal gates for topological quantum computer. Such an approach calls for a more thorough investigation of the relation between topological invariants of knots and quantum algorithms.

Conditional generation of an arbitrary superposition of coherent states

DOE Office of Scientific and Technical Information (OSTI.GOV)

Takeoka, Masahiro; Sasaki, Masahide

2007-06-15

We present a scheme to conditionally generate an arbitrary superposition of a pair of coherent states from a squeezed vacuum by means of the modified photon subtraction where a coherent state ancilla and two on/off type detectors are used. We show that, even including realistic imperfections of the detectors, our scheme can generate a target state with a high fidelity. The amplitude of the generated states can be amplified by conditional homodyne detections.

Quantum robots plus environments.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Benioff, P.

1998-07-23

A quantum robot is a mobile quantum system, including an on board quantum computer and needed ancillary systems, that interacts with an environment of quantum systems. Quantum robots carry out tasks whose goals include making specified changes in the state of the environment or carrying out measurements on the environment. The environments considered so far, oracles, data bases, and quantum registers, are seen to be special cases of environments considered here. It is also seen that a quantum robot should include a quantum computer and cannot be simply a multistate head. A model of quantum robots and their interactions ismore » discussed in which each task, as a sequence of alternating computation and action phases,is described by a unitary single time step operator T {approx} T{sub a} + T{sub c} (discrete space and time are assumed). The overall system dynamics is described as a sum over paths of completed computation (T{sub c}) and action (T{sub a}) phases. A simple example of a task, measuring the distance between the quantum robot and a particle on a 1D lattice with quantum phase path dispersion present, is analyzed. A decision diagram for the task is presented and analyzed.« less

Quantum-Classical Correspondence Principle for Work Distributions

NASA Astrophysics Data System (ADS)

Jarzynski, Christopher; Quan, H. T.; Rahav, Saar

2015-07-01

For closed quantum systems driven away from equilibrium, work is often defined in terms of projective measurements of initial and final energies. This definition leads to statistical distributions of work that satisfy nonequilibrium work and fluctuation relations. While this two-point measurement definition of quantum work can be justified heuristically by appeal to the first law of thermodynamics, its relationship to the classical definition of work has not been carefully examined. In this paper, we employ semiclassical methods, combined with numerical simulations of a driven quartic oscillator, to study the correspondence between classical and quantal definitions of work in systems with 1 degree of freedom. We find that a semiclassical work distribution, built from classical trajectories that connect the initial and final energies, provides an excellent approximation to the quantum work distribution when the trajectories are assigned suitable phases and are allowed to interfere. Neglecting the interferences between trajectories reduces the distribution to that of the corresponding classical process. Hence, in the semiclassical limit, the quantum work distribution converges to the classical distribution, decorated by a quantum interference pattern. We also derive the form of the quantum work distribution at the boundary between classically allowed and forbidden regions, where this distribution tunnels into the forbidden region. Our results clarify how the correspondence principle applies in the context of quantum and classical work distributions and contribute to the understanding of work and nonequilibrium work relations in the quantum regime.

Control aspects of quantum computing using pure and mixed states.

PubMed

Schulte-Herbrüggen, Thomas; Marx, Raimund; Fahmy, Amr; Kauffman, Louis; Lomonaco, Samuel; Khaneja, Navin; Glaser, Steffen J

2012-10-13

Steering quantum dynamics such that the target states solve classically hard problems is paramount to quantum simulation and computation. And beyond, quantum control is also essential to pave the way to quantum technologies. Here, important control techniques are reviewed and presented in a unified frame covering quantum computational gate synthesis and spectroscopic state transfer alike. We emphasize that it does not matter whether the quantum states of interest are pure or not. While pure states underly the design of quantum circuits, ensemble mixtures of quantum states can be exploited in a more recent class of algorithms: it is illustrated by characterizing the Jones polynomial in order to distinguish between different (classes of) knots. Further applications include Josephson elements, cavity grids, ion traps and nitrogen vacancy centres in scenarios of closed as well as open quantum systems.

Control aspects of quantum computing using pure and mixed states

PubMed Central

Schulte-Herbrüggen, Thomas; Marx, Raimund; Fahmy, Amr; Kauffman, Louis; Lomonaco, Samuel; Khaneja, Navin; Glaser, Steffen J.

2012-01-01

Steering quantum dynamics such that the target states solve classically hard problems is paramount to quantum simulation and computation. And beyond, quantum control is also essential to pave the way to quantum technologies. Here, important control techniques are reviewed and presented in a unified frame covering quantum computational gate synthesis and spectroscopic state transfer alike. We emphasize that it does not matter whether the quantum states of interest are pure or not. While pure states underly the design of quantum circuits, ensemble mixtures of quantum states can be exploited in a more recent class of algorithms: it is illustrated by characterizing the Jones polynomial in order to distinguish between different (classes of) knots. Further applications include Josephson elements, cavity grids, ion traps and nitrogen vacancy centres in scenarios of closed as well as open quantum systems. PMID:22946034

Quantum computer games: quantum minesweeper

NASA Astrophysics Data System (ADS)

Gordon, Michal; Gordon, Goren

2010-07-01

The computer game of quantum minesweeper is introduced as a quantum extension of the well-known classical minesweeper. Its main objective is to teach the unique concepts of quantum mechanics in a fun way. Quantum minesweeper demonstrates the effects of superposition, entanglement and their non-local characteristics. While in the classical minesweeper the goal of the game is to discover all the mines laid out on a board without triggering them, in the quantum version there are several classical boards in superposition. The goal is to know the exact quantum state, i.e. the precise layout of all the mines in all the superposed classical boards. The player can perform three types of measurement: a classical measurement that probabilistically collapses the superposition; a quantum interaction-free measurement that can detect a mine without triggering it; and an entanglement measurement that provides non-local information. The application of the concepts taught by quantum minesweeper to one-way quantum computing are also presented.

Counterfactual quantum computation through quantum interrogation

NASA Astrophysics Data System (ADS)

Hosten, Onur; Rakher, Matthew T.; Barreiro, Julio T.; Peters, Nicholas A.; Kwiat, Paul G.

2006-02-01

The logic underlying the coherent nature of quantum information processing often deviates from intuitive reasoning, leading to surprising effects. Counterfactual computation constitutes a striking example: the potential outcome of a quantum computation can be inferred, even if the computer is not run. Relying on similar arguments to interaction-free measurements (or quantum interrogation), counterfactual computation is accomplished by putting the computer in a superposition of `running' and `not running' states, and then interfering the two histories. Conditional on the as-yet-unknown outcome of the computation, it is sometimes possible to counterfactually infer information about the solution. Here we demonstrate counterfactual computation, implementing Grover's search algorithm with an all-optical approach. It was believed that the overall probability of such counterfactual inference is intrinsically limited, so that it could not perform better on average than random guesses. However, using a novel `chained' version of the quantum Zeno effect, we show how to boost the counterfactual inference probability to unity, thereby beating the random guessing limit. Our methods are general and apply to any physical system, as illustrated by a discussion of trapped-ion systems. Finally, we briefly show that, in certain circumstances, counterfactual computation can eliminate errors induced by decoherence.

Universal Blind Quantum Computation

NASA Astrophysics Data System (ADS)

Fitzsimons, Joseph; Kashefi, Elham

2012-02-01

Blind Quantum Computing (BQC) allows a client to have a server carry out a quantum computation for them such that the client's inputs, outputs and computation remain private. Recently we proposed a universal unconditionally secure BQC scheme, based on the conceptual framework of the measurement-based quantum computing model, where the client only needs to be able to prepare single qubits in separable states randomly chosen from a finite set and send them to the server, who has the balance of the required quantum computational resources. Here we present a refinement of the scheme which vastly expands the class of quantum circuits which can be directly implemented as a blind computation, by introducing a new class of resource states which we term dotted-complete graph states and expanding the set of single qubit states the client is required to prepare. These two modifications significantly simplify the overall protocol and remove the previously present restriction that only nearest-neighbor circuits could be implemented as blind computations directly. As an added benefit, the refined protocol admits a substantially more intuitive and simplified verification mechanism, allowing the correctness of a blind computation to be verified with arbitrarily small probability of error.

Work production of quantum rotor engines

NASA Astrophysics Data System (ADS)

Seah, Stella; Nimmrichter, Stefan; Scarani, Valerio

2018-04-01

We study the mechanical performance of quantum rotor heat engines in terms of common notions of work using two prototypical models: a mill driven by the heat flow from a hot to a cold mode, and a piston driven by the alternate heating and cooling of a single working mode. We evaluate the extractable work in terms of ergotropy, the kinetic energy associated to net directed rotation, as well as the intrinsic work based on the exerted torque under autonomous operation, and we compare them to the energy output for the case of an external dissipative load and for externally driven engine cycles. Our results connect work definitions from both physical and information-theoretical perspectives. In particular, we find that apart from signatures of angular momentum quantization, the ergotropy is consistent with the intuitive notion of work in the form of net directed motion. It also agrees with the energy output to an external load or agent under optimal conditions. This sets forth a consistent thermodynamical description of rotating quantum motors, flywheels, and clocks.

Toward a superconducting quantum computer

PubMed Central

Tsai, Jaw-Shen

2010-01-01

Intensive research on the construction of superconducting quantum computers has produced numerous important achievements. The quantum bit (qubit), based on the Josephson junction, is at the heart of this research. This macroscopic system has the ability to control quantum coherence. This article reviews the current state of quantum computing as well as its history, and discusses its future. Although progress has been rapid, the field remains beset with unsolved issues, and there are still many new research opportunities open to physicists and engineers. PMID:20431256

Quantum gases. Observation of many-body dynamics in long-range tunneling after a quantum quench.

PubMed

Meinert, Florian; Mark, Manfred J; Kirilov, Emil; Lauber, Katharina; Weinmann, Philipp; Gröbner, Michael; Daley, Andrew J; Nägerl, Hanns-Christoph

2014-06-13

Quantum tunneling is at the heart of many low-temperature phenomena. In strongly correlated lattice systems, tunneling is responsible for inducing effective interactions, and long-range tunneling substantially alters many-body properties in and out of equilibrium. We observe resonantly enhanced long-range quantum tunneling in one-dimensional Mott-insulating Hubbard chains that are suddenly quenched into a tilted configuration. Higher-order tunneling processes over up to five lattice sites are observed as resonances in the number of doubly occupied sites when the tilt per site is tuned to integer fractions of the Mott gap. This forms a basis for a controlled study of many-body dynamics driven by higher-order tunneling and demonstrates that when some degrees of freedom are frozen out, phenomena that are driven by small-amplitude tunneling terms can still be observed. Copyright © 2014, American Association for the Advancement of Science.

A review on quantum search algorithms

NASA Astrophysics Data System (ADS)

Giri, Pulak Ranjan; Korepin, Vladimir E.

2017-12-01

The use of superposition of states in quantum computation, known as quantum parallelism, has significant advantage in terms of speed over the classical computation. It is evident from the early invented quantum algorithms such as Deutsch's algorithm, Deutsch-Jozsa algorithm and its variation as Bernstein-Vazirani algorithm, Simon algorithm, Shor's algorithms, etc. Quantum parallelism also significantly speeds up the database search algorithm, which is important in computer science because it comes as a subroutine in many important algorithms. Quantum database search of Grover achieves the task of finding the target element in an unsorted database in a time quadratically faster than the classical computer. We review Grover's quantum search algorithms for a singe and multiple target elements in a database. The partial search algorithm of Grover and Radhakrishnan and its optimization by Korepin called GRK algorithm are also discussed.

Ramsey numbers and adiabatic quantum computing.

PubMed

Gaitan, Frank; Clark, Lane

2012-01-06

The graph-theoretic Ramsey numbers are notoriously difficult to calculate. In fact, for the two-color Ramsey numbers R(m,n) with m, n≥3, only nine are currently known. We present a quantum algorithm for the computation of the Ramsey numbers R(m,n). We show how the computation of R(m,n) can be mapped to a combinatorial optimization problem whose solution can be found using adiabatic quantum evolution. We numerically simulate this adiabatic quantum algorithm and show that it correctly determines the Ramsey numbers R(3,3) and R(2,s) for 5≤s≤7. We then discuss the algorithm's experimental implementation, and close by showing that Ramsey number computation belongs to the quantum complexity class quantum Merlin Arthur.

Large-scale frequency- and time-domain quantum entanglement over the optical frequency comb (Conference Presentation)

NASA Astrophysics Data System (ADS)

Pfister, Olivier

2017-05-01

When it comes to practical quantum computing, the two main challenges are circumventing decoherence (devastating quantum errors due to interactions with the environmental bath) and achieving scalability (as many qubits as needed for a real-life, game-changing computation). We show that using, in lieu of qubits, the "qumodes" represented by the resonant fields of the quantum optical frequency comb of an optical parametric oscillator allows one to create bona fide, large scale quantum computing processors, pre-entangled in a cluster state. We detail our recent demonstration of 60-qumode entanglement (out of an estimated 3000) and present an extension to combining this frequency-tagged with time-tagged entanglement, in order to generate an arbitrarily large, universal quantum computing processor.

Observation of ground-state quantum beats in atomic spontaneous emission.

PubMed

Norris, D G; Orozco, L A; Barberis-Blostein, P; Carmichael, H J

2010-09-17

We report ground-state quantum beats in spontaneous emission from a continuously driven atomic ensemble. Beats are visible only in an intensity autocorrelation and evidence spontaneously generated coherence in radiative decay. Our measurement realizes a quantum eraser where a first photon detection prepares a superposition and a second erases the "which path" information in the intermediate state.

Stabilizers as a design tool for new forms of the Lechner-Hauke-Zoller annealer

PubMed Central

Rocchetto, Andrea; Benjamin, Simon C.; Li, Ying

2016-01-01

In a recent paper, Lechner, Hauke, and Zoller (LHZ) described a means to translate a Hamiltonian of N spin-1/2 particles with “all-to-all” interactions into a larger physical lattice with only on-site energies and local parity constraints. LHZ used this mapping to propose a novel form of quantum annealing. We provide a stabilizer-based formulation within which we can describe both this prior approach and a wide variety of variants. Examples include a triangular array supporting all-to-all connectivity as well as arrangements requiring only 2N or N log N spins but providing interesting bespoke connectivities. Further examples show that arbitrarily high-order logical terms can be efficiently realized, even in a strictly two-dimensional layout. Our stabilizers can correspond to either even-parity constraints, as in the LHZ proposal, or odd-parity constraints. Considering the latter option applied to the original LHZ layout, we note that it may simplify the physical realization because the required ancillas are only spin-1/2 systems (that is, qubits rather than qutrits); moreover, the interactions are very simple. We make a preliminary assessment of the impact of these design choices by simulating small (few-qubit) systems; we find some indications that the new variant may maintain a larger minimum energy gap during the annealing process. PMID:27819050

Deutsch, Toffoli, and cnot Gates via Rydberg Blockade of Neutral Atoms

NASA Astrophysics Data System (ADS)

Shi, Xiao-Feng

2018-05-01

Universal quantum gates and quantum error correction (QEC) lie at the heart of quantum-information science. Large-scale quantum computing depends on a universal set of quantum gates, in which some gates may be easily carried out, while others are restricted to certain physical systems. There is a unique three-qubit quantum gate called the Deutsch gate [D (θ )], from which a circuit can be constructed so that any feasible quantum computing is attainable. We design an easily realizable D (θ ) by using the Rydberg blockade of neutral atoms, where θ can be tuned to any value in [0 ,π ] by adjusting the strengths of external control fields. Using similar protocols, we further show that both the Toffoli and controlled-not gates can be achieved with only three laser pulses. The Toffoli gate, being universal for classical reversible computing, is also useful for QEC, which plays an important role in quantum communication and fault-tolerant quantum computation. The possibility and speed of realizing these gates shed light on the study of quantum information with neutral atoms.

Black hole based quantum computing in labs and in the sky

NASA Astrophysics Data System (ADS)

Dvali, Gia; Panchenko, Mischa

2016-08-01

Analyzing some well established facts, we give a model-independent parameterization of black hole quantum computing in terms of a set of macro and micro quantities and their relations. These include the relations between the extraordinarily-small energy gap of black hole qubits and important time-scales of information-processing, such as, scrambling time and Page's time. We then show, confirming and extending previous results, that other systems of nature with identical quantum informatics features are attractive Bose-Einstein systems at the critical point of quantum phase transition. Here we establish a complete isomorphy between the quantum computational properties of these two systems. In particular, we show that the quantum hair of a critical condensate is strikingly similar to the quantum hair of a black hole. Irrespectively whether one takes the similarity between the two systems as a remarkable coincidence or as a sign of a deeper underlying connection, the following is evident. Black holes are not unique in their way of quantum information processing and we can manufacture black hole based quantum computers in labs by taking advantage of quantum criticality.

Nonlinear optics quantum computing with circuit QED.

PubMed

Adhikari, Prabin; Hafezi, Mohammad; Taylor, J M

2013-02-08

One approach to quantum information processing is to use photons as quantum bits and rely on linear optical elements for most operations. However, some optical nonlinearity is necessary to enable universal quantum computing. Here, we suggest a circuit-QED approach to nonlinear optics quantum computing in the microwave regime, including a deterministic two-photon phase gate. Our specific example uses a hybrid quantum system comprising a LC resonator coupled to a superconducting flux qubit to implement a nonlinear coupling. Compared to the self-Kerr nonlinearity, we find that our approach has improved tolerance to noise in the qubit while maintaining fast operation.

Complex systems and health behavior change: insights from cognitive science.

PubMed

Orr, Mark G; Plaut, David C

2014-05-01

To provide proof-of-concept that quantum health behavior can be instantiated as a computational model that is informed by cognitive science, the Theory of Reasoned Action, and quantum health behavior theory. We conducted a synthetic review of the intersection of quantum health behavior change and cognitive science. We conducted simulations, using a computational model of quantum health behavior (a constraint satisfaction artificial neural network) and tested whether the model exhibited quantum-like behavior. The model exhibited clear signs of quantum-like behavior. Quantum health behavior can be conceptualized as constraint satisfaction: a mitigation between current behavioral state and the social contexts in which it operates. We outlined implications for moving forward with computational models of both quantum health behavior and health behavior in general.