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

Springer eBooks

Quantum-Driven Computing

Vladimir I. Hahanov, Svetlana V. Chumachenko, Hanna Khakhanova

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.1007/978-3-032-07001-2_15

Related papers

Quantum memory-driven computing for test synthesis

Vladimir I. Hahanov, Wajeb Gharibi, Eugenia I. Litvinova +2 more

Memory-driven computing for the design and test of digital devices is considered. One of the possible solutions to the problem of design and test theory and methods of quantum memory-driven computing on the classical computers for their subsequent application in all fields of human activity is proposed. Engineering-focused definitions of computing types are presented, including quantum one, which leverages the superposition and entanglement notions, and also memory-driven computing. The necessity of joint and parallel solving the problem of the creation of a market-accessible quantum computer and development of quantum-focused applications and cloud services is explained. Examples of quantum memory-driven design and test of digital circuit fragments are presented. A method for synthesis and minimization test for the black-box functionality, based on a qubit derivative matrix and sequencer for searching a quasioptimum coverage, is proposed.

IEEE East-West Design & Test Symposium (EWDTS)•Sep 1, 2017•14 citations

Quantum computing

International Symposium on Advanced Computing and Communication (ISACC)•Sep 1, 2015•0 citations

Ancilla-driven blind quantum computation for clients with different quantum capabilities

Qunfeng Dai, Junyu Quan, Xiaoping Lou +1 more

Abstract Blind quantum computation (BQC) allows a client with limited quantum power to delegate his quantum computational task to a powerful server and still keep his input, output, and algorithm private. There are mainly two kinds of models about BQC, namely circuit-based and measurement-based models. In addition, a hybrid model called ancilla-driven universal blind quantum computation (ADBQC) was proposed by combining the properties of both circuit-based and measurement-based models, where all unitary operations on the register qubits can be realized with the aid of single ancilla coupled to the register qubits. However, in the ADBQC model, the quantum capability of the client is strictly limited to preparing single qubits. If a client can only perform single-qubit measurements or a few simple quantum gates, he will not be able to perform ADBQC. This paper solves the problem and extends the existing model by proposing two types of ADBQC protocols for clients with different quantum capabilities, such as performing single-qubit measurements or single-qubit gates. Furthermore, in the two proposed ADBQC protocols, clients can detect whether servers are honest or not with a high probability by using corresponding verifiable techniques.

arXiv:2210.09878•EPJ Quantum Technology•May 23, 2023•5 citations

Quantum Computing

Wasim Ahmed Khan, Volkan Esat, Muhammad Hammad +3 more

Springer series in advanced manufacturing•Jan 1, 2025•4 citations

Twisted Graph States for Ancilla-driven Universal Quantum Computation

Elham Kashefi, Daniel K. L. Oi, Dan E. Browne +2 more

We introduce a new paradigm for quantum computing called Ancilla-Driven Quantum Computation (ADQC) which combines aspects both of the quantum circuit [D. Deutsch. Quantum computational networks. Proc. Roy. Soc. Lond A, 425, 1989] and the one-way model [R. Raussendorf and H. J. Briegel. A one-way quantum computer. Physical Review Letters, 86, 2001] to overcome challenging issues in building large-scale quantum computers. Instead of directly manipulating each qubit to perform universal quantum logic gates or measurements, ADQC uses a fixed two-qubit interaction to couple the memory register of a quantum computer to an ancilla qubit. By measuring the ancilla, the measurement-induced back-action on the system performs the desired logical operations. The underlying mathematical model is based on a new entanglement resource called twisted graph states generated from non-commuting operators, leading to a surprisingly powerful structure for parallel computation compared to graph states obtained from commuting generators. [M. Hein, J. Eisert, and H.J. Briegel. Multi-party entanglement in graph states. Physical Review A, 69, 2004. quant-ph/0307130]. The ADQC model is formalised in an algebraic framework similar to the Measurement Calculus [V. Danos, E. Kashefi, and P. Panangaden. The measurement calculus. Journal of ACM, 2007]. Furthermore, we present the notion of causal flow for twisted graph states, based on the stabiliser formalism, to characterise the determinism. Finally we demonstrate compositional embedding between ADQC and both the one-way and circuit models which will allow us to transfer recently developed theory and toolkits of measurement-based quantum computing and quantum circuit models directly into ADQC.

