Open Access

What is a quantum simulator?

EPJ Quantum Technology20141:10

https://doi.org/10.1140/epjqt10

Received: 12 May 2014

Accepted: 1 July 2014

Published: 23 July 2014

Abstract

Quantum simulators are devices that actively use quantum effects to answer questions about model systems and, through them, real systems. In this review we expand on this definition by answering several fundamental questions about the nature and use of quantum simulators. Our answers address two important areas. First, the difference between an operation termed simulation and another termed computation. This distinction is related to the purpose of an operation, as well as our confidence in and expectation of its accuracy. Second, the threshold between quantum and classical simulations. Throughout, we provide a perspective on the achievements and directions of the field of quantum simulation.

PACS Codes: 03.65.-w, 03.67.Ac, 03.67.Lx.

Keywords

quantumsimulationcomputationdefinitionperspectivereview

1 Introduction

Simulating models of the physical world is instrumental in advancing scientific knowledge and developing technologies. Accordingly, the task has long been at the heart of science. For example, orreries have been used for millennia to simulate models of the motions of celestial objects [1]. More recently, differential analysers or mechanical integrators were developed to solve differential equations modelling e.g. heat flow and transmission lines [2, 3].

Unfortunately, simulation is not always easy. There are numerous important questions to which simulations would provide answers but which remain beyond current technological capabilities. These span a multitude of scientific research areas, from high-energy [4, 5], nuclear, atomic [6] and condensed matter physics [7, 8] to thermal rate constants [9] and molecular energies [10, 11] in chemistry [12, 13].

An exciting possibility is that the first simulation devices capable of answering some of these questions may be quantum, not classical, with this distinction to be clarified below. The types of quantum hardware proposed to perform such simulations are as hugely varying as the problems they aim to solve: trapped ions [1419], cold atoms in optical lattices [2022], liquid and solid-state NMR [2327], photons [2833], quantum dots [3436], superconducting circuits [6, 3742], and NV centres [43, 44]. At the time of writing, astonishing levels of control in proof-of-principle experiments (cf. the above references and citations within) suggest that quantum simulation is transitioning from a theoretical dream into a credible possibility.

Here we complement recent reviews of quantum simulation [4550] by providing our answers to several fundamental but non-trivial and often contentious questions about quantum simulators, highlighting whenever there is a difference of opinion within the community. In particular, we discuss how quantum simulations are defined, the role they play in science, and the importance that should be given to verifying their accuracy.

2 What are simulators?

Both simulators and computers are physical devices that reveal information about a mathematical function. Whether we call a device a simulator or a computer depends not only on the device, but also on what is supposed about the mathematical function and the intended use of the information obtained.

If the function is interpreted as part of a physical model then we are likely to call the device a simulator. However, this brief definition neglects the typical purpose and context of a simulation (see Figure 1). As will become clear below, a simulation is usually the first step in a two-step process, with the second being the comparison of the physical model with a real physical system (see Section 4 ‘How are simulators used?’). This then makes simulation part of the usual scientific method. This context is why some loosely state that simulation is the use of one physical device to tell us about another real physical system [51]. It also affects the level of trust that can be reasonably demanded of the simulation (see Section 7 ‘When are quantum simulators trustworthy?’).
Figure 1

The role of a quantum simulator. A quantum simulator reveals information about an abstract mathematical function relating to a physical model. However, it is important to consider the typical purpose and context of such a simulation. By comparing its results to a real system of interest, a simulation is used to decide whether or not the model accurately represents that system. If the representation is thought to be accurate, the quantum simulator can then loosely be considered as a simulator for the system of interest. We represent this in the figure by a feedback loop from the quantum device back to the system of interest.

If the accuracy with which a device simulates a model can be arbitrarily controlled and guaranteed then it is often elevated to the status of a computer, a name that reflects our trust in the device. A consequence of this guaranteed accuracy is that it allows assured interpretation of the results of the operation, the information obtained about a mathematical function, without reference to some real system. Thus, as well as to imply accuracy, the term computer is also more often used to describe calculations that relate to more abstract mathematical functions, unconnected to a physical system, and are used outside of the scientific method.

It is interesting to apply our definition of a simulator to well-known situations in which the term is used. The majority of experimental devices advertised as quantum simulations are so-called analogue simulators [4550]. They are devices whose Hamiltonians can be engineered to approximate those of a subset of models put forward to describe a real system. This closely fits our definition of simulators as well as their usual purpose and context outlined above. Another different type of device is Lloyd’s digital quantum simulator [52]. This replicates universal unitary evolution by mapping it, via Trotter decompositions, to a circuit, which can then be made arbitrarily accurate by the use of error correction. Whilst going by the name simulator, it is effectively a universal quantum computer. From our arguments above, we would also describe this as a computer: error correction ensures the result applying to the modelled system can be interpreted without comparison to a real physical system, thus playing the role of a computation. Finally, the company D-wave has developed a device to find the ground state of the classical Ising model [53]. While this is a device that returns a property of a physical model, it is advertised as a computer. We would agree, since its primary use seems to be in solving optimisation problems embedded in the Ising ground state, rather than comparing this to a real physical system.

3 What are quantum simulators?

To complete the definition of a quantum simulator we need to define what is meant by a quantum device. This problem is also faced by quantum biology [5456] and other quantum technologies. It is complicated by the fact that, at some level, quantum mechanics describes the structure and dynamics of all physical objects. Quantumness may be structural and inert e.g. merely responsible for the available single-particle modes. Or quantumness may be active e.g. exploiting entanglement between modes, potentially achieving functionality more efficiently than a classical device (see Section 6 ‘Why do we need quantum simulators?’).

To this end, we must distinguish between devices for which, during the operation of the simulator, the particular degrees of freedom doing the simulating do or do not behave classically. We choose here to define classical as when there is some single-particle basis in which the density operator ρ ˆ ( t ) describing the relevant degrees of freedom is, for the purposes of the simulation, diagonal at all times t. This is written
ρ ˆ ( t ) = s , i p ( { N s , i } , t ) | { N s , i } , t { N s , i } , t | .

Here | { N s , i } , t is a Fock state in which N s , i particles of species s occupy mode i. The mode annihilation operator is a ˆ s , i ( t ) = d r Ψ ˆ s ( r ) χ s , i ( r , t ) , with χ s , i ( r , t ) the corresponding single-particle modefunction and Ψ ˆ s ( r ) the field operator for species s. The diagonal elements p ( { N s , i } , t ) are the probabilities of the different occupations.

