Quantum annealing with manufactured spins

Practical Entanglement Estimation for Spin-System Quantum Simulators

We present practical methods to measure entanglement for quantum simulators that can be realized with trapped ions, cold atoms, and superconducting qubits. Focusing on long- and short-range Ising-type Hamiltonians, we introduce schemes that are applicable under realistic experimental conditions including mixedness due to, e.g., noise or temperature. In particular, we identify a single observable whose expectation value serves as a lower bound to entanglement and that may be obtained by a simple quantum circuit. As such circuits are not (yet) available for every platform, we investigate the performance of routinely measured observables as quantitative entanglement witnesses. Possible applications include experimental studies of entanglement scaling in critical systems and the reliable benchmarking of quantum simulators.

Maximum-Entropy Inference with a Programmable Annealer

Optimisation problems typically involve finding the ground state (i.e. the minimum energy configuration) of a cost function with respect to many variables. If the variables are corrupted by noise then this maximises the likelihood that the solution is correct. The maximum entropy solution on the other hand takes the form of a Boltzmann distribution over the ground and excited states of the cost function to correct for noise. Here we use a programmable annealer for the information decoding problem which we simulate as a random Ising model in a field. We show experimentally that finite temperature maximum entropy decoding can give slightly better bit-error-rates than the maximum likelihood approach, confirming that useful information can be extracted from the excited states of the annealer. Furthermore we introduce a bit-by-bit analytical method which is agnostic to the specific application and use it to show that the annealer samples from a highly Boltzmann-like distribution. Machines of this kind are therefore candidates for use in a variety of machine learning applications which exploit maximum entropy inference, including language processing and image recognition.

Stimulated Raman adiabatic passage in a three-level superconducting circuit

The adiabatic manipulation of quantum states is a powerful technique that opened up new directions in quantum engineering—enabling tests of fundamental concepts such as geometrical phases and topological transitions, and holding the promise of alternative models of quantum computation. Here we benchmark the stimulated Raman adiabatic passage for circuit quantum electrodynamics by employing the first three levels of a transmon qubit. In this ladder configuration, we demonstrate a population transfer efficiency >80% between the ground state and the second excited state using two adiabatic Gaussian-shaped control microwave pulses. By doing quantum tomography at successive moments during the Raman pulses, we investigate the transfer of the population in time domain. Furthermore, we show that this protocol can be reversed by applying a third adiabatic pulse, we study a hybrid nondiabatic–adiabatic sequence, and we present experimental results for a quasi-degenerate intermediate level.

The precise control and manipulation of the states of a multi-level quantum system are fundamental for quantum information processing. Here, the authors demonstrate the robust adiabatic manipulation of the quantum states of a superconducting circuit via stimulated Raman adiabatic passage.

Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network

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.

Novel pseudo-random number generator based on quantum random walks

In this paper, we investigate the potential application of quantum computation for constructing pseudo-random number generators (PRNGs) and further construct a novel PRNG based on quantum random walks (QRWs), a famous quantum computation model. The PRNG merely relies on the equations used in the QRWs, and thus the generation algorithm is simple and the computation speed is fast. The proposed PRNG is subjected to statistical tests such as NIST and successfully passed the test. Compared with the representative PRNG based on quantum chaotic maps (QCM), the present QRWs-based PRNG has some advantages such as better statistical complexity and recurrence. For example, the normalized Shannon entropy and the statistical complexity of the QRWs-based PRNG are 0.999699456771172 and 1.799961178212329e-04 respectively given the number of 8 bits-words, say, 16Mbits. By contrast, the corresponding values of the QCM-based PRNG are 0.999448131481064 and 3.701210794388818e-04 respectively. Thus the statistical complexity and the normalized entropy of the QRWs-based PRNG are closer to 0 and 1 respectively than those of the QCM-based PRNG when the number of words of the analyzed sequence increases. It provides a new clue to construct PRNGs and also extends the applications of quantum computation.

Determination and correction of persistent biases in quantum annealers

