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

Auxiliary field methods for the Simulation of Quantum circuits

正道 石川, Masamichi Ishikawa

Published Jan 1, 2002• 0 citations
OpenAlex

Related papers

Quantum simulations of realistic systems by auxiliary fields

Shiwei Zhang, Henry Krakauer, Wissam A. Al-Saidi +1 more

Computer Physics Communications•Apr 13, 2005•20 citations

AUXILIARY FIELD METHODS FOR THE SIMULATION OF QUANTUM COMPUTATION CIRCUITS

Hans‐Georg Matuttis, Kurt Fischer, Nobuyasu Ito +1 more

One obstacle in the simulation of quantum circuits is the high dimension of the Hilbert space. Using auxiliary field decompositions known from many-particle simulation, we can transform the mathematical description of the quantum circuit into a combination low-dimensional product states which can be sampled using Monte Carlo techniques. We demonstrate the method using Simon's algorithm for the detection of the period of a function.

International Journal of Modern Physics C•Sep 1, 2002•1 citation

Quantum Computing Simulation using the Auxiliary Field Decomposition

Kurt Fischer, Hans‐Georg Matuttis, Satoshi Yukawa +1 more

Springer proceedings in physics•Jan 1, 2004•0 citations

Divide-and-Conquer Simulation of Open Quantum Systems

Thiago Melo D. Azevedo, Caio Leão, Pedro Linck Maciel +2 more

One of the promises of quantum computing is to simulate physical systems efficiently. However, simulation of open quantum systems remains challenging, as their evolution involves non-unitary operators. The Stinespring dilation can simulate an open dynamic using a logarithmic number of auxiliary qubits, but requires a high circuit depth, which is impractical for NISQ devices. An alternative approach is parallel probabilistic block-encoding methods, such as the Sz.-Nagy and Singular Value Decomposition dilations. These methods implement the action of a single Kraus operator on quantum hardware and require one auxiliary qubit for each operator. They also result in shallower circuits but are hybrid methods, and do not simulate the complete quantum dynamic on the quantum computer. In this work, we describe a divide-and-conquer strategy to combine the output of each Kraus operator dilation and obtain the complete dynamic on quantum hardware with a lower circuit depth. We also introduce a balanced strategy that groups the Kraus operators into an expanded operator, leading to a trade-off between circuit depth, CNOT count, and number of qubits. We perform a computational analysis to demonstrate the advantages of the method and present a simulation of the Fenna-Matthews-Olson dynamic on current hardware.

arXiv:2505.01623•ACM Transactions on Quantum Computing•Nov 7, 2026•1 citation

Improving Gate-Level Simulation of Quantum Circuits

George F. Viamontes, Igor L. Markov, John P. Hayes

arXiv:quant-ph/0309060•Quantum Information Processing•Oct 1, 2003•110 citations

Compact and classically preprocessed data-loading quantum circuit as a quantum random access memory

Bojia Duan, Chang‐Yu Hsieh

Quantum random access memory (QRAM) is an essential ingredient for many quantum algorithms, such as quantum machine learning models. The quantum resources (qubit counts and circuit depths) required to load classical data into a circuit severely prohibit many reasonably sophisticated demonstrations in the near term. To this end, we propose a method to construct a compact QRAM circuit, leveraging classical preprocessing to design as shallow a circuit with as few auxiliary qubits as possible. The underlying idea is to map data-encoded quantum states into an orthogonal set of quantum states (characterized by a family of parametrized circuits); then one can straightforwardly entangle the data qubits with the address qubits using cnot gates to realize a data-loading QRAM circuit. The nonunitary transformation to convert the orthogonalized quantum states back to the original data-encoded quantum states can be easily achieved with the help of a small set of auxiliary qubits and postselections. Numerical simulations on handwritten digits and Iris data sets are performed to assess the effectiveness of the proposed method, and we also highlight how noise influences quantum circuit performance across diverse configurations using random data sets. The proposed method for constructing a QRAM circuit can potentially facilitate the development and testing of many quantum machine learning methods in the near term.

Physical Review A•Jul 22, 2024•7 citations
One of the promises of quantum computing is to simulate physical systems efficiently. However, simulation of open quantum systems remains challenging, as their evolution involves non-unitary operators. The Stinespring dilation can simulate an open dynamic using a logarithmic number of auxiliary qubits, but requires a high circuit depth, which is impractical for NISQ devices. An alternative approach is parallel probabilistic block-encoding methods, such as the Sz.-Nagy and Singular Value Decomposition dilations. These methods implement the action of a single Kraus operator on quantum hardware and require one auxiliary qubit for each operator. They also result in shallower circuits but are hybrid methods, and do not simulate the complete quantum dynamic on the quantum computer. In this work, we describe a divide-and-conquer strategy to combine the output of each Kraus operator dilation and obtain the complete dynamic on quantum hardware with a lower circuit depth. We also introduce a balanced strategy that groups the Kraus operators into an expanded operator, leading to a trade-off between circuit depth, CNOT count, and number of qubits. We perform a computational analysis to demonstrate the advantages of the method and present a simulation of the Fenna-Matthews-Olson dynamic on current hardware.
Quantum random access memory (QRAM) is an essential ingredient for many quantum algorithms, such as quantum machine learning models. The quantum resources (qubit counts and circuit depths) required to load classical data into a circuit severely prohibit many reasonably sophisticated demonstrations in the near term. To this end, we propose a method to construct a compact QRAM circuit, leveraging classical preprocessing to design as shallow a circuit with as few auxiliary qubits as possible. The underlying idea is to map data-encoded quantum states into an orthogonal set of quantum states (characterized by a family of parametrized circuits); then one can straightforwardly entangle the data qubits with the address qubits using cnot gates to realize a data-loading QRAM circuit. The nonunitary transformation to convert the orthogonalized quantum states back to the original data-encoded quantum states can be easily achieved with the help of a small set of auxiliary qubits and postselections. Numerical simulations on handwritten digits and Iris data sets are performed to assess the effectiveness of the proposed method, and we also highlight how noise influences quantum circuit performance across diverse configurations using random data sets. The proposed method for constructing a QRAM circuit can potentially facilitate the development and testing of many quantum machine learning methods in the near term.