This condition ensures there is always a single-particle basis in which dephasing would have no effect. This invariance under dephasing is a common way to define classicality [57]. The condition also disallows entanglement between different single-particle modes, as would be expected for a condition of classicality. It does allow the natural entanglement between identical particles in the same mode due to symmetrisation. Such entanglement can be mapped to entanglement between modes by operations that themselves do not contribute entanglement [58]. However, if such operations are never applied, it is reasonable to consider the device to be classical. In other words, we are less concerned with the potential of entanglement as a resource than how this resource is manifested during the operation of the device.

Let us build confidence in our definition by using it to classify well-known devices as classical or quantum. Reassuringly, the operation of the room-temperature semi-conductor devices used to perform every-day computing are classical according to the definition. The relevant properties of inhomogeneous semi-conductors are captured by a model in which the degrees of freedom are valence (quasi) electrons that incoherently occupy single-particle states χ i ( r ) of the Bloch type [59]. Next, consider two devices for preparing the ground state of a classical Ising model, classical annealing [60] and quantum annealing [6165]. Classical annealing by coupling the Ising spins to a cooling environment is not quantum since at all times the thermal density matrix of the system is diagonal in the computational basis, a single-particle basis. However, preparing that same state by quantum annealing, adiabatically quenching a transverse field, is expected to be quantum. This is due to the fact that in the middle of the quench, which forms the main part of the simulation, the Ising spins will usually become entangled. Since these are particles in distinguishable modes, the device cannot behave classically at all times. Finally, consider a Bose-Einstein condensate [66, 67], that is many bosons in the same single-particle mode χ 0 ( t ) . Alternatively, consider a Poissonian mixture of different occupation numbers or equivalently a coherent number superposition of unknown phase, both of which are well approximated by N 0 bosons occupying χ 0 ( t ) , for large mean occupation N 0 . In these cases, the single occupied modefunction evolves according to the Gross-Pitaevskii equation and we would label the system as classical. When classifying the use of condensed Bose gases as simulators of gravitational models [6872] the classical or quantum assignment depends on whether, for the purposes of the simulation, the system is possibly described by a single condensate modefunction without fluctuations above the condensate. An example that falls clearly onto the quantum side is provided by a simulator of the Gibbons-Hawking effect [73, 74], which is fundamentally reliant on quantum vacuum fluctuations.

Our chosen boundary between quantum and classical is one of many possibilities. Indeed, defining the quantumness of the simulation entirely in terms of the device is not common. Many others [49, 50] take the quantum in quantum simulator to relate to the model being simulated as well as to the simulating device. In common with definitions of quantum computation, our assignment of the quantum in quantum simulator based only on the device avoids the assumption that only simulating quantum models is hard enough to potentially benefit from a quantum device. This is not so: finding the ground state of even a classical Ising model is NP-hard and thus thought to be inefficient on both a classical and quantum device [75, 76].

4 How are simulators used?

A common perception (that goes right back to the language used at the conception of quantum simulation [51]) is that the purpose of a simulator is purely to reveal information about another real system. We pick an idealised model describing a system of interest, and then simulate that model, taking the output to describe not only the model but the system of interest. As long as the idealised model is a ‘good’ description of the system of interest then it is inferred that the simulator is a ‘good’ simulator of the system. While this inference is correct, it misses an important purpose of a simulator.

This other crucial purpose of a simulator is to reveal information about a model and compare this to the behaviour of the real system of interest. This then allows us to infer whether or not the model provides a ‘good’ description of the system in the first place and whether or not the results bear any relevance to the real world. For example, simulating the Fermi-Hubbard model would be hugely important if it turned out that this model captures the behaviour of some high- T c superconductors (as suggested by some [7780]), but it may be that the main conclusion of simulations will be to rule this out (as expected by others [8183]). Only when we have developed confidence in a model accurately representing a system can we use the simulator of the model to inform us about the system.

5 Why do we need simulators?

Above we have stated that simulators are used to find properties of a model, assess whether the model is relevant to and accurately describes the real system of interest, and, if so, learn about that system. Are there other ways to learn about a system without simulation? Do we need simulators?

There are, of course, many examples of scientists making progress without simulation. Over a century ago, the phenomenon of superconductivity was discovered and later its properties analysed by experimental investigation largely unguided by analytical or numerical simulation [84]. Today, in cases where detailed simulation is not possible, we successfully design drugs largely by trial and error on a mass scale [85].

These two examples, however, also show why simulation is crucial. Computer-aided drug design [86, 87] exploits the simulation of molecular systems to drastically speed up and thus lower the cost of the design process. Similarly, if we wish to manufacture materials with enhanced superconducting properties, e.g. increase the critical temperature T c , then we might benefit from some understanding directing that manufacture, as would be provided by a model and a means of simulating it [88, 89].

Simulation can also be a convenience: in 2014 the USA bobsleigh team won Olympic bronze with a machine designed almost entirely virtually [90]. Simulation was used to optimise the aerodynamic performance without the need for a wind tunnel.

6 Why do we need quantum simulators?

While the idea of simulations is centuries old [1, 2], the suggestion that a quantum device would make for a better mimic of some models than a classical device is commonly attributed to Feynman in 1982 [51]. He noted that calculating properties of an arbitrary quantum model on a classical device is a seemingly very inefficient thing to do (taking a time that scales exponentially with the number of particles in the model being simulated), but a quantum device might be able to do this efficiently (taking a time that scales at most polynomially with particle number [52]).

This does not of course prohibit the simulation of many quantum models from being easy using classical devices and thus not in need of a quantum simulator. The classical numerical tools usually employed include exact calculations, mean-field [91] and dynamical mean-field theory [9294], tensor network theory [95102], density functional theory (DFT) [103107] or quantum Monte Carlo algorithms [108111], which all have their limitations. Exact calculations are only possible for small Hilbert spaces. Mean-field-based methods are only applicable when the correlations between the constituent parts of the system being modelled are weak. Tensor network methods are only applicable if there is a network structure to the Hilbert space and often fail in the presence of strong entanglement between contiguous bipartite subspaces [112], with this sensitivity to entanglement being much greater with two- or higher-dimensional models. For DFT, the functionals describing strong correlations are, in general, not believed to be efficient to find [113]. Quantum Monte Carlo struggles, for example, with Fermionic statistics or frustrated models, due to the sign problem [114, 115].