Calibration of quantum computers is essential to the effective utilisation of their quantum resources. Specifically, the performance of quantum annealers is likely to be significantly impaired by noise in their programmable parameters, effectively misspecification of the computational problem to be solved, often resulting in spurious suboptimal solutions. We developed a strategy to determine and correct persistent, systematic biases between the actual values of the programmable parameters and their user-specified values. We applied the recalibration strategy to two D-Wave Two quantum annealers, one at NASA Ames Research Center in Moffett Field, California, and another at D-Wave Systems in Burnaby, Canada. We show that the recalibration procedure not only reduces the magnitudes of the biases in the programmable parameters but also enhances the performance of the device on a set of random benchmark instances.

Making hybrid [n]-rotaxanes as supramolecular arrays of molecular electron spin qubits

Quantum information processing (QIP) would require that the individual units involved--qubits--communicate to other qubits while retaining their identity. In many ways this resembles the way supramolecular chemistry brings together individual molecules into interlocked structures, where the assembly has one identity but where the individual components are still recognizable. Here a fully modular supramolecular strategy has been to link hybrid organic-inorganic [2]- and [3]-rotaxanes into still larger [4]-, [5]- and [7]-rotaxanes. The ring components are heterometallic octanuclear [Cr7NiF8(O2C(t)Bu)16](-) coordination cages and the thread components template the formation of the ring about the organic axle, and are further functionalized to act as a ligand, which leads to large supramolecular arrays of these heterometallic rings. As the rings have been proposed as qubits for QIP, the strategy provides a possible route towards scalable molecular electron spin devices for QIP. Double electron-electron resonance experiments demonstrate inter-qubit interactions suitable for mediating two-qubit quantum logic gates.

Computational multiqubit tunnelling in programmable quantum annealers

Quantum tunnelling is a phenomenon in which a quantum state traverses energy barriers higher than the energy of the state itself. Quantum tunnelling has been hypothesized as an advantageous physical resource for optimization in quantum annealing. However, computational multiqubit tunnelling has not yet been observed, and a theory of co-tunnelling under high- and low-frequency noises is lacking. Here we show that 8-qubit tunnelling plays a computational role in a currently available programmable quantum annealer. We devise a probe for tunnelling, a computational primitive where classical paths are trapped in a false minimum. In support of the design of quantum annealers we develop a nonperturbative theory of open quantum dynamics under realistic noise characteristics. This theory accurately predicts the rate of many-body dissipative quantum tunnelling subject to the polaron effect. Furthermore, we experimentally demonstrate that quantum tunnelling outperforms thermal hopping along classical paths for problems with up to 200 qubits containing the computational primitive.

Quantum tunnelling may be advantageous for quantum annealing, but multiqubit tunnelling has not yet been observed or characterized theoretically. Here, the authors demonstrate that 8-qubit tunnelling plays a role in a D-Wave Two device through a nonperturbative theory and experimental data.

Heavy Tails in the Distribution of Time to Solution for Classical and Quantum Annealing

For many optimization algorithms the time to solution depends not only on the problem size but also on the specific problem instance and may vary by many orders of magnitude. It is then necessary to investigate the full distribution and especially its tail. Here, we analyze the distributions of annealing times for simulated annealing and simulated quantum annealing (by path integral quantum Monte Carlo simulation) for random Ising spin glass instances. We find power-law distributions with very heavy tails, corresponding to extremely hard instances, but far broader distributions-and thus worse performance for hard instances-for simulated quantum annealing than for simulated annealing. Fast, nonadiabatic, annealing schedules can improve the performance of simulated quantum annealing for very hard instances by many orders of magnitude.

Uncertain behaviours of integrated circuits improve computational performance

Improvements to the performance of conventional computers have mainly been achieved through semiconductor scaling; however, scaling is reaching its limitations. Natural phenomena, such as quantum superposition and stochastic resonance, have been introduced into new computing paradigms to improve performance beyond these limitations. Here, we explain that the uncertain behaviours of devices due to semiconductor scaling can improve the performance of computers. We prototyped an integrated circuit by performing a ground-state search of the Ising model. The bit errors of memory cell devices holding the current state of search occur probabilistically by inserting fluctuations into dynamic device characteristics, which will be actualised in the future to the chip. As a result, we observed more improvements in solution accuracy than that without fluctuations. Although the uncertain behaviours of devices had been intended to be eliminated in conventional devices, we demonstrate that uncertain behaviours has become the key to improving computational performance.

