Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum digital-to-analog conversion algorithm using decoherence

Akira Saitoh

Published Aug 30, 2014• 0 citations
OpenAlex

Abstract

We consider the problem of mapping digital data encoded on a quantum register to analog amplitudes in parallel. It is shown to be unlikely that a fully unitary polynomial-time quantum algorithm exists for this problem; NP becomes a subset of BQP if it exists. In the practical point of view, we propose a nonunitary linear-time algorithm using quantum decoherence. It tacitly uses an exponentially large physical resource, which is typically a huge number of identical molecules. Quantumness of correlation appearing in the process of the algorithm is also discussed.

Related papers

Quantum analog-to-digital and digital-to-analog conversion

Frank Schmüser, Dominik Janzing

An algorithm is proposed which transfers the quantum information of a wave function (analog signal) into a register of qubits (digital signal) such that $n$ qubits describe the amplitudes and phases of ${2}^{n}$ points of a sufficiently smooth wave function. We assume that the continuous degree of freedom couples to one or more qubits of a quantum register via a Jaynes-Cummings Hamiltonian and that we have universal quantum computation capabilities on the register as well as the possibility to perform bang-bang control on the qubits. The transfer of information is mainly based on the application of the quantum phase estimation algorithm in both directions. Here, the running time increases exponentially with the number of qubits. We pose it as an open question which interactions would allow polynomial running time. One example would be interactions which enable squeezing operations.

arXiv:quant-ph/0505008•Physical Review A•Oct 24, 2005•10 citations

Hamiltonian simulation with explicit formulas for Digital-Analog Quantum Computing

Mikel Garcia-de-Andoin, Thorge Müller, Gonzalo Camacho

Digital-analog is a quantum computational paradigm that employs the natural interaction Hamiltonian of a system as the entangling resource, combined with single qubit gates, to implement universal quantum operations. As in the case of its digital gate-based counterpart, designing digital-analog circuits that employ optimal quantum resources often requires an exceedingly large classical computational time. In this work we find a suboptimal solution to this exponentially large problem, showing that it can be solved within polynomial computational time. In particular, we provide an exact solution for the problem of expressing arbitrary two-body Hamiltonians as the sum of local unitary transformations of an arbitrary Ising Hamiltonian, with the total number of required terms being at most quadratic in system size. This allows us to design a digital-analog simulation protocol that avoids employing numerical optimization over a large parameter space at the preprocessing stage, minimizing computational resources and allowing for further scaling.

quant-pharXiv:2511.11404•Physical Review A•Nov 17, 2025•2 citations

Quantum analog-digital conversion

Kosuke Mitarai, Masahiro Kitagawa, Keisuke Fujii

Many quantum algorithms, such as the Harrow-Hassidim-Lloyd (HHL) algorithm, depend on oracles that efficiently encode classical data into a quantum state. The encoding of the data can be categorized into two types: analog encoding, where the data are stored as amplitudes of a state, and digital encoding, where they are stored as qubit strings. The former has been utilized to process classical data in an exponentially large space of a quantum system, whereas the latter is required to perform arithmetics on a quantum computer. Quantum algorithms such as HHL achieve quantum speedups with a sophisticated use of these two encodings. In this work, we present algorithms that convert these two encodings to one another. While quantum digital-to-analog conversions have implicitly been used in existing quantum algorithms, we reformulate it and give a generalized protocol that works probabilistically. On the other hand, we propose a deterministic algorithm that performs a quantum analog-to-digital conversion. These algorithms can be utilized to realize high-level quantum algorithms such as a nonlinear transformation of amplitudes of a quantum state. As an example, we construct a ``quantum amplitude perceptron,'' a quantum version of the neural network that hence has a possible application in the area of quantum machine learning.

arXiv:1805.11250•Physical Review A•Jan 2, 2019•89 citations

Hilbert space computing by analog circuits

László B. Kish

We show that, if time comes when quantum algorithms can be used for universal parallel computation, the "quantum-parallel" computer hardware will most probably be a classical physical system corresponding to a Hilbert space and the actual realization may be the combination of analog and digital circuits. We first point out the practical difficulties of universal quantum computing which may prohibit practical applications as universal computers. Then we show how to apply analog microelectronic circuits to realize the architecture, data processing and parallel computing abilities of quantum computing via Hilbert space computing with analog circuits. Such a Hilbert-space-analog (HSA) computer simulates the Hilbert space and its operators, and it is able to use and test quantum algorithms developed for the real quantum computers. Such a computer would be free of most of the practical difficulties of realizing and running a real quantum computer. This computer can be made universal. It is remarkable that by using the same numbers of transistors as in today's PCs, such a HSA computer can manipulate ~107 analog numbers corresponding to ~22 qubits, simultaneously, by quantum-parallel processing.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 9, 2003•3 citations

