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

Physica E Low-dimensional Systems and Nanostructures

Template matching of mixed quantum states

A. Carlini, Masahide Sasaki

Published Jul 23, 2005• 1 citation
Publisher
DOI
10.1016/j.physe.2005.06.060

Related papers

Efficient template matching in quantum circuits

Raban Iten, David Sutter, Stefan Woerner

•Sep 11, 2019•2 citations

Dynamic Template Matching with Mixed-Polarity Toffoli Gates

Md. Mazder Rahman, Mathias Soeken, Gerhard W. Dueck

The Toffoli gate, as originally proposed, had only positive controls. It has been shown that mixed polarity controlled Toffoli gates can be efficiently implemented. In fact, their quantum cost is the same as for positive controlled gates in most cases. Thus it is advantageous to consider circuits with mixed polarity Toffoli gates. Template matching has been successfully used to reduce the number of Toffoli gates in reversible circuits. Little work on templates with mixed polarity gates has been reported. Unfortunately, the number of potential templates increases dramatically, if mixed polarity is introduced. Here we propose a dynamic template matching algorithm that takes templates with few lines and dynamically extends the lines to find matches. Experimental results show that the proposed approach has a significant impact on reducing the total number of gates (57% in the best case) in circuits.

IEEE International Symposium on Multiple-Valued Logic (ISMVL)•May 1, 2015•5 citations

Quantum template matching

Masahide Sasaki, A. Carlini, Richard Jozsa

We consider the quantum analogue of the pattern-matching problem, which consists of classifying a given unknown system according to certain predefined pattern classes. We address the problem of quantum template matching in which each pattern class ${\mathcal{C}}_{i}$ is represented by a known quantum state ${g}_{i}$ called a template state, and our task is to find a template that optimally matches a given unknown quantum state $\mathrm{f\ifmmode \hat{}\else \^{}\fi{}}.$ We set up a precise formulation of this problem in terms of the optimal strategy for an associated quantum Bayesian inference problem. We then investigate various examples of quantum template matching for qubit systems, considering the effect of allowing a finite number of copies of the input state $\mathrm{f\ifmmode \hat{}\else \^{}\fi{}}.$ We compare quantum optimal matching strategies and semiclassical strategies to demonstrate an entanglement assisted enhancement of performance in the general quantum optimal strategy.

arXiv:quant-ph/0102020•Physical Review A•Jul 17, 2001•61 citations

Mixed Quantum States

Andrew N. Jordan, Irfan A. Siddiqi

Cambridge University Press eBooks•Feb 15, 2024•0 citations

An Algorithm for Quantum Template Matching

Md. Mazder Rahman, Gerhard W. Dueck, Joseph D. Horton

Quantum circuits are often generated by decomposing gates from networks with classical reversible gates. Only in rare cases, the results are minimal. Post-optimization methods, such as template matching, are employed to reduce the quantum costs of circuits. Quantum templates are derived from identity circuits. All minimal realizations, within certain limitations, can be embedded into templates. Due to this property, templates matching has the potential to reduce quantum costs of circuits. However, one of the difficulties in finding templates matches is due to the mobility of the gates within the circuit. Thus far, template matching procedures have employed heuristics to reduce the search space. This article presents an in-depth study of exact template matching with a set of algorithms. A graph structure with the corresponding circuits facilitates the discovery of potential sequences of templates to be matched, and how exact minimization of circuits can be accomplished. The significance of the proposed method is verified in benchmarks optimization.

ACM Journal on Emerging Technologies in Computing Systems•Dec 30, 2014•21 citations

Purification of mixed quantum states

Ingemar Bengtsson, Karol Życzkowski

Cambridge University Press eBooks•May 11, 2006•2 citations
The Toffoli gate, as originally proposed, had only positive controls. It has been shown that mixed polarity controlled Toffoli gates can be efficiently implemented. In fact, their quantum cost is the same as for positive controlled gates in most cases. Thus it is advantageous to consider circuits with mixed polarity Toffoli gates. Template matching has been successfully used to reduce the number of Toffoli gates in reversible circuits. Little work on templates with mixed polarity gates has been reported. Unfortunately, the number of potential templates increases dramatically, if mixed polarity is introduced. Here we propose a dynamic template matching algorithm that takes templates with few lines and dynamically extends the lines to find matches. Experimental results show that the proposed approach has a significant impact on reducing the total number of gates (57% in the best case) in circuits.
We consider the quantum analogue of the pattern-matching problem, which consists of classifying a given unknown system according to certain predefined pattern classes. We address the problem of quantum template matching in which each pattern class Ci{\mathcal{C}}_{i}Ci​ is represented by a known quantum state gi{g}_{i}gi​ called a template state, and our task is to find a template that optimally matches a given unknown quantum state $\mathrm{f\ifmmode \hat{}\else \^{}\fi{}}.$ We set up a precise formulation of this problem in terms of the optimal strategy for an associated quantum Bayesian inference problem. We then investigate various examples of quantum template matching for qubit systems, considering the effect of allowing a finite number of copies of the input state $\mathrm{f\ifmmode \hat{}\else \^{}\fi{}}.$ We compare quantum optimal matching strategies and semiclassical strategies to demonstrate an entanglement assisted enhancement of performance in the general quantum optimal strategy.
Quantum circuits are often generated by decomposing gates from networks with classical reversible gates. Only in rare cases, the results are minimal. Post-optimization methods, such as template matching, are employed to reduce the quantum costs of circuits. Quantum templates are derived from identity circuits. All minimal realizations, within certain limitations, can be embedded into templates. Due to this property, templates matching has the potential to reduce quantum costs of circuits. However, one of the difficulties in finding templates matches is due to the mobility of the gates within the circuit. Thus far, template matching procedures have employed heuristics to reduce the search space. This article presents an in-depth study of exact template matching with a set of algorithms. A graph structure with the corresponding circuits facilitates the discovery of potential sequences of templates to be matched, and how exact minimization of circuits can be accomplished. The significance of the proposed method is verified in benchmarks optimization.