Simulated quantum annealing of double-well and multiwell potentials

We analyze the performance of quantum annealing as a heuristic optimization method to find the absolute minimum of various continuous models, including landscapes with only two wells and also models with many competing minima and with disorder. The simulations performed using a projective quantum Monte Carlo (QMC) algorithm are compared with those based on the finite-temperature path-integral QMC technique and with classical annealing. We show that the projective QMC algorithm is more efficient than the finite-temperature QMC technique, and that both are inferior to classical annealing if this is performed with appropriate long-range moves. However, as the difficulty of the optimization problem increases, classical annealing loses efficiency, while the projective QMC algorithm keeps stable performance and is finally the most effective optimization tool. We discuss the implications of our results for the outstanding problem of testing the efficiency of adiabatic quantum computers using stochastic simulations performed on classical computers.

Superadiabatic Controlled Evolutions and Universal Quantum Computation

Adiabatic state engineering is a powerful technique in quantum information and quantum control. However, its performance is limited by the adiabatic theorem of quantum mechanics. In this scenario, shortcuts to adiabaticity, such as provided by the superadiabatic theory, constitute a valuable tool to speed up the adiabatic quantum behavior. Here, we propose a superadiabatic route to implement universal quantum computation. Our method is based on the realization of piecewise controlled superadiabatic evolutions. Remarkably, they can be obtained by simple time-independent counter-diabatic Hamiltonians. In particular, we discuss the implementation of fast rotation gates and arbitrary n-qubit controlled gates, which can be used to design different sets of universal quantum gates. Concerning the energy cost of the superadiabatic implementation, we show that it is dictated by the quantum speed limit, providing an upper bound for the corresponding adiabatic counterparts.

The identification of cis-regulatory elements: A review from a machine learning perspective

The majority of the human genome consists of non-coding regions that have been called junk DNA. However, recent studies have unveiled that these regions contain cis-regulatory elements, such as promoters, enhancers, silencers, insulators, etc. These regulatory elements can play crucial roles in controlling gene expressions in specific cell types, conditions, and developmental stages. Disruption to these regions could contribute to phenotype changes. Precisely identifying regulatory elements is key to deciphering the mechanisms underlying transcriptional regulation. Cis-regulatory events are complex processes that involve chromatin accessibility, transcription factor binding, DNA methylation, histone modifications, and the interactions between them. The development of next-generation sequencing techniques has allowed us to capture these genomic features in depth. Applied analysis of genome sequences for clinical genetics has increased the urgency for detecting these regions. However, the complexity of cis-regulatory events and the deluge of sequencing data require accurate and efficient computational approaches, in particular, machine learning techniques. In this review, we describe machine learning approaches for predicting transcription factor binding sites, enhancers, and promoters, primarily driven by next-generation sequencing data. Data sources are provided in order to facilitate testing of novel methods. The purpose of this review is to attract computational experts and data scientists to advance this field.

Unraveling Quantum Annealers using Classical Hardness

Recent advances in quantum technology have led to the development and manufacturing of experimental programmable quantum annealing optimizers that contain hundreds of quantum bits. These optimizers, commonly referred to as 'D-Wave' chips, promise to solve practical optimization problems potentially faster than conventional 'classical' computers. Attempts to quantify the quantum nature of these chips have been met with both excitement and skepticism but have also brought up numerous fundamental questions pertaining to the distinguishability of experimental quantum annealers from their classical thermal counterparts. Inspired by recent results in spin-glass theory that recognize 'temperature chaos' as the underlying mechanism responsible for the computational intractability of hard optimization problems, we devise a general method to quantify the performance of quantum annealers on optimization problems suffering from varying degrees of temperature chaos: A superior performance of quantum annealers over classical algorithms on these may allude to the role that quantum effects play in providing speedup. We utilize our method to experimentally study the D-Wave Two chip on different temperature-chaotic problems and find, surprisingly, that its performance scales unfavorably as compared to several analogous classical algorithms. We detect, quantify and discuss several purely classical effects that possibly mask the quantum behavior of the chip.

