Quantum analogue computing
Open accessAbstract
We briefly review what a quantum computer is, what it promises to do for us and why it is so hard to build one. Among the first applications anticipated to bear fruit is the quantum simulation of quantum systems. While most quantum computation is an extension of classical digital computation, quantum simulation differs fundamentally in how the data are encoded in the quantum computer. To perform a quantum simulation, the Hilbert space of the system to be simulated is mapped directly onto the Hilbert space of the (logical) qubits in the quantum computer. This type of direct correspondence is how data are encoded in a classical analogue computer. There is no binary encoding, and increasing precision becomes exponentially costly: an extra bit of precision doubles the size of the computer. This has important consequences for both the precision and error-correction requirements of quantum simulation, and significant open questions remain about its practicality. It also means that the quantum version of analogue computers, continuous-variable quantum computers, becomes an equally efficient architecture for quantum simulation. Lessons from past use of classical analogue computers can help us to build better quantum simulators in future.
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Errors in an analog device can propagate and multiply uncontrollably.
“However, errors in an analog device (also continuous, like temperature in the initial state, or the signal-to-noise ratio of measurement) can propagate and multiply uncontrollably [58].”
From Can one trust quantum simulators? (2012) · cites this paper as [58]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472 · see citing works
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691 · see citing works
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479 · cited 1× · see citing works
“Spurred on by the seminal work of Shor (1995), Laflamme et al. (1996), Steane (1996), who showed how quantum error correction can be used to protect quantum systems from decoherence for long enough to run a computation, the growth in research has been phenomenal on both theoretical and experimental…”
BackgroundQuantum information with continuous variables
Braunstein, S. L., & van Loock, P. (2005) · Reviews of Modern Physics · doi:10.1103/revmodphys.77.513 · Cited by 3,858 · see citing works
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 2× · see citing works
“Shannon (1941) provided a theoretical model, the General Purpose Analogue Computer (GPAC), which is a mathematical description of the differential analyser. The GPAC consists of a set of nonlinear boxes, connected by their inputs and outputs. Four basic operations are sufficient, shown in figure 3. There are a few rul…”
BackgroundWigner, E. P. (1960) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.3160130102 · Cited by 1,499 · cited 2× · see citing works
“This is part of the way our world appears to be, described as the “unreasonable effectiveness of mathematics” by Wigner (1960).”
BackgroundQuantum Computation Over Continuous Variables
Lloyd, S., & Braunstein, S. L. (1999) · Physical Review Letters · doi:10.1103/physrevlett.82.1784 · Cited by 1,145 · cited 3× · see citing works
“…position and momentum operators ˆ x and ˆ p , and we can generate any Hermitian polynomial in ˆ x and ˆ p by using the following set of operators (Lloyd and Braunstein 1999): 1. simple linear operations, {± ˆ x, ± ˆ p } , and quadratic, e.g., ˆ x 2 + ˆ p 2 , 2. a non-linear operation at least…”
MethodInfluentialPerfect Quantum Error Correcting Code
Laflamme, R., Miquel, C., Paz, J. P., & Zurek, W. H. (1996) · Physical Review Letters · doi:10.1103/physrevlett.77.198 · Cited by 966 · see citing works
QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
AMBAINIS, A. (2003) · International Journal of Quantum Information · doi:10.1142/s0219749903000383 · Cited by 632 · cited 1× · see citing works
“Promise problems, like Deutsch & Jozsa (1992), hidden subgroup problems, like Shor (1997) for factoring, search algorithms like Grover (1996), and quantum versions of random walks (see Ambainis (2003) for a review and Kendon (2006) for a gentle introduction).”
BackgroundVerstraete, F., Porras, D., & Cirac, J. I. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.227205 · Cited by 564 · cited 2× · see citing works
“This can be solved by using the efficient storage achieved by quantum computers.”
MethodQuantum Computation by Adiabatic Evolution
Farhi, E., Goldstone, J., Gutmann, S., & Sipser, M. (2000) · arXiv · doi:10.48550/arxiv.quant-ph/0001106 · Cited by 536 · see citing works
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation
Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., & Regev, O. (2007) · SIAM Journal on Computing · doi:10.1137/s0097539705447323 · Cited by 457 · see citing works
Efficient Classical Simulation of Continuous Variable Quantum Information Processes
Bartlett, S. D., Sanders, B. C., Braunstein, S. L., & Nemoto, K. (2002) · Physical Review Letters · doi:10.1103/physrevlett.88.097904 · Cited by 425 · cited 1× · see citing works
“The nonlinear operation in our CVQC will evolve the state into something that is no longer a Gaussian state: if it didn’t, the whole computation would be efficiently classically simulatable (Bartlett et al. 2002).”
BackgroundSelf-citationFactorization of a 768-Bit RSA Modulus
Kleinjung, T., Aoki, K., Franke, J., Lenstra, A. K., Thomé, E., Bos, J. W., Gaudry, P., Kruppa, A., Montgomery, P. L., Osvik, D. A., et al. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_18 · Cited by 423 · see citing works
Simulating physical phenomena by quantum networks
Somma, R. D., Ortíz, G., Gubernatis, J. E., Knill, E. H., & Laflamme, R. (2002) · Physical Review A · doi:10.1103/physreva.65.042323 · Cited by 364 · cited 2× · see citing works
“Article submitted to Royal Society TEX Paper”
MethodNo-Go Theorem for Gaussian Quantum Error Correction
Niset, J., Fiurášek, J., & Cerf, N. J. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.120501 · Cited by 327 · see citing works
Mathematical Theory of the Differential Analyzer
Shannon, C. E. (1941) · Studies in Applied Mathematics · doi:10.1002/sapm1941201337 · Cited by 243 · cited 2× · see citing works
“It is a quarter of a century since the seminal work of Feynman (1982) and Deutsch (1985) introduced the concept of quantum computation, and 15 years since Shor (1997) produced an efficient quantum algorithm for factoring large numbers, thereby raising the game for cryptographic schemes by suggesting that a quantum com…”
BackgroundMassively parallel quantum computer simulator
Raedt, K. D., Michielsen, K. F. L., Raedt, H. A. D., Trieu, B., Arnold, G., Richter, M., Lippert, T., Watanabe, H., & Ito, N. (2006) · Computer Physics Communications · doi:10.1016/j.cpc.2006.08.007 · Cited by 213 · cited 1× · see citing works
“The record set by De Raedt et al. (2007) is N = 36 in 1Terabyte of memory.”
Pour‐El, M. B. (1974) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1974-0347575-8 · Cited by 208 · see citing works
Quantum Simulations on a Quantum Computer
Somaroo, S., Tseng, C. H., Havel, T. F., Laflamme, R., & Cory, D. G. (1999) · Physical Review Letters · doi:10.1103/physrevlett.82.5381 · Cited by 180 · see citing works
Quantum error correction beyond qubits
Aoki, T., Takahashi, G., Kajiya, T., Yoshikawa, J.-I., Braunstein, S. L., van Loock, P., & Furusawa, A. (2009) · Nature Physics · doi:10.1038/nphys1309 · Cited by 144 · see citing works
Rubel, L. A. (1993) · Advances in Applied Mathematics · doi:10.1006/aama.1993.1003 · Cited by 114 · cited 2× · see citing works
“in university science departments before digital computers became widespread. There have been a number of suggestions for how to expand the model by adding more operations to the available set e.g., Rubel (1993), Graca (2004), Mills (2008). These are mathematical extensions and it isn’t clear whether they can be physi…”
BackgroundA random walk approach to quantum algorithms
Kendon, V. M. (2006) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2006.1901 · Cited by 111 · see citing works
Self-citationPolynomial-Time Simulation of Pairing Models on a Quantum Computer
Wu, L.-A., Byrd, M., & Lidar, D. A. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.057904 · Cited by 106 · see citing works
7 dB quadrature squeezing at 860nm with periodically poled KTiOPO4
Suzuki, S., Yonezawa, H., Kannari, F., Sasaki, M., & Furusawa, A. (2006) · Applied Physics Letters · doi:10.1063/1.2335806 · Cited by 101 · cited 1× · see citing works
“Suzuki et al. (2006) have achieved 7dB of squeezing in optical experiments.”
BackgroundBrown, K. R., Clark, R. J., & Chuang, I. L. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.050504 · Cited by 98 · cited 1× · see citing works
“This raises the prospect of crippling error correction requirements for practical quantum simulators (Brown et al. 2006).”
BackgroundThe nature of the Extended Analog Computer
Mills, J. W. (2008) · Physica D Nonlinear Phenomena · doi:10.1016/j.physd.2008.03.041 · Cited by 98 · see citing works
Digital simulation of analog computation and Church's thesis
Rubel, L. A. (1989) · Journal of Symbolic Logic · doi:10.2307/2274761 · Cited by 79 · cited 1× · see citing works
“While Rubel (1989) proved that a classical digital computer can efficiently simulate an analogue computer, the reverse question of whether an analogue computer can simulate a digital computer efficiently is open.”
BackgroundPhotonic module: An on-demand resource for photonic entanglement
Devitt, S. J., Greentree, A. D., Ionicioiu, R., O’Brien, J. L., Munro, W. J., & Hollenberg, L. C. L. (2007) · Physical Review A · doi:10.1103/physreva.76.052312 · Cited by 73 · see citing works
Self-citationA universal differential equation
Rubel, L. A. (1981) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-1981-14910-7 · Cited by 64 · cited 2× · see citing works
“Rubel (1981) observed that there are simple differential equations that are universal in the sense that they can approximate any other differential equation to arbitrary accuracy.”
BackgroundSome recent developments on Shannon's General Purpose Analog Computer
Graça, D. S. (2004) · Mathematical logic quarterly · doi:10.1002/malq.200310113 · Cited by 57 · cited 1× · see citing works
“There have been a number of suggestions for how to expand the model by adding more operations to the available set e.g., Rubel (1993), Graca (2004), Mills (2008).”
BackgroundQuantum-assisted biomolecular modelling
Harris, S. A., & Kendon, V. M. (2010) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2010.0087 · Cited by 22 · cited 1× · see citing works
“More discussion of simulating complex classical systems, and how to apply quantum computers to this task, can be found in Harris and Kendon (2010), here we are specifically interested in simulating quantum systems.”
BackgroundSelf-citationThe idiots guide to Quantum Error CorrectionPreprint
Devitt, S. J., Nemoto, K., & Munro, W. J. (2009) · arXiv (Cornell University) · Cited by 7 · see citing works
Self-citation
Flagged first, then by citations
Research works printed but not linked: 9
- Ambainis, A., 2004. Quantum walk algorithms for element distinctness. In: 45th Annual IEEE Symposium on Foundations of Computer Science, Oct 17-19, 2004. IEEE Computer Society Press, Los Alamitos, CA, pp. 22-31.
- Deutsch, D., 1985. Quantum-theory, the Church-Turing principle and the universal quantum computer. Proc. R. Soc. Lond. A 400 (1818), 97-117.
- Deutsch, D., Jozsa, R., 1992. Rapid solutions of problems by quantum computation. Proc. Roy. Soc. Lon. A 439, 553.
- Grover, L. K., 1996. A fast quantum mechanical algorithm for database search. In: Proc. 28th Annual ACM STOC. ACM, NY, p. 212, arXiv:quant-ph/9605043. · arXiv
- Lipshitz, L., Rubel, L. A., 1981. A differentially algebraic replacement theorem, and analog computability. Proc. Amer. Math. Soc. 99, 367-372.
- Pour-El, M., 1978. Abstract computability and its relation to the general purpose analog computer, etc. Trans. Amer. Math. Soc. 199, 1-28.
- Steane, A., 1996. Multiple particle interference and quantum error correction. Proc. Roy. Soc. Lond. A 452, 2551, arXiv:quant-ph/9601029. · arXiv
- Thomson, W., 1876. Mechanical integration of the general linear differential equation of any order with variable coeffcients. Proc. Roy. Soc. 24, 271-275.
- Wigner, E., 1960. The unreasonable effectiveness of mathematics in the natural sciences. Communications on Pure and Applied Maths. 13 (1), 1-14.
Cited by
Sorted by citations
Quantum information processing with superconducting circuits: a review
Wendin, G. P. (2017) · Reports on Progress in Physics · doi:10.1088/1361-6633/aa7e1a · Cited by 970 · see citing works
“batic quantum simulation In analogue quantum simulation (AQS) one induces the time evolution of a qubit register by application of a sequence of time-dependent external elds and internal interactions [50,410]. AQS has so far been implemented experimentally in ion traps [411{413], ultracold atoms in optical lattices [4…”
MethodProgrammable quantum simulations of spin systems with trapped ions
Monroe, C. R., Campbell, W. C., Duan, L.-M., Gong, Z., Gorshkov, A. V., Hess, P., Islam, R., Kim, K., Linke, N. M., Pagano, G., et al. (2021) · Reviews of Modern Physics · doi:10.1103/revmodphys.93.025001 · Cited by 807 · see citing works
“Since the cost of introducing currently known methods for fault-tolerance is too high for precision DQS (Kendon et al., 2010), other methods for verifying non-fault-tolerant-DQS are needed.”
MethodProgrammable Quantum Simulations of Spin Systems with Trapped Ions
Monroe, C., Campbell, W. C., Duan, L. M., Gong, Z. X., Gorshkov, A. V., Hess, P., Islam, R., Kim, K., Linke, N., Pagano, G., et al. (2019) · arXiv · doi:10.48550/arxiv.1912.07845 · Cited by 806
Can one trust quantum simulators?
Hauke, P., Cucchietti, F. M., Tagliacozzo, L., Deutsch, I., & Lewenstein, M. (2012) · Reports on Progress in Physics · doi:10.1088/0034-4885/75/8/082401 · Cited by 315 · see citing works
Johnson, T. H., Clark, S. R., & Jaksch, D. (2014) · EPJ Quantum Technology · doi:10.1140/epjqt10 · Cited by 127 · see citing works
Using Quantum Computers for Quantum Simulation
Brown, K. L., Munro, W. J., & Kendon, V. M. (2010) · Entropy · doi:10.3390/e12112268 · Cited by 129 · see citing works
“[15], is that”
Self-citationWittek, P. (2014) · Elsevier eBooks · doi:10.1016/b978-0-12-800953-6.00004-9 · Cited by 98 · see citing works
Using quantum computers for quantum simulation
Brown, K. L., Munro, W. J., & Kendon, V. M. (2015) · Cited by 79 · see citing works
Self-citationQuantum machine learning algorithms for anomaly detection: A review
Corli, S., Moro, L., Dragoni, D., Dispenza, M., & Prati, E. (2024) · Future Generation Computer Systems · doi:10.1016/j.future.2024.107632 · Cited by 73 · see citing works
General implementation of arbitrary nonlinear quadrature phase gates
Marek, P., Filip, R., Ogawa, H., Sakaguchi, A., Takeda, S., Yoshikawa, J., & Furusawa, A. (2018) · Physical Review A · doi:10.1103/physreva.97.022329 · Cited by 59 · see citing works
“They cannot, however, provide the nonlinear non-Gaussian dynamics which is necessary for accessing the full quantum analog simulation [4] and computation [3].”
Towards the quantum-enabled technologies for development of drugs or delivery systems
Hassanzadeh, P. (2020) · Journal of Controlled Release · doi:10.1016/j.jconrel.2020.04.050 · Cited by 42 · see citing works
Chaos-assisted tunneling resonances in a synthetic Floquet superlattice
Arnal, M., Chatelain, G., Martinez, M., Dupont, N., Giraud, O., Ullmo, D., Georgeot, B., Lemarié, G., Billy, J., & Guéry-Odelin, D. (2020) · Science Advances · doi:10.1126/sciadv.abc4886 · Cited by 33 · see citing works
“H = p 2 2 − (1 + cos (t)) cos (x + φ(t)) (1)”
Computer Simulations and Computational Models in Science
Imbert, C. (2017) · Springer eBooks · doi:10.1007/978-3-319-30526-4_34 · Cited by 29 · see citing works
Quantum optics and frontiers of physics: the third quantum revolution
Celi, A., Sanpera, A., Ahufinger, V., & Lewenstein, M. (2016) · Physica Scripta · doi:10.1088/1402-4896/92/1/013003 · Cited by 23 · see citing works
Quantum-assisted biomolecular modelling
Harris, S. A., & Kendon, V. M. (2010) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2010.0087 · Cited by 22 · see citing works
“For more detailed discussion, see Kendon et al. (2010).”
Self-citationUsing analog computers in today's largest computational challenges
Köppel, S., Ulmann, B., Heimann, L., & Killat, D. (2021) · Advances in radio science · doi:10.5194/ars-19-105-2021 · Cited by 17 · see citing works
“, 2017; Ziegler, 2020) or quantum computing (Zhou et al., 2020; Georgescu et al., 2014; Kendon et al., 2010) are fields of active investigation.”
BackgroundA Review on Quantum Machine Learning in Applied Systems and Engineering
Hong, Y.-Y., & Lopez, D. J. D. (2025) · IEEE Access · doi:10.1109/access.2025.3599147 · Cited by 16 · see citing works
Decentralized Global Optimization Based on a Growth Transform Dynamical System Model
Chatterjee, O., & Chakrabartty, S. (2018) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2018.2817367 · Cited by 16 · see citing works
The Road to Quantum Computational Supremacy
Calude, C. S., & Calude, E. (2020) · Springer proceedings in mathematics & statistics · doi:10.1007/978-3-030-36568-4_22 · Cited by 20 · see citing works
“The quantum version of analogue computers, continuous-variable quantum computers, have been theoretically studied [54]; the model in [86] offers a universal gate set for both qubits and continuous variables.”
BackgroundAnalog quantum computing (AQC) and the need for time-symmetric physics
Werbos, P. J., & Dolmatova, L. (2015) · Quantum Information Processing · doi:10.1007/s11128-015-1146-2 · Cited by 15 · see citing works
“but the MRF models embodying time-symmetric physics [4,25] predict:”
BackgroundQubit-mediated deterministic nonlinear gates for quantum oscillators
Ki-min Park, B., Marek, P., & Filip, R. (2017) · Scientific Reports · doi:10.1038/s41598-017-11353-3 · Cited by 13 · see citing works
“With help of (6) we can now always lower bound the success probability and the fidelity by PS, F > 1 − ε − ε2, and we can again find R and ′ mmax such that the joint error ε + ε2 is made arbitrarily small.”
BackgroundLino, J. B. D. R., da Rocha, E. P., & Ramalho, T. C. (2017) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.6b12728 · Cited by 14 · see citing works
Hybrid quantum computing with ancillas
Proctor, T. J., & Kendon, V. M. (2016) · Contemporary Physics · doi:10.1080/00107514.2016.1152700 · Cited by 9 · see citing works
Self-citationBenchmarking quantum computers: towards a standard performance evaluation approach
Acuaviva, A., Aguirre, D., Peña, R., & Sanz, M. (2026) · Quantum Science and Technology · doi:10.1088/2058-9565/ae4269 · Cited by 16 · see citing works
“Other proposal more aligned with the intent of distinguishing between different terms have been presented [95].”
Clustering bike sharing stations using Quantum Machine Learning: A case study of Toronto, Canada
Nourbakhshrezaei, A., Jadidi, M., & Shahriari, K. (2024) · Transportation Research Interdisciplinary Perspectives · doi:10.1016/j.trip.2024.101201 · Cited by 9 · see citing works
Maksimovic, M., & Maksymov, I. S. (2025) · Technologies · doi:10.3390/technologies13050183 · Cited by 12 · see citing works
Quantum Simulations with Circuit Quantum Electrodynamics
Romero, G., Solano, E., & Lamata, L. (2017) · Quantum science and technology · doi:10.1007/978-3-319-52025-4_7 · Cited by 8 · see citing works
A Survey of Analog Computing for Domain-Specific Accelerators
Belostotski, L., Uddin, A., Madanayake, A., & Mandal, S. (2025) · Electronics · doi:10.3390/electronics14163159 · Cited by 7 · see citing works
Quasicontinuous-Variable Quantum Computation with Collective Spins in Multipath Interferometers
Opatrný, T. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.010502 · Cited by 8 · see citing works
Zuniga-Hansen, N., Chi, Y.-C., & Byrd, M. (2012) · Physical Review A · doi:10.1103/physreva.86.042335 · Cited by 7 · see citing works
Advances in 2D heterostructures for quantum computing applications: A review
Islam, A., Khan, S., Mim, J. J., Akter, M. F., Islam, S., Oliullah, S., & Hossain, N. (2025) · Inorganic Chemistry Communications · doi:10.1016/j.inoche.2025.113980 · Cited by 5 · see citing works
Unifying framework for quantum simulation algorithms for time-dependent Hamiltonian dynamics
Cao, Y. H., Jin, S., & Liu, N. (2025) · Physical Review Research · doi:10.1103/fkh5-b669 · Cited by 4 · see citing works
“When the Hamiltonian itself is inherently defined for qumodes (namely, continuous-variable quantum state), the most straightforward way is to adopt analog quantum computing [32, 33, 70] to realize the Hamiltonian simulation.”
Quantum simulations of complex systems
Morsch, O., Palma, G. M., & Rossini, D. (2025) · Rivista Del Nuovo Cimento · doi:10.1007/s40766-025-00069-0 · Cited by 2 · see citing works
Consciousness and Neuronal Microtubules: The Penrose-Hameroff Quantum Model in Retrospect
Frixione, E. (2014) · History, philosophy and theory of the life sciences · doi:10.1007/978-94-017-8774-1_16 · Cited by 2 · see citing works
Sati, H., & Schreiber, U. (2025) · Quantum Studies Mathematics and Foundations · doi:10.1007/s40509-025-00368-5 · Cited by 6 · see citing works
(2014) · Elsevier eBooks · doi:10.1016/b978-0-12-800953-6.00020-7 · Cited by 2 · see citing works
Neural networks with quantum states of light
Labay-Mora, A., García‐Beni, J., Giorgi, G. L., Soriano, M. C., & Zambrini, R. (2024) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2023.0346 · Cited by 1 · see citing works
“Complex quantum states emerge naturally in quantum computation and simulations both in circuit and analogue implementations [48–50].”
Nonexotic-exotic bipartite mode entanglements of an SU(3) baryon
Xia, Z.-T. (2019) · Nuclear Physics A · doi:10.1016/j.nuclphysa.2019.06.001 · Cited by 1 · see citing works
Visions of the future for the Royal Society’s 350th anniversary year
Pepper, M. (2010) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2010.0131
“The emerging technology of quantum information is covered by the article ‘Quantum analogue computing’ (Kendon et al. 2010), which illustrates how the quantum version of an analogue computer can offer certain advantages in terms of speed and capacity compared with the more generally studied digital version.”
BackgroundDigital quantum simulator in the presence of a bath
Zheng, Y.-C., & Ng, H. K. (2017) · Physical Review A · doi:10.1103/physreva.96.042329
Caliva, V., & Fuks, J. I. (2024) · Journal of Physics Materials · doi:10.1088/2515-7639/ad63cb
“An analogue quantum computer is a controllable quantum system able to simulate the behavior of another, more challenging (less controllable, larger, more complex) quantum system [18–20].”
Huang, H.-W., Yang, S.-L., Huang, C.-C., Chen, Y.-N., & Chen, H.-B. (2026) · Scientific Reports · doi:10.1038/s41598-026-66035-w
- Authors
- Kendon, V. M., Nemoto, K., & Munro, W. J.
- Affiliations
- University of Leeds (GB)
- National Institute of Informatics (JP)
- Corresponding author
- Kendon, Vivien M.
- Venue
- Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
- Publisher
- The Royal Society
- Published
- 2010-08-13
- Volume
- 368
- Issue
- 1924
- Pages
- 3609-3620
- ISSN
- 1364-503X (ISSN-L)
- 1471-2962
- OpenAlex
- W2086022424
- Cited by
- 41
- References
- 33
- Citations by year
- 2026: 2 · 2025: 7 · 2024: 4 · 2021: 2 · 2020: 3 · 2019: 1 · 2018: 2 · 2017: 7 · 2016: 2 · 2015: 2 · 2014: 4 · 2012: 2
- FWCI
- 1.69
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- quantum simulation, continuous-variable quantum computing, qubit encoding, error correction, precision scaling, quantum computing architecture
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