For the above reasons, quantum devices are expected to be crucial for large network (e.g. lattice) models, featuring Fermions or frustration and strong entanglement, or non-network based many-body models featuring states with strong correlations that are difficult to describe with DFT. Strong entanglement can arise, for example, near a phase transition, or after a non-equilibrium evolution [116]. It must be stated, however, that there is no guarantee that a classical device or algorithm will not sometime in the future be devised to efficiently study some subset of the above quantum models.

In addition to the widely-accepted need for quantum devices for the quantum models discussed above, there are calls and proposals for quantum devices to simulate classical models [117, 118], for example, molecular dynamics [119] and lattice gas models [120, 121]. This also applies to any simulation that reduces to solving an eigenvalue equation [122] or a set of linear equations [123]. As with quantum models, many of these simulations, for example solving a set of linear equations, can be solved without much trouble on a classical device for small to medium simulations. The benefit of a quantum device is that the size of problems that can be tackled in a reasonable time grows significantly more quickly with the size of the simulating device than it does for a classical device, thus it is envisaged that quantum devices will one day be able to solve larger problems than their classical counterparts.

It is clear from this last point that the scaling of classical and quantum simulators must be treated carefully, taking into account the sizes of problems that can be tackled by current or future devices. It is possible that the experimental difficulty of scaling up quantum simulation hardware might cause an overhead such that a quantum device does not surpass the accuracy obtained by a classical algorithm that in principle does not scale as well but runs on ever-improving hardware obeying Moore’s law.

7 When are quantum simulators trustworthy?

So far we are yet to address perhaps the most difficult and important aspect of simulation, upon which its success rests. How can we asses whether the quantum simulator represents the model? How rigorous an assessment is needed?

For this discussion we focus on analogue quantum simulators, because they are the most easily scaled quantum simulators and so are likely to be used in the near future to simulate large systems. They also most closely follow our definition of a simulator, as opposed to a computer (see Section 2 ‘What are simulators?’).

The topic of falsifying bad quantum simulators has received some attention. In certain parameter regimes there may be efficiently calculable exact analytical results or it might be possible to perform a trusted classical simulation, against which the quantum simulator results may be compared [116]. Often there are bounds that some measurable quantities are known to obey, and this too can be tested [47]. Alternatively, it might be possible to check known relationships between two different simulations. For example, in an Ising model, flipping the direction of the magnetic field is equivalent to flipping the sign of the component of the spins along that field, thus giving two simulations whose results are expected to have a clear relationship. A natural extension of this strategy is to compare many quantum simulations realised by different devices, perhaps each with a slightly different source of error, trusting only the aspects of the results shared by all devices [124]. If any of the above tests fail beyond an acceptable accuracy, then we do not trust the simulation results. If a simulator passes all tests, then we may take this as support for the accuracy of that simulator.

It would be incorrect, however, to say that such tests verify the accuracy of a simulator. A simulator could have significant errors yet pass these tests. It might be that the simulator is accurate in the regimes in which we have accurate analytical or classical numerical results, but is more sensitive to errors in regimes that are difficult to treat with other methods, e.g. near phase transitions, perhaps for the same reason. In fact, Hauke et al. gave an example of exactly this phenomenon in the transverse Ising model [47]. The danger with comparing simulations, even realised by different devices [124], is that there may be similar sources of error, or errors in the two simulations may manifest in the results in the same way.

Although this makes simulation difficult to assess, it does not invalidate it; it would be unreasonably harsh to demand verification of all simulators. The reason for this is that, as illustrated in Figure 1, simulators are usually the first step in a two-step process: first a device is devised to simulate a model, and second the model is employed to study a real system (see Section 4 ‘How are they used?’). It might be unreasonable to demand a more rigorous testing of the first part of this process than the second. In the second part, when we devise a model to reproduce the behaviour of a physical system, we only demand that the model be falsifiable [125]. We seek as many fail-able tests as possible of the model, and to the extent that it passes these tests, we retain the model. It is difficult for experiments to verify a particular use of the model, rather successful experiments merely declare the model ‘not yet false’. This is the scientific method. We should not, therefore, demand anything more or less when going in the other direction, devising a physical device to reproduce the behaviour of a model. All we can do is test our simulators as much as possible, and slowly build confidence in accordance with the passing of these tests. If the capability of performing such tests lags behind the development of the simulator, then so naturally must our confidence.

It becomes clear that the purpose of the device is crucial to how it is assessed, explaining our highlighting the purpose of a simulator alongside its definition. If we were using a device to provide information about a model without any additional motivation, as with a computer, then it would be reasonable to search for a means of verification and guarantees of accuracy, as with a computer. Eventually, quantum technologies might develop to a stage where large simulations of this type are feasible, e.g. via Lloyd’s digital simulator [52], but it is likely to be in the more distant future. It must be noted, however, that many of the devices we use regularly for computation are unverifiable in the strictest sense. Not every transistor in the classical computers we use (for instance to simulate quantum systems) can be verified to be functioning as desired [126]. We instead develop an understanding of the sources of error, perform some tests to check for obvious errors, and use the devices with caution.

The words ‘trust’ and ‘confidence’ in the preceding paragraphs are chosen deliberately. They indicate that, since for simulation we do not always have verifiability, we are not discussing objective properties of devices, but our understanding of them. This will change in time (see an example of this in Figure 2). Further, confidence depends on the eventual goal of our use of the simulator. Some properties of a system may be too sensitive to Hamiltonian parameters to be realistically captured by a simulator, while other properties may be statistically robust against parameter variations [127]. In this sense trustworthiness is not a clear-cut topic that is established upon the initial development of a simulator. Instead, it is the result of a complex, time-consuming process in the period that follows. It is the responsibility of critics not to be overly harsh and unfairly demanding of new simulators to provide immediate proof of their trustworthiness, but it is also the responsibility of proponents not to declare trustworthiness before their simulator has earned it.
Figure 2

Establishing trust in a simulator. Consider the displacement of a spring due to the pressure of a gas (far left), or the time taken for a dropped ball to fall (middle left). Simple models can be proposed to describe either system. The former might be modelled as an ideal gas trapped in a box by a frictionless piston held in place by a perfect spring. The latter as a frictionless body moving with uniform acceleration. Calculating the quantity of interest within either system, displacement or time, respectively, reduces within the model to calculating a square root. We thus consider four methods to perform this simulation. Building an approximation to either model system; analogue simulation. Alternatively, using an abacus (middle right) or a calculator (far right); digital simulation.