A quantum annealing architecture with all-to-all connectivity from local interactions

Quantum annealers are physical devices that aim at solving NP-complete optimization problems by exploiting quantum mechanics. The basic principle of quantum annealing is to encode the optimization problem in Ising interactions between quantum bits (qubits). A fundamental challenge in building a fully programmable quantum annealer is the competing requirements of full controllable all-to-all connectivity and the quasi-locality of the interactions between physical qubits. We present a scalable architecture with full connectivity, which can be implemented with local interactions only. The input of the optimization problem is encoded in local fields acting on an extended set of physical qubits. The output is-in the spirit of topological quantum memories-redundantly encoded in the physical qubits, resulting in an intrinsic fault tolerance. Our model can be understood as a lattice gauge theory, where long-range interactions are mediated by gauge constraints. The architecture can be realized on various platforms with local controllability, including superconducting qubits, NV-centers, quantum dots, and atomic systems.

Quantum versus classical annealing: insights from scaling theory and results for spin glasses on 3-regular graphs

We discuss an Ising spin glass where each S=1/2 spin is coupled antiferromagnetically to three other spins (3-regular graphs). Inducing quantum fluctuations by a time-dependent transverse field, we use out-of-equilibrium quantum Monte Carlo simulations to study dynamic scaling at the quantum glass transition. Comparing the dynamic exponent and other critical exponents with those of the classical (temperature-driven) transition, we conclude that quantum annealing is less efficient than classical simulated annealing in bringing the system into the glass phase. Quantum computing based on the quantum annealing paradigm is therefore inferior to classical simulated annealing for this class of problems. We also comment on previous simulations where a parameter is changed with the simulation time, which is very different from the true Hamiltonian dynamics simulated here.

Comparative study of the performance of quantum annealing and simulated annealing

Relations of simulated annealing and quantum annealing are studied by a mapping from the transition matrix of classical Markovian dynamics of the Ising model to a quantum Hamiltonian and vice versa. It is shown that these two operators, the transition matrix and the Hamiltonian, share the eigenvalue spectrum. Thus, if simulated annealing with slow temperature change does not encounter a difficulty caused by an exponentially long relaxation time at a first-order phase transition, the same is true for the corresponding process of quantum annealing in the adiabatic limit. One of the important differences between the classical-to-quantum mapping and the converse quantum-to-classical mapping is that the Markovian dynamics of a short-range Ising model is mapped to a short-range quantum system, but the converse mapping from a short-range quantum system to a classical one results in long-range interactions. This leads to a difference in efficiencies that simulated annealing can be efficiently simulated by quantum annealing but the converse is not necessarily true. We conclude that quantum annealing is easier to implement and is more flexible than simulated annealing. We also point out that the present mapping can be extended to accommodate explicit time dependence of temperature, which is used to justify the quantum-mechanical analysis of simulated annealing by Somma, Batista, and Ortiz. Additionally, an alternative method to solve the nonequilibrium dynamics of the one-dimensional Ising model is provided through the classical-to-quantum mapping.

Adiabatic quantum simulation of quantum chemistry

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.

When does a physical system compute?

Computing is a high-level process of a physical system. Recent interest in non-standard computing systems, including quantum and biological computers, has brought this physical basis of computing to the forefront. There has been, however, no consensus on how to tell if a given physical system is acting as a computer or not; leading to confusion over novel computational devices, and even claims that every physical event is a computation. In this paper, we introduce a formal framework that can be used to determine whether a physical system is performing a computation. We demonstrate how the abstract computational level interacts with the physical device level, in comparison with the use of mathematical models in experimental science. This powerful formulation allows a precise description of experiments, technology, computation and simulation, giving our central conclusion: physical computing is the use of a physical system to predict the outcome of an abstract evolution. We give conditions for computing, illustrated using a range of non-standard computing scenarios. The framework also covers broader computing contexts, where there is no obvious human computer user. We introduce the notion of a ‘computational entity’, and its critical role in defining when computing is taking place in physical systems.

Hearing the shape of the Ising model with a programmable superconducting-flux annealer