Quantum signal processing by single-qubit dynamics

Guang Hao Low

Quantum computation is the most powerful realizable model of computation, and is uniquely positioned to solve specialized problems intractable to classical computers. This quantum advantage arises from directly exploiting the strangeness of quantum mechanics that is fundamental to reality. As such, one expects our understanding of quantum processes in physical systems to be indispensable to the design and execution of quantum algorithms. We present quantum signal processing, which exploits the dynamics of simple quantum systems to perform non-trivial computations. Such systems applied as computational modules in larger quantum algorithms, offer a natural physical alternative to standard tasks such as the calculation of elementary functions with integer arithmetic. The quantum advantage of this approach, based on simple physics, is of significant practical relevance. In cases, arbitrary bits of precision may be emulated using only constant space. Moreover, the simplicity and performance of quantum signal processing is such that it is the final missing ingredient for realizing a number of optimal quantum algorithms, particularly in Hamiltonian simulation. Quantum signal processing realizes a useful fusion of analog and digital models of quantum computation. At the physical level, we focus on how even a simple two-level system - the qubit, computes through optimal discrete-time quantum control. Whereas quantum control is typically used to synthesize unitary quantum gates, we solve the synthesis problem of unitary quantum functions with a fully characterization of achievable functions, and efficient techniques for their implementation. This furnishes a surprisingly rich framework in the analog model of quantum computation for computing functions. The generality of this model is realized by many applications, often with no modification, to quantum algorithms designed for digital quantum computers, in particular for matrix manipulation. In this manner, we solve a number of open problem related to optimal amplitude amplification algorithms, optimally computing on matrices with a quantum computer, and the simulation of physical systems.

•Jan 1, 2017•7 citations

QUANTUM DIGITAL-ANALOGUE COMPUTING

A. Khakhanova, Svetlana V. Chumachenko, Дарія Рахліс +2 more

Context. Nature is the relation among processes and phenomena. Nothing exists in the universe without relations. Computer is transactions of relations between data with the help of control and execution mechanisms. Quantum relations are a superposition of particles and their states. Superposition and entanglement are equivalent concepts. Entanglement is a non-local superposition of deterministic states. A quantum computer is unconditional transactions of relations between qubit data. Quantum computer is an analog device for parallel solution of combinatorial problems. Practically oriented definitions of the quantum computer concepts are the path to development of scalable quantum parallel algorithms for combinatorial problems solving. Any algorithm can be reduced to a sequence of operations without conditions, because any truth table is a collection of a complete system of conditions-states. Any sequence of actions can always be reduced to one parallel operation. Conditions and sequences arise only when the developer wants to use previously created primitive constructs to build an always non-optimal computing unit. The paradigm of quantum computer creation is determined through the use of photonic transactions on the electrons of an atom may exclude the use of quantum logic. The evolutionary path of a quantum computer from the classical one: “memory-address-transaction” (MAT) → “electron-addresstransaction” → “electron-address-quantaction” (EAQ) → state-superposition-logic. The meeting point of classical and quantum computers is photon transactions on the structure of electrons. Everything that is calculated on a quantum computer can be calculated in parallel on a classical one on account of memory redundancy. The given example is a memory-driven algorithm for modeling digital products based on qubit-vector forms of functionality description for significant performance boost of computing processes by parallel execution of logical operations. Objective. Simulation of the correct SoC-component behavior based on vector representation of the logic. Formation of the triggering development of a computing based on the superposition of the classical, quantum and analog computing process, which in its development should be based on technological qubit, tabular and vector data structures for the parallel solution of combinatorial problems. Method. MAT-computing implements any algorithms on account of transactions (read-write) in memory. Qubit-vector models for describing functionalities, which differ from known truth tables in compactness of description and manufacturability for the implementation of parallel algorithms of the synthesis and analysis of digital devices and SoC-components. Results. 1) The metric of the technological data structures, focused on parallel troubleshooting in digital systems based on the usage of two logical vector operations, was proposed for the first time. 2) The metric of relations between the individual components of QC, allowing organizing a quantum deterministic computer, has been further developed. 3) Quantum architectural solutions, that allow solving coverage problems in a quasi-parallel mode, were proposed for the first time. 4) Architectural solutions based on an analog-to-digital computing, which can be used to solve the problems of the digital systems parallel analysis, have been further developed. 5) Vector-qubit structures of the logic data, that allow a quasi-parallel simulation of digital circuits, were proposed. Conclusions. Qubit models, quantum methods and combinatorial algorithms for technical diagnostics of digital devices have been implemented, which can significantly (up to 25%) reduce the time of test synthesis, deductive modeling of faulty and correct behavior, search for defective states by introducing an innovative idea of using qubit-vector data structures for describing logical components. Comparative assessments of qubit models and methods usage show an increase in the efficiency of algorithms for modeling digital devices compared to tabular ones. The superposition of a classical, quantum and analog computer is integrally represented, which allows to find the best solutions for recognition and decision making.

