About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
qiskit.synthesis.synth_cnot_count_full_pmh
synth_cnot_count_full_pmh(state, section_size=2)
Synthesize linear reversible circuits for all-to-all architecture using Patel, Markov and Hayes method.
This function is an implementation of the Patel, Markov and Hayes algorithm from [1] for optimal synthesis of linear reversible circuits for all-to-all architecture, as specified by an n x n matrix.
Parameters
- state (list[list] or ndarray) – n x n boolean invertible matrix, describing the state of the input circuit
- section_size (int) – the size of each section, used in the Patel–Markov–Hayes algorithm [1]. section_size must be a factor of num_qubits.
Returns
a CX-only circuit implementing the linear transformation.
Return type
Raises
QiskitError – when variable “state” isn’t of type numpy.ndarray
References
- Patel, Ketan N., Igor L. Markov, and John P. Hayes, Optimal synthesis of linear reversible circuits, Quantum Information & Computation 8.3 (2008): 282-294. arXiv:quant-ph/0302002 [quant-ph]
Was this page helpful?
Report a bug or request content on GitHub.