Two objects can be distinguished if they have different measurable properties. Thus, distinguishability depends on the Physics of the objects. In considering graphs, we revisit the Ising model as a framework to define physically meaningful spectral invariants. In this context, we introduce a family of refinements of the classical spectrum and consider the quantum partition function. We demonstrate that the energy spectrum of the quantum Ising Hamiltonian is a stronger invariant than the classical one without refinements. For the purpose of implementing the related physical systems, we perform experiments on a programmable annealer with superconducting flux technology. Departing from the paradigm of adiabatic computation, we take advantage of a noisy evolution of the device to generate statistics of low energy states. The graphs considered in the experiments have the same classical partition functions, but different quantum spectra. The data obtained from the annealer distinguish non-isomorphic graphs via information contained in the classical refinements of the functions but not via the differences in the quantum spectra.

Code-division multiple-access multiuser demodulator by using quantum fluctuations

We examine the average-case performance of a code-division multiple-access (CDMA) multiuser demodulator in which quantum fluctuations are utilized to demodulate the original message within the context of Bayesian inference. The quantum fluctuations are built into the system as a transverse field in the infinite-range Ising spin glass model. We evaluate the performance measurements by using statistical mechanics. We confirm that the CDMA multiuser modulator using quantum fluctuations achieve roughly the same performance as the conventional CDMA multiuser modulator through thermal fluctuations on average. We also find that the relationship between the quality of the original information retrieval and the amplitude of the transverse field is somehow a "universal feature" in typical probabilistic information processing, viz., in image restoration, error-correcting codes, and CDMA multiuser demodulation.

Quantum computing. Defining and detecting quantum speedup

The development of small-scale quantum devices raises the question of how to fairly assess and detect quantum speedup. Here, we show how to define and measure quantum speedup and how to avoid pitfalls that might mask or fake such a speedup. We illustrate our discussion with data from tests run on a D-Wave Two device with up to 503 qubits. By using random spin glass instances as a benchmark, we found no evidence of quantum speedup when the entire data set is considered and obtained inconclusive results when comparing subsets of instances on an instance-by-instance basis. Our results do not rule out the possibility of speedup for other classes of problems and illustrate the subtle nature of the quantum speedup question.

Basis for a neuronal version of Grover's quantum algorithm

Grover's quantum (search) algorithm exploits principles of quantum information theory and computation to surpass the strong Church–Turing limit governing classical computers. The algorithm initializes a search field into superposed N (eigen)states to later execute nonclassical “subroutines” involving unitary phase shifts of measured states and to produce root-rate or quadratic gain in the algorithmic time (O(N^1/2)) needed to find some “target” solution m. Akin to this fast technological search algorithm, single eukaryotic cells, such as differentiated neurons, perform natural quadratic speed-up in the search for appropriate store-operated Ca²⁺ response regulation of, among other processes, protein and lipid biosynthesis, cell energetics, stress responses, cell fate and death, synaptic plasticity, and immunoprotection. Such speed-up in cellular decision making results from spatiotemporal dynamics of networked intracellular Ca²⁺-induced Ca²⁺ release and the search (or signaling) velocity of Ca²⁺ wave propagation. As chemical processes, such as the duration of Ca²⁺ mobilization, become rate-limiting over interstore distances, Ca²⁺ waves quadratically decrease interstore-travel time from slow saltatory to fast continuous gradients proportional to the square-root of the classical Ca²⁺ diffusion coefficient, D^1/2, matching the computing efficiency of Grover's quantum algorithm. In this Hypothesis and Theory article, I elaborate on these traits using a fire-diffuse-fire model of store-operated cytosolic Ca²⁺ signaling valid for glutamatergic neurons. Salient model features corresponding to Grover's quantum algorithm are parameterized to meet requirements for the Oracle Hadamard transform and Grover's iteration. A neuronal version of Grover's quantum algorithm figures to benefit signal coincidence detection and integration, bidirectional synaptic plasticity, and other vital cell functions by rapidly selecting, ordering, and/or counting optional response regulation choices.

Hybrid quantum magnetism in circuit QED: from spin-photon waves to many-body spectroscopy