arXiv:0905.3354•Electronic Notes in Theoretical Computer Science•Aug 1, 2009•24 citations

Quantum Computing

Ke-Lin Du, M. N. S. Swamy

Springer eBooks•Jan 1, 2016•1 citation
Memory-driven computing for the design and test of digital devices is considered. One of the possible solutions to the problem of design and test theory and methods of quantum memory-driven computing on the classical computers for their subsequent application in all fields of human activity is proposed. Engineering-focused definitions of computing types are presented, including quantum one, which leverages the superposition and entanglement notions, and also memory-driven computing. The necessity of joint and parallel solving the problem of the creation of a market-accessible quantum computer and development of quantum-focused applications and cloud services is explained. Examples of quantum memory-driven design and test of digital circuit fragments are presented. A method for synthesis and minimization test for the black-box functionality, based on a qubit derivative matrix and sequencer for searching a quasioptimum coverage, is proposed.
Abstract Blind quantum computation (BQC) allows a client with limited quantum power to delegate his quantum computational task to a powerful server and still keep his input, output, and algorithm private. There are mainly two kinds of models about BQC, namely circuit-based and measurement-based models. In addition, a hybrid model called ancilla-driven universal blind quantum computation (ADBQC) was proposed by combining the properties of both circuit-based and measurement-based models, where all unitary operations on the register qubits can be realized with the aid of single ancilla coupled to the register qubits. However, in the ADBQC model, the quantum capability of the client is strictly limited to preparing single qubits. If a client can only perform single-qubit measurements or a few simple quantum gates, he will not be able to perform ADBQC. This paper solves the problem and extends the existing model by proposing two types of ADBQC protocols for clients with different quantum capabilities, such as performing single-qubit measurements or single-qubit gates. Furthermore, in the two proposed ADBQC protocols, clients can detect whether servers are honest or not with a high probability by using corresponding verifiable techniques.
We introduce a new paradigm for quantum computing called Ancilla-Driven Quantum Computation (ADQC) which combines aspects both of the quantum circuit [D. Deutsch. Quantum computational networks. Proc. Roy. Soc. Lond A, 425, 1989] and the one-way model [R. Raussendorf and H. J. Briegel. A one-way quantum computer. Physical Review Letters, 86, 2001] to overcome challenging issues in building large-scale quantum computers. Instead of directly manipulating each qubit to perform universal quantum logic gates or measurements, ADQC uses a fixed two-qubit interaction to couple the memory register of a quantum computer to an ancilla qubit. By measuring the ancilla, the measurement-induced back-action on the system performs the desired logical operations. The underlying mathematical model is based on a new entanglement resource called twisted graph states generated from non-commuting operators, leading to a surprisingly powerful structure for parallel computation compared to graph states obtained from commuting generators. [M. Hein, J. Eisert, and H.J. Briegel. Multi-party entanglement in graph states. Physical Review A, 69, 2004. quant-ph/0307130]. The ADQC model is formalised in an algebraic framework similar to the Measurement Calculus [V. Danos, E. Kashefi, and P. Panangaden. The measurement calculus. Journal of ACM, 2007]. Furthermore, we present the notion of causal flow for twisted graph states, based on the stabiliser formalism, to characterise the determinism. Finally we demonstrate compositional embedding between ADQC and both the one-way and circuit models which will allow us to transfer recently developed theory and toolkits of measurement-based quantum computing and quantum circuit models directly into ADQC.