Radio Electronics Computer Science Control•Dec 4, 2022•1 citation
We consider the problem of mapping digital data encoded on a quantum register to analog amplitudes in parallel. It is shown to be unlikely that a fully unitary polynomial-time quantum algorithm exists for this problem; NP becomes a subset of BQP if it exists. In the practical point of view, we propose a nonunitary linear-time algorithm using quantum decoherence. It tacitly uses an exponentially large physical resource, which is typically a huge number of identical molecules. Quantumness of correlation appearing in the process of the algorithm is also discussed.
An algorithm is proposed which transfers the quantum information of a wave function (analog signal) into a register of qubits (digital signal) such that nnn qubits describe the amplitudes and phases of 2n{2}^{n}2n points of a sufficiently smooth wave function. We assume that the continuous degree of freedom couples to one or more qubits of a quantum register via a Jaynes-Cummings Hamiltonian and that we have universal quantum computation capabilities on the register as well as the possibility to perform bang-bang control on the qubits. The transfer of information is mainly based on the application of the quantum phase estimation algorithm in both directions. Here, the running time increases exponentially with the number of qubits. We pose it as an open question which interactions would allow polynomial running time. One example would be interactions which enable squeezing operations.
Digital-analog is a quantum computational paradigm that employs the natural interaction Hamiltonian of a system as the entangling resource, combined with single qubit gates, to implement universal quantum operations. As in the case of its digital gate-based counterpart, designing digital-analog circuits that employ optimal quantum resources often requires an exceedingly large classical computational time. In this work we find a suboptimal solution to this exponentially large problem, showing that it can be solved within polynomial computational time. In particular, we provide an exact solution for the problem of expressing arbitrary two-body Hamiltonians as the sum of local unitary transformations of an arbitrary Ising Hamiltonian, with the total number of required terms being at most quadratic in system size. This allows us to design a digital-analog simulation protocol that avoids employing numerical optimization over a large parameter space at the preprocessing stage, minimizing computational resources and allowing for further scaling.
Many quantum algorithms, such as the Harrow-Hassidim-Lloyd (HHL) algorithm, depend on oracles that efficiently encode classical data into a quantum state. The encoding of the data can be categorized into two types: analog encoding, where the data are stored as amplitudes of a state, and digital encoding, where they are stored as qubit strings. The former has been utilized to process classical data in an exponentially large space of a quantum system, whereas the latter is required to perform arithmetics on a quantum computer. Quantum algorithms such as HHL achieve quantum speedups with a sophisticated use of these two encodings. In this work, we present algorithms that convert these two encodings to one another. While quantum digital-to-analog conversions have implicitly been used in existing quantum algorithms, we reformulate it and give a generalized protocol that works probabilistically. On the other hand, we propose a deterministic algorithm that performs a quantum analog-to-digital conversion. These algorithms can be utilized to realize high-level quantum algorithms such as a nonlinear transformation of amplitudes of a quantum state. As an example, we construct a ``quantum amplitude perceptron,'' a quantum version of the neural network that hence has a possible application in the area of quantum machine learning.
We show that, if time comes when quantum algorithms can be used for universal parallel computation, the "quantum-parallel" computer hardware will most probably be a classical physical system corresponding to a Hilbert space and the actual realization may be the combination of analog and digital circuits. We first point out the practical difficulties of universal quantum computing which may prohibit practical applications as universal computers. Then we show how to apply analog microelectronic circuits to realize the architecture, data processing and parallel computing abilities of quantum computing via Hilbert space computing with analog circuits. Such a Hilbert-space-analog (HSA) computer simulates the Hilbert space and its operators, and it is able to use and test quantum algorithms developed for the real quantum computers. Such a computer would be free of most of the practical difficulties of realizing and running a real quantum computer. This computer can be made universal. It is remarkable that by using the same numbers of transistors as in today's PCs, such a HSA computer can manipulate ~107 analog numbers corresponding to ~22 qubits, simultaneously, by quantum-parallel processing.
Quantum computation is the most powerful realizable model of computation, and is uniquely positioned to solve specialized problems intractable to classical computers. This quantum advantage arises from directly exploiting the strangeness of quantum mechanics that is fundamental to reality. As such, one expects our understanding of quantum processes in physical systems to be indispensable to the design and execution of quantum algorithms. We present quantum signal processing, which exploits the dynamics of simple quantum systems to perform non-trivial computations. Such systems applied as computational modules in larger quantum algorithms, offer a natural physical alternative to standard tasks such as the calculation of elementary functions with integer arithmetic. The quantum advantage of this approach, based on simple physics, is of significant practical relevance. In cases, arbitrary bits of precision may be emulated using only constant space. Moreover, the simplicity and performance of quantum signal processing is such that it is the final missing ingredient for realizing a number of optimal quantum algorithms, particularly in Hamiltonian simulation. Quantum signal processing realizes a useful fusion of analog and digital models of quantum computation. At the physical level, we focus on how even a simple two-level system - the qubit, computes through optimal discrete-time quantum control. Whereas quantum control is typically used to synthesize unitary quantum gates, we solve the synthesis problem of unitary quantum functions with a fully characterization of achievable functions, and efficient techniques for their implementation. This furnishes a surprisingly rich framework in the analog model of quantum computation for computing functions. The generality of this model is realized by many applications, often with no modification, to quantum algorithms designed for digital quantum computers, in particular for matrix manipulation. In this manner, we solve a number of open problem related to optimal amplitude amplification algorithms, optimally computing on matrices with a quantum computer, and the simulation of physical systems.
Context. Nature is the relation among processes and phenomena. Nothing exists in the universe without relations. Computer is transactions of relations between data with the help of control and execution mechanisms. Quantum relations are a superposition of particles and their states. Superposition and entanglement are equivalent concepts. Entanglement is a non-local superposition of deterministic states. A quantum computer is unconditional transactions of relations between qubit data. Quantum computer is an analog device for parallel solution of combinatorial problems. Practically oriented definitions of the quantum computer concepts are the path to development of scalable quantum parallel algorithms for combinatorial problems solving. Any algorithm can be reduced to a sequence of operations without conditions, because any truth table is a collection of a complete system of conditions-states. Any sequence of actions can always be reduced to one parallel operation. Conditions and sequences arise only when the developer wants to use previously created primitive constructs to build an always non-optimal computing unit. The paradigm of quantum computer creation is determined through the use of photonic transactions on the electrons of an atom may exclude the use of quantum logic. The evolutionary path of a quantum computer from the classical one: “memory-address-transaction” (MAT) → “electron-addresstransaction” → “electron-address-quantaction” (EAQ) → state-superposition-logic. The meeting point of classical and quantum computers is photon transactions on the structure of electrons. Everything that is calculated on a quantum computer can be calculated in parallel on a classical one on account of memory redundancy. The given example is a memory-driven algorithm for modeling digital products based on qubit-vector forms of functionality description for significant performance boost of computing processes by parallel execution of logical operations. Objective. Simulation of the correct SoC-component behavior based on vector representation of the logic. Formation of the triggering development of a computing based on the superposition of the classical, quantum and analog computing process, which in its development should be based on technological qubit, tabular and vector data structures for the parallel solution of combinatorial problems. Method. MAT-computing implements any algorithms on account of transactions (read-write) in memory. Qubit-vector models for describing functionalities, which differ from known truth tables in compactness of description and manufacturability for the implementation of parallel algorithms of the synthesis and analysis of digital devices and SoC-components. Results. 1) The metric of the technological data structures, focused on parallel troubleshooting in digital systems based on the usage of two logical vector operations, was proposed for the first time. 2) The metric of relations between the individual components of QC, allowing organizing a quantum deterministic computer, has been further developed. 3) Quantum architectural solutions, that allow solving coverage problems in a quasi-parallel mode, were proposed for the first time. 4) Architectural solutions based on an analog-to-digital computing, which can be used to solve the problems of the digital systems parallel analysis, have been further developed. 5) Vector-qubit structures of the logic data, that allow a quasi-parallel simulation of digital circuits, were proposed. Conclusions. Qubit models, quantum methods and combinatorial algorithms for technical diagnostics of digital devices have been implemented, which can significantly (up to 25%) reduce the time of test synthesis, deductive modeling of faulty and correct behavior, search for defective states by introducing an innovative idea of using qubit-vector data structures for describing logical components. Comparative assessments of qubit models and methods usage show an increase in the efficiency of algorithms for modeling digital devices compared to tabular ones. The superposition of a classical, quantum and analog computer is integrally represented, which allows to find the best solutions for recognition and decision making.