We introduce a model of quantum magnetism induced by the nonperturbative exchange of microwave photons between distant superconducting qubits. By interconnecting qubits and cavities, we obtain a spin-boson lattice model that exhibits a quantum phase transition where both qubits and cavities spontaneously polarize. We present a many-body ansatz that captures this phenomenon all the way, from a the perturbative dispersive regime where photons can be traced out, to the nonperturbative ultrastrong coupling regime where photons must be treated on the same footing as qubits. Our ansatz also reproduces the low-energy excitations, which are described by hybridized spin-photon quasiparticles, and can be probed spectroscopically from transmission experiments in circuit QED, as shown by simulating a possible experiment by matrix-product-state methods.

Using thermal boundary conditions to engineer the quantum state of a bulk magnet

The degree of contact between a system and the external environment can alter dramatically its proclivity to quantum mechanical modes of relaxation. We show that controlling the thermal coupling of cubic-centimeter-sized crystals of the Ising magnet LiHo(x)Y(1-x)F4 to a heat bath can be used to tune the system between a glassy state dominated by thermal excitations over energy barriers and a state with the hallmarks of a quantum spin liquid. Application of a magnetic field transverse to the Ising axis introduces both random magnetic fields and quantum fluctuations, which can retard and speed the annealing process, respectively, thereby providing a mechanism for continuous tuning between the destination states. The nonlinear response of the system explicitly demonstrates quantum interference between internal and external relaxation pathways.

Quantum phases in circuit QED with a superconducting qubit array

Circuit QED on a chip has become a powerful platform for simulating complex many-body physics. In this report, we realize a Dicke-Ising model with an antiferromagnetic nearest-neighbor spin-spin interaction in circuit QED with a superconducting qubit array. We show that this system exhibits a competition between the collective spin-photon interaction and the antiferromagnetic nearest-neighbor spin-spin interaction, and then predict four quantum phases, including: a paramagnetic normal phase, an antiferromagnetic normal phase, a paramagnetic superradiant phase, and an antiferromagnetic superradiant phase. The antiferromagnetic normal phase and the antiferromagnetic superradiant phase are new phases in many-body quantum optics. In the antiferromagnetic superradiant phase, both the antiferromagnetic and superradiant orders can coexist, and thus the system possesses symmetry. Moreover, we find an unconventional photon signature in this phase. In future experiments, these predicted quantum phases could be distinguished by detecting both the mean-photon number and the magnetization.

Algebraic versus Exponential Decoherence in Dissipative Many-Particle Systems

The interplay between dissipation and internal interactions in quantum many-body systems gives rise to a wealth of novel phenomena. Here we investigate spin-1/2 chains with uniform local couplings to a Markovian environment using the time-dependent density matrix renormalization group. For the open XXZ model, we discover that the decoherence time diverges in the thermodynamic limit. The coherence decay is then algebraic instead of exponential. This is due to a vanishing gap in the spectrum of the corresponding Liouville superoperator and can be explained on the basis of a perturbative treatment. In contrast, decoherence in the open transverse-field Ising model is found to be always exponential. In this case, the internal interactions can both facilitate and impede the environment-induced decoherence.

Experimental determination of Ramsey numbers

Ramsey theory is a highly active research area in mathematics that studies the emergence of order in large disordered structures. Ramsey numbers mark the threshold at which order first appears and are extremely difficult to calculate due to their explosive rate of growth. Recently, an algorithm that can be implemented using adiabatic quantum evolution has been proposed that calculates the two-color Ramsey numbers R(m,n). Here we present results of an experimental implementation of this algorithm and show that it correctly determines the Ramsey numbers R(3,3) and R(m,2) for 4≤m≤8. The R(8,2) computation used 84 qubits of which 28 were computational qubits. This computation is the largest experimental implementation of a scientifically meaningful adiabatic evolution algorithm that has been done to date.

Open access integrated therapeutic and diagnostic platforms for personalized cardiovascular medicine

It is undeniable that the increasing costs in healthcare are a concern. Although technological advancements have been made in healthcare systems, the return on investment made by governments and payers has been poor. The current model of care is unsustainable and is due for an upgrade. In developed nations, a law of diminishing returns has been noted in population health standards, whilst in the developing world, westernized chronic illnesses, such as diabetes and cardiovascular disease have become emerging problems. The reasons for these trends are complex, multifactorial and not easily reversed. Personalized medicine has the potential to have a significant impact on these issues, but for it to be truly successful, interdisciplinary mass collaboration is required. We propose here a vision for open-access advanced analytics for personalized cardiac diagnostics using imaging, electrocardiography and genomics.

Observing the nonequilibrium dynamics of the quantum transverse-field Ising chain in circuit QED

We show how a quantum Ising spin chain in a time-dependent transverse magnetic field can be simulated and experimentally probed in the framework of circuit QED with current technology. The proposed setup provides a new platform for observing the nonequilibrium dynamics of interacting many-body systems. We calculate its spectrum to offer a guideline for its initial experimental characterization. We demonstrate that quench dynamics and the propagation of localized excitations can be observed with the proposed setup and discuss further possible applications and modifications of this circuit QED quantum simulator.

Decoherence induced deformation of the ground state in adiabatic quantum computation

Despite more than a decade of research on adiabatic quantum computation (AQC), its decoherence properties are still poorly understood. Many theoretical works have suggested that AQC is more robust against decoherence, but a quantitative relation between its performance and the qubits' coherence properties, such as decoherence time, is still lacking. While the thermal excitations are known to be important sources of errors, they are predominantly dependent on temperature but rather insensitive to the qubits' coherence. Less understood is the role of virtual excitations, which can also reduce the ground state probability even at zero temperature. Here, we introduce normalized ground state fidelity as a measure of the decoherence-induced deformation of the ground state due to virtual transitions. We calculate the normalized fidelity perturbatively at finite temperatures and discuss its relation to the qubits' relaxation and dephasing times, as well as its projected scaling properties.

Witnessing Quantum Coherence: from solid-state to biological systems

Quantum coherence is one of the primary non-classical features of quantum systems. While protocols such as the Leggett-Garg inequality (LGI) and quantum tomography can be used to test for the existence of quantum coherence and dynamics in a given system, unambiguously detecting inherent "quantumness" still faces serious obstacles in terms of experimental feasibility and efficiency, particularly in complex systems. Here we introduce two "quantum witnesses" to efficiently verify quantum coherence and dynamics in the time domain, without the expense and burden of non-invasive measurements or full tomographic processes. Using several physical examples, including quantum transport in solid-state nanostructures and in biological organisms, we show that these quantum witnesses are robust and have a much finer resolution in their detection window than the LGI has. These robust quantum indicators may assist in reducing the experimental overhead in unambiguously verifying quantum coherence in complex systems.

Finding low-energy conformations of lattice protein models by quantum annealing

Lattice protein folding models are a cornerstone of computational biophysics. Although these models are a coarse grained representation, they provide useful insight into the energy landscape of natural proteins. Finding low-energy threedimensional structures is an intractable problem even in the simplest model, the Hydrophobic-Polar (HP) model. Description of protein-like properties are more accurately described by generalized models, such as the one proposed by Miyazawa and Jernigan (MJ), which explicitly take into account the unique interactions among all 20 amino acids. There is theoretical and experimental evidence of the advantage of solving classical optimization problems using quantum annealing over its classical analogue (simulated annealing). In this report, we present a benchmark implementation of quantum annealing for lattice protein folding problems (six different experiments up to 81 superconducting quantum bits). This first implementation of a biophysical problem paves the way towards studying optimization problems in biophysics and statistical mechanics using quantum devices.

Adiabatic quantum algorithm for search engine ranking

We propose an adiabatic quantum algorithm for generating a quantum pure state encoding of the PageRank vector, the most widely used tool in ranking the relative importance of internet pages. We present extensive numerical simulations which provide evidence that this algorithm can prepare the quantum PageRank state in a time which, on average, scales polylogarithmically in the number of web pages. We argue that the main topological feature of the underlying web graph allowing for such a scaling is the out-degree distribution. The top-ranked log(n) entries of the quantum PageRank state can then be estimated with a polynomial quantum speed-up. Moreover, the quantum PageRank state can be used in "q-sampling" protocols for testing properties of distributions, which require exponentially fewer measurements than all classical schemes designed for the same task. This can be used to decide whether to run a classical update of the PageRank.