With today’s knowledge, in the parlance used in this article, we would elevate the status of the latter two simulations to computations, because of the guaranteed accuracy with which each calculation reproduces the model. Meanwhile, the former two simulatiors are not so easily verified. Importantly, they are falsifiable, e.g. by comparing one to the other. This is similar to the state of analogue quantum simulators currently used to perform large-scale quantum simulations.

However, the confidence in each simulator is a matter of perspective. It is not objective. Many centuries ago, we would only have trusted the abacus to perform such a calculation, since its principles were well understood and square-root algorithms with assured convergence were known even to the Babylonians. Once Gallileo began the development of mechanics, we might have considered the method of dropping a ball. Confidence in the simulation could have been established by testing the analogue simulator against the abacus. Nearly two centuries ago, when we first began to understand equilibrium thermodynamics, we might have preferred the gas-piston-spring method. Nowadays, we would all choose the calculator or a solid-state equivalent. This confidence is partly a result of testing the calculator against some known results, but also largely because, after the development of quantum mechanics, we feel we understand the components of solid-state systems to such a high level that we are willing to extrapolate this confidence to unknown territory. In a century, our confidence could well be placed most strongly in another system.

8 Where next for quantum simulation?

The majority of the current effort on quantum simulation is, firstly, in matching models of interest to a suitable quantum device with which to perform a simulation [49, 50]. Secondly, experimentalists demonstrate a high level of control and flexibility with a simulator, performing some of the simple fail-able tests mentioned above [18, 22, 33]. This is very much along the lines of the five goals set out by Cirac and Zoller in 2012 [46], and great successes have led to claims that we are now able to perform simulations on a quantum device that we are unable to do on a classical device. In the future, the main direction of inquiry will continue to be along these lines.

However, it is the very fact that the simulation capabilities of quantum devices are beginning to surpass those of classical devices that should prompt a more forceful investigation into the best approach to establishing confidence in quantum simulators. Hauke et al. proposed a set of requirements for a quantum simulator, an alternative to Cirac and Zoller’s, that focuses on establishing the reliability and efficiency of a simulator, and the connection between these two properties [47]. As we move to classically unsimulable system sizes and regimes where there is no clear expected behaviour, trustworthiness and falsifiability should no longer be an afterthought. In fact, they should be primary objectives of experimental and theoretical work, since quantum simulators cannot truly be useful until some level of trust is established.

Can we predict in advance where the results of quantum simulators are more sensitive to errors? How does this overlap with the regimes of classical simulability? Are there even some results that will be exponentially sensitive to the Hamiltonian parameters and not expected to ever be simulable in a strict sense? These are difficult but important questions to answer, and the path towards answering them will be exciting and thought provoking.

Declarations

Acknowledgements

The authors thank the National Research Foundation and the Ministry of Education of Singapore for support.

Authors’ Affiliations

(1)
Centre for Quantum Technologies, National University of Singapore
(2)
Clarendon Laboratory, University of Oxford
(3)
Keble College, University of Oxford
(4)
Institute for Scientific Interchange

References

  1. Brewster D: Planetary machines. In The Edinburgh Encyclopedia Vol 16. William Blackwood and Proprietors, Edinburgh; 1830:624.Google Scholar
  2. Thomson J: An integrating machine having a new kinematic principle. Proc. R. Soc. Lond. 1876, 24: 164–170.Google Scholar
  3. Cairns WJ, Crank J, Lloyd EC: Some improvements in the construction of a small scale differential analyser and a review of recent applications. Technical report 27/44, Armament Research Department Theoretical Research; 1944. UK National Archives reference DEFE 15/751 C20779.Google Scholar
  4. Barceló C, Liberati S, Visser M: Analogue gravity. Living Rev. Relativ. 2005., 8: Article ID 214 Article ID 214Google Scholar
  5. Jordan SP, Lee KSM, Preskill J: Quantum algorithms for quantum field theories. Science 2012, 336: 1130–1133. 10.1126/science.1217069ADSView ArticleGoogle Scholar
  6. You JQ, Nori F: Atomic physics and quantum optics using superconducting circuits. Nature 2011, 474: 589–597. 10.1038/nature10122ADSView ArticleGoogle Scholar
  7. Lewenstein M, Sanpera A, Ahufinger V, Damski B, Sen A, Sen U: Ultracold atomic gases in optical lattices: mimicking condensed matter physics and beyond. Adv. Phys. 2007, 56: 243–379. 10.1080/00018730701223200ADSView ArticleGoogle Scholar
  8. Lewenstein M, Sanpera A, Ahufinger V: Ultracold Atoms in Optical Lattices: Simulating Quantum Many-Body Systems. Oxford University Press, Oxford; 2012.View ArticleGoogle Scholar
  9. Lidar DA, Wang H: Calculating the thermal rate constant with exponential speedup on a quantum computer. Phys. Rev. E 1999, 59: 2429–2438. 10.1103/PhysRevE.59.2429ADSView ArticleGoogle Scholar
  10. Wang H, Kais S, Aspuru-Guzik A, Hoffmann MR: Quantum algorithm for obtaining the energy spectrum of molecular systems. Phys. Chem. Chem. Phys. 2008, 10: 5321–5393.View ArticleGoogle Scholar
  11. Whitfield JD, Biamonte J, Aspuru-Guzik A: Simulation of electronic structure Hamiltonians using quantum computers. Mol. Phys. 2011, 109: 735–750. 10.1080/00268976.2011.552441ADSView ArticleGoogle Scholar
  12. Kassal I, Whitfield JD, Perdomo-Ortiz A, Yung M-H, Aspuru-Guzik A: Simulating chemistry using quantum computers. Annu. Rev. Phys. Chem. 2011, 62: 185–207. 10.1146/annurev-physchem-032210-103512ADSView ArticleGoogle Scholar
  13. Lu D, Xu B, Xu N, Li Z, Chen H, Peng X, Ruixue X, Du J: Quantum chemistry simulation on quantum computers: theories and experiments. Phys. Chem. Chem. Phys. 2012, 14: 9411–9420. 10.1039/c2cp23700hView ArticleGoogle Scholar
  14. Porras D, Cirac JI: Effective quantum spin systems with trapped ions. Phys. Rev. Lett. 2004., 92: Article ID 207901 Article ID 207901Google Scholar
  15. Kim K, Chang MS, Korenblit S, Islam R, Edwards EE, Freericks JK, Lin GD, Duan LM, Monroe C: Quantum simulation of frustrated Ising spins with trapped ions. Nature 2010, 465: 590–593. 10.1038/nature09071ADSView ArticleGoogle Scholar
  16. Gerritsma R, Kirchmair G, Zähringer F, Solano E, Blatt R, Roos CF: Quantum simulation of the Dirac equation. Nature 2010, 463: 68–71. 10.1038/nature08688ADSView ArticleGoogle Scholar
  17. Lanyon BP, Hempel C, Nigg D, Müller M, Gerritsma R, Zähringer F, Schindler P, Barreiro JT, Rambach M, Kirchmair G, Hennrich M, Zoller P, Blatt R, Roos CF: Universal digital quantum simulation with trapped ions. Science 2011, 334: 57–61. 10.1126/science.1208001ADSView ArticleGoogle Scholar
  18. Blatt R, Roos CF: Quantum simulations with trapped ions. Nat. Phys. 2012, 8: 277–284. 10.1038/nphys2252View ArticleGoogle Scholar
  19. Lamata L, Mezzacapo A, Casanova J, Solano E: Efficient quantum simulation of fermionic and bosonic models in trapped ions. EPJ Quantum Technol. 2014., 1(1): Article ID 9 Article ID 9Google Scholar
  20. Jaksch D, Zoller P: The cold atom Hubbard toolbox. Ann. Phys. 2005, 315: 52–79. 10.1016/j.aop.2004.09.010MATHADSView ArticleGoogle Scholar
  21. Dalibard J, Gerbier F, Juzeliūnas G, Öhberg P: Colloquium: artificial gauge potentials for neutral atoms. Rev. Mod. Phys. 2011, 83: 1523. 10.1103/RevModPhys.83.1523ADSView ArticleGoogle Scholar
  22. Bloch I, Dalibard J, Nascimbène S: Quantum simulations with ultracold quantum gases. Nat. Phys. 2012, 8: 267–276. 10.1038/nphys2259View ArticleGoogle Scholar
  23. Peng X-H, Zhang J, Du J, Suter D: Quantum simulation of a system with competing two-and three-body interactions. Phys. Rev. Lett. 2009., 103: Article ID 140501 Article ID 140501Google Scholar
  24. Peng X-H, Suter D: Spin qubits for quantum simulations. Front. Phys. China 2010, 5: 1–25.ADSView ArticleGoogle Scholar
  25. Du J, Xu N, Peng X, Wang P, Wu W, Lu D: NMR implementation of a molecular hydrogen quantum simulation with adiabatic state preparation. Phys. Rev. Lett. 2010., 104: Article ID 030502 Article ID 030502Google Scholar
  26. Li Z, Yung MH, Chen H, Lu D, Whitfield JD, Peng X, Aspuru-Guzik A, Du J: Solving quantum ground-state problems with nuclear magnetic resonance. Sci. Rep. 2011., 1: Article ID 88 Article ID 88Google Scholar
  27. Zhang J, Yung MH, Laflamme R, Aspuru-Guzik A, Baugh J: Digital quantum simulation of the statistical mechanics of a frustrated magnet. Nat. Commun. 2011., 3: Article ID 880 Article ID 880Google Scholar
  28. Angelakis DG, Santos MF, Bose S: Photon-blockade-induced Mott transitions and XY spin models in coupled cavity arrays. Phys. Rev. A 2007., 76: Article ID 031805 Article ID 031805Google Scholar
  29. Cho J, Angelakis DG, Bose S: Fractional quantum Hall state in coupled cavities. Phys. Rev. Lett. 2008., 101: Article ID 246809 Article ID 246809Google Scholar
  30. Lu C-Y, Gao W-B, Gühne O, Zhou X-Q, Chen Z-B, Pan J-W: Demonstrating anyonic fractional statistics with a six-qubit quantum simulator. Phys. Rev. Lett. 2009., 102: Article ID 030502 Article ID 030502Google Scholar
  31. Lanyon BP, Whitfield JD, Gillett GG, Goggin ME, Almeida MP, Kassal I, Biamonte JD, Mohseni M, Powell BJ, Barbieri M, Aspuru-Guzik A, White AG: Towards quantum chemistry on a quantum computer. Nat. Chem. 2009, 2: 106–111.View ArticleGoogle Scholar
  32. Peruzzo A, Lobino M, Matthews JC, Matsuda N, Politi A, Poulios K, Zhou X-Q, Lahini Y, Ismail N, Wörhoff K, Bromberg Y, Silberberg Y, Thompson MG, OBrien JL: Quantum walks of correlated photons. Science 2010, 329: 1500–1503. 10.1126/science.1193515ADSView ArticleGoogle Scholar
  33. Aspuru-Guzik A, Walther P: Photonic quantum simulators. Nat. Phys. 2012, 8: 285–291. 10.1038/nphys2253View ArticleGoogle Scholar
  34. Manousakis E: A quantum-dot array as model for copper-oxide superconductors: a dedicated quantum simulator for the many-fermion problem. J. Low Temp. Phys. 2002, 126: 1501–1513. 10.1023/A:1014295416763ADSView ArticleGoogle Scholar
  35. Smirnov AY, Savel’ev S, Mourokh LG, Nori F: Modelling chemical reactions using semiconductor quantum dots. Europhys. Lett. 2007., 80: Article ID 67008 Article ID 67008Google Scholar
  36. Byrnes T, Kim NY, Kusudo K, Yamamoto Y: Quantum simulation of Fermi-Hubbard models in semiconductor quantum-dot arrays. Phys. Rev. B 2008., 78: Article ID 075320 Article ID 075320Google Scholar
  37. You JQ, Nori F: Superconducting circuits and quantum information. Phys. Today 2005, 58: 42–47.View ArticleGoogle Scholar
  38. Clarke J, Wilhelm F: Superconducting quantum bits. Nature 2008, 453: 1031–1042. 10.1038/nature07128ADSView ArticleGoogle Scholar
  39. Houck AA, Türeci HE, Koch J: On-chip quantum simulation with superconducting circuits. Nat. Phys. 2012, 8: 292–299. 10.1038/nphys2251View ArticleGoogle Scholar
  40. Schmidt S, Koch J: Circuit QED lattices: towards quantum simulation with superconducting circuits. Ann. Phys. 2013, 525(6):395–412. 10.1002/andp.201200261View ArticleGoogle Scholar
  41. Mezzacapo A, Lamata L, Filipp S, Solano E: Many-body interactions with tunable-coupling transmon qubits. arXiv:1403.3652.Google Scholar
  42. Mezzacapo A, Las Heras U, Pedernales JS, DiCarlo L, Solano E, Lamata L: Digital quantum Rabi and Dicke models in superconducting circuits. arXiv:1405.5814.Google Scholar
  43. Cai J, Retzker A, Jelezko F, Plenio MB: A large-scale quantum simulator on a diamond surface at room temperature. Nat. Phys. 2013, 9: 168–173. 10.1038/nphys2519View ArticleGoogle Scholar
  44. Wang Y, Dolde F, Biamonte J, Babbush R, Bergholm V, Yang S, Jakobi I, Neumann P, Aspuru-Guzik A, Whitfield JD, Wrachtrup J: Quantum simulation of helium hydride in a solid-state spin register. arXiv:1405.2696.Google Scholar
  45. Kendon VM, Nemoto K, Munro WJ: Quantum analogue computing. Philos. Trans. R. Soc. Lond. A 2010, 368: 3609–3620. 10.1098/rsta.2010.0017MATHMathSciNetADSView ArticleGoogle Scholar
  46. Cirac JI, Zoller P: Goals and opportunities in quantum simulation. Nat. Phys. 2010, 8: 264–266.View ArticleGoogle Scholar
  47. Hauke P, Cucchietti FM, Tagliacozzo L, Deutsch I, Lewenstein M: Can one trust quantum simulators? Rep. Prog. Phys. 2012., 75: Article ID 082401 Article ID 082401Google Scholar
  48. Schaetz T, Monroe CR, Esslinger T: Focus on quantum simulation. New J. Phys. 2013., 15: Article ID 085009 Article ID 085009Google Scholar
  49. Buluta I, Nori F: Quantum simulators. Science 2009, 326: 108–111. 10.1126/science.1177838ADSView ArticleGoogle Scholar
  50. Georgescu IM, Ashhab S, Nori F: Quantum simulation. Rev. Mod. Phys. 2013, 86: 153–185.ADSView ArticleGoogle Scholar
  51. Feynman RP: Simulating physics with computers. Int. J. Theor. Phys. 1982, 21: 467–488. 10.1007/BF02650179MathSciNetView ArticleGoogle Scholar
  52. Lloyd S: Universal quantum simulators. Science 1996, 273: 1073–1077. 10.1126/science.273.5278.1073MATHMathSciNetADSView ArticleGoogle Scholar
  53. Johnson MW, Amin MHS, Gildert S, Lanting T, Hamze F, Dickson N, Harris R, Berkley AJ, Johansson J, Bunyk P, Chapple EM, Enderud C, Hilton JP, Karimi K, Ladizinsky E, Ladizinsky N, Oh T, Perminov I, Rich C, Thom MC, Tolkacheva E, Truncik CJS: Quantum annealing with manufactured spins. Nature 2011, 473: 194–198. 10.1038/nature10012ADSView ArticleGoogle Scholar
  54. Davies PCW: Does quantum mechanics play a non-trivial role in life? Biosystems 2004, 78: 69–79. 10.1016/j.biosystems.2004.07.001View ArticleGoogle Scholar
  55. Abbott D, Gea-Banacloche J, Davies PCW, Hameroff S, Zeilinger A, Eisert J, Wiseman HM, Bezrukov SM, Frauenfelder H: Plenary debate: quantum effects in biology: trivial or not? Fluct. Noise Lett. 2008, 8: C5-C26. 10.1142/S0219477508004301View ArticleGoogle Scholar
  56. Lambert N, Chen YN, Cheng YC, Li CM, Chen GY, Nori F: Quantum biology. Nat. Phys. 2013, 9: 10–18.View ArticleGoogle Scholar
  57. Meznaric S, Clark SR, Datta A: Quantifying the nonclassicality of operations. Phys. Rev. Lett. 2013., 110: Article ID 070502 Article ID 070502Google Scholar
  58. Killoran N, Cramer M, Plenio MB: Extracting entanglement from identical particles. Phys. Rev. Lett. 2014., 112: Article ID 150501 Article ID 150501Google Scholar
  59. Ashcroft NW, Mermin D: Solid State Physics. Holt, Rinehardt and Winston, New York; 1976.Google Scholar
  60. Kirkpatrick S, Gelatt Jr CD, Vecchi MP: Optimization by simulated annealing. Science 1983, 220: 671–680. 10.1126/science.220.4598.671MATHMathSciNetADSView ArticleGoogle Scholar
  61. Farhi E, Gutmann S: Analog analogue of a digital quantum computation. Phys. Rev. A 1998, 57: 2403. 10.1103/PhysRevA.57.2403MathSciNetADSView ArticleGoogle Scholar
  62. Farhi E, Goldstone J, Gutmann S, Sipser M: Quantum computation by adiabatic evolution. arXiv:quant-ph/0001106.Google Scholar
  63. Santoro GE, Tosatti E: Optimization using quantum mechanics: quantum annealing through adiabatic evolution. J. Phys. A, Math. Gen. 2006., 39: Article ID R393 Article ID R393Google Scholar
  64. Das A, Chakrabarti BK: Colloquium: quantum annealing and analog quantum computation. Rev. Mod. Phys. 2008, 80: 1061. 10.1103/RevModPhys.80.1061MATHMathSciNetADSView ArticleGoogle Scholar
  65. Biamonte JD, Bergholm V, Whitfield JD, Fitzsimons J, Aspuru-Guzik A: Adiabatic quantum simulators. AIP Adv. 2011., 1: Article ID 022126 Article ID 022126Google Scholar
  66. Leggett AJ: Bose-Einstein condensation in the alkali gases: some fundamental concepts. Rev. Mod. Phys. 2001, 73: 307. 10.1103/RevModPhys.73.307ADSView ArticleGoogle Scholar
  67. Pitaevskii L, Stringari S: Bose-Einstein Condensation. Clarendon Press, Oxford; 2003.MATHGoogle Scholar
  68. Garay LJ, Anglin JR, Cirac JI, Zoller P: Sonic analog of gravitational black holes in Bose-Einstein condensates. Phys. Rev. Lett. 2000, 85: 4643. 10.1103/PhysRevLett.85.4643ADSView ArticleGoogle Scholar
  69. Fischer UR, Schützhold R: Quantum simulation of cosmic inflation in two-component Bose-Einstein condensates. Phys. Rev. A 2004., 70: Article ID 063615 Article ID 063615Google Scholar
  70. Fedichev PO, Fischer UR: Cosmological quasiparticle production in harmonically trapped superfluid gases. Phys. Rev. A 2004., 69: Article ID 033602 Article ID 033602Google Scholar
  71. Barceló C, Liberati S, Visser M: Analogue gravity. Living Rev. Relativ. 2005., 8: Article ID 12 Article ID 12Google Scholar
  72. Jain P, Weinfurtner S, Visser M, Gardiner CW: Analog model of a Friedmann-Robertson-Walker universe in Bose-Einstein condensates: application of the classical field method. Phys. Rev. A 2007., 76: Article ID 033616 Article ID 033616Google Scholar
  73. Fedichev PO, Fischer UR: Gibbons-Hawking effect in the sonic de Sitter space-time of an expanding Bose-Einstein-condensed gas. Phys. Rev. Lett. 2003., 91: Article ID 240407 Article ID 240407Google Scholar
  74. Fedichev PO, Fischer UR: Observer dependence for the phonon content of the sound field living on the effective curved space-time background of a Bose-Einstein condensate. Phys. Rev. D 2004., 69: Article ID 064021 Article ID 064021Google Scholar
  75. Barahona F: On the computational complexity of Ising spin glass models. J. Phys. A, Math. Gen. 1982, 15: 3241. 10.1088/0305-4470/15/10/028MathSciNetADSView ArticleGoogle Scholar
  76. Bernstein E, Vazirani U: Quantum complexity theory. SIAM J. Comput. 1997, 26: 1411–1473. 10.1137/S0097539796300921MATHMathSciNetView ArticleGoogle Scholar
  77. Anderson PW: The resonating valence bond state in La2CuO4 and superconductivity. Science 1987, 235: 1196–1198. 10.1126/science.235.4793.1196ADSView ArticleGoogle Scholar
  78. Zhang FC, Rice TM: Effective Hamiltonian for the superconducting Cu oxides. Phys. Rev. B 1988, 37: 3759(R). 10.1103/PhysRevB.37.3759ADSView ArticleGoogle Scholar
  79. Anderson PW, Lee PA, Randeria M, Rice TM, Trivedi N, Zhang FC: The physics behind high-temperature superconducting cuprates: the ‘plain vanilla’ version of RVB. J. Phys. Condens. Matter 2004., 16: Article ID R755 Article ID R755Google Scholar
  80. Le Hur K, Rice TM: Superconductivity close to the Mott state: from condensed-matter systems to superfluidity in optical lattices. Ann. Phys. 2009, 324: 1452–1515. 10.1016/j.aop.2009.02.004MATHMathSciNetADSView ArticleGoogle Scholar
  81. Laughlin RB: Gossamer superconductivity. arXiv:cond-mat/0209269.Google Scholar
  82. Leggett AJ: Quantum Liquids. Oxford University Press, Oxford; 2006.View ArticleGoogle Scholar
  83. Laughlin RB: Hartree-Fock computation of the high- T c cuprate phase diagram. Phys. Rev. B 2014., 89: Article ID 035134 Article ID 035134Google Scholar
  84. Ginzburg VL, Andryushin EA: Superconductivity. World Scientific, Singapore; 2004.MATHView ArticleGoogle Scholar
  85. Madsen U, Krogsgaard-Larsen P, Liljefors T: Textbook of Drug Design and Discovery. Taylor and Francis, Washington DC; 2002.Google Scholar
  86. Cohen NC: Guidebook on Molecular Modeling in Drug Design. Academic Press, Boston; 1996.Google Scholar
  87. Zhou T, Huang D, Caflisch A: Quantum mechanical methods for drug design. Current Topics Med. Chem. 2010, 10: 33–45. 10.2174/156802610790232242View ArticleGoogle Scholar
  88. Fausti D, Tobey RI, Dean N, Kaiser S, Dienst A, Hoffmann MC, Pyon S, Takayama T, Takagi H, Cavalleri A: Light-induced superconductivity in a stripe-ordered cuprate. Science 2011, 331: 189–191. 10.1126/science.1197294ADSView ArticleGoogle Scholar
  89. Kaiser S, Nicoletti D, Hunt CR, Hu W, Gierz I, Liu HY, Le Tacon M, Loew T, Haug D, Keimer B, Cavalleri A: Light-induced inhomogeneous superconductivity far above Tc in YBa2Cu3O6+x. arXiv:1205.4661.Google Scholar
  90. Moltenbrey K: American made. Comput. Graph. World 2014, 32(2). Moltenbrey K: American made. Comput. Graph. World 2014, 32(2).Google Scholar
  91. Stanley HE: Introduction to Phase Transitions and Critical Phenomena. Oxford University Press, Oxford; 1971.Google Scholar
  92. Georges A, Kotliar G, Krauth W, Rozenberg MJ: Dynamical mean-field theory of strongly correlated fermion systems and the limit of infinite dimensions. Rev. Mod. Phys. 1996, 68: 13. 10.1103/RevModPhys.68.13MathSciNetADSView ArticleGoogle Scholar
  93. Kotliar G, Savrasov SY, Haule K, Oudovenko VS, Parcollet O, Marianetti CA: Electronic structure calculations with dynamical mean-field theory. Rev. Mod. Phys. 2006, 78: 865–952. 10.1103/RevModPhys.78.865ADSView ArticleGoogle Scholar
  94. Aoki H, Tsuji N, Eckstein M, Kollar M, Oka T, Werner P: Nonequilibrium dynamical mean-field theory and its applications. arXiv:1310.5329.Google Scholar
  95. Verstraete F, Murg V, Cirac JI: Matrix product states, projected entangled pair states, and variational renormalization group methods for quantum spin systems. Adv. Phys. 2008, 57: 143–224. 10.1080/14789940801912366ADSView ArticleGoogle Scholar
  96. Cirac JI, Verstraete F: Renormalization and tensor product states in spin chains and lattices. J. Phys. A 2009., 42: Article ID 504004 Article ID 504004Google Scholar
  97. Johnson TH, Clark SR, Jaksch D: Dynamical simulations of classical stochastic systems using matrix product states. Phys. Rev. E 2010., 82: Article ID 036702 Article ID 036702Google Scholar
  98. Schollwöck U: The density-matrix renormalization group in the age of matrix product states. Ann. Phys. 2011, 326: 96–192. 10.1016/j.aop.2010.09.012MATHADSView ArticleGoogle Scholar
  99. Biamonte JD, Clark SR, Jaksch D: Categorical tensor network states. AIP Adv. 2011., 1: Article ID 042172 Article ID 042172Google Scholar
  100. Evenbly E, Vidal G: Quantum criticality with the multi-scale entanglement renormalization ansatz. In Strongly Correlated Systems: Numerical Methods. Edited by: Avella E, Mancini F. Springer, Heidelberg; 2013:99–130.View ArticleGoogle Scholar
  101. Johnson TH, Biamonte JD, Clark SR, Jaksch D: Solving search problems by strongly simulating quantum circuits. Sci. Rep. 2013., 3: Article ID 1235 Article ID 1235Google Scholar
  102. Orús R: A practical introduction to tensor networks: matrix product states and projected entangled pair states. arXiv:1306.2164.Google Scholar
  103. Hohenberg P, Kohn W: Inhomogeneous electron gas. Phys. Rev. 1964., 136: Article ID B864 Article ID B864Google Scholar
  104. Kohn W, Sham LJ: Self-consistent equations including exchange and correlation effects. Phys. Rev. 1965., 140: Article ID A1133 Article ID A1133Google Scholar
  105. Parr RG: Density functional theory. Annu. Rev. Phys. Chem. 1983, 34: 631–656. 10.1146/annurev.pc.34.100183.003215ADSView ArticleGoogle Scholar
  106. Martin RM: Electronic Structure: Basic Theory and Practical Methods. Cambridge University Press, Cambridge; 2004.View ArticleGoogle Scholar
  107. Burke K, Werschnik J, Gross EKU: Time-dependent density functional theory: past, present, and future. J. Chem. Phys. 2005., 123: Article ID 062206 Article ID 062206Google Scholar
  108. Foulkes WMC, Mitáš L, Needs RJ, Rajagopal G: Quantum Monte Carlo simulations of solids. Rev. Mod. Phys. 2001, 73: 33–83. 10.1103/RevModPhys.73.33ADSView ArticleGoogle Scholar
  109. Gull E, Millis AJ, Lichtenstein AI, Rubtsov AN, Troyer M, Werner P: Continuous-time Monte Carlo methods for quantum impurity models. Rev. Mod. Phys. 2011, 83: 349. 10.1103/RevModPhys.83.349ADSView ArticleGoogle Scholar
  110. Pollet L: Recent developments in quantum Monte Carlo simulations with applications for cold gases. Rep. Prog. Phys. 2012., 75: Article ID 094501 Article ID 094501Google Scholar
  111. Austin BM, Zubarev DY, Lester WA: Quantum Monte Carlo and related approaches. Chem. Rev. 2012, 112: 263–288. 10.1021/cr2001564View ArticleGoogle Scholar
  112. Eisert J, Cramer M, Plenio MB: Colloquium: area laws for the entanglement entropy. Rev. Mod. Phys. 2010, 82: 277. 10.1103/RevModPhys.82.277MATHMathSciNetADSView ArticleGoogle Scholar
  113. Schuch N, Verstraete F: Computational complexity of interacting electrons and fundamental limitations of density functional theory. Nat. Phys. 2009, 5: 732–735. 10.1038/nphys1370View ArticleGoogle Scholar
  114. Loh Jr EY, Gubernatis JE, Scalettar RT, White SR, Scalapino DJ, Sugar RL: Sign problem in the numerical simulation of many-electron systems. Phys. Rev. B 1990, 41: 9301. 10.1103/PhysRevB.41.9301ADSView ArticleGoogle Scholar
  115. Troyer M, Wiese U-J: Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations. Phys. Rev. Lett. 2005., 94: Article ID 170201 Article ID 170201Google Scholar
  116. Trotzky S, Chen Y-A, Flesch A, McCulloch IP, Schollwöck U, Eisert J, Bloch I: Probing the relaxation towards equilibrium in an isolated strongly correlated one-dimensional Bose gas. Nat. Phys. 2012, 8: 325–330. 10.1038/nphys2232View ArticleGoogle Scholar
  117. Yung M-H, Nagaj D, Whitfield JD, Aspuru-Guzik A: Simulation of classical thermal states on a quantum computer: a transfer-matrix approach. Phys. Rev. A 2010., 82: Article ID 060302(R) Article ID 060302(R)Google Scholar
  118. Sinha S, Russer P: Quantum computing algorithm for electromagnetic field simulation. Quantum Inf. Process. 2010, 9: 385–404. 10.1007/s11128-009-0133-xMATHMathSciNetView ArticleGoogle Scholar
  119. Harris SA, Kendon VM: Quantum-assisted biomolecular modelling. Philos. Trans. R. Soc. Lond. A 2010, 368: 3581–3592. 10.1098/rsta.2010.0087ADSView ArticleGoogle Scholar
  120. Boghosian BM, Taylor W IV: Quantum lattice-gas model for the many-particle Schrödinger equation in d dimensions. Phys. Rev. E 1998, 57: 54. 10.1103/PhysRevE.57.54MathSciNetADSView ArticleGoogle Scholar
  121. Meyer DA: Quantum computing classical physics. Philos. Trans. R. Soc. Lond. A 2002, 360: 395–405. 10.1098/rsta.2001.0936MATHADSView ArticleGoogle Scholar
  122. Abrams DS, Lloyd S: Quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors. Phys. Rev. Lett. 1999, 83: 5162–5165. 10.1103/PhysRevLett.83.5162ADSView ArticleGoogle Scholar
  123. Harrow AW, Hassidim A, Lloyd S: Quantum algorithm for linear systems of equations. Phys. Rev. Lett. 2009., 103: Article ID 150502 Article ID 150502Google Scholar
  124. Leibfried D: Could a boom in technologies trap Feynman’s simulator? Nature 2010, 463: 608.ADSView ArticleGoogle Scholar
  125. Popper KR: Science as falsification. In Conjectures and Refutations. Routledge and Keagan Paul, London; 1963:30.Google Scholar
  126. May D, Barrett G, Shepherd D, Hunt WA, Clarke EM: Designing chips that work [and discussion]. Philos. Trans. R. Soc. Lond. A 1992, 339: 3–19. 10.1098/rsta.1992.0022ADSView ArticleGoogle Scholar
  127. Walschaers M, Diaz JF-D-C, Mulet R, Buchleitner A: Optimally designed quantum transport across disordered networks. Phys. Rev. Lett. 2013., 111: Article ID 180601 Article ID 180601Google Scholar

Copyright

© Johnson et al.; licensee Springer on behalf of EPJ. 2014

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.