g BdZddlmZddlZddlmZddlmZ  d dd ZdS)z Implementation of the GraySynth algorithm for synthesizing CNOT-Phase circuits with efficient CNOT cost, and the Patel-Hayes-Markov algorithm for optimal synthesis of linear (CNOT-only) reversible circuits. ) annotationsN)QuantumCircuit)synth_cnot_count_full_pmhstate#list[list[bool]] | np.ndarray[bool] section_size int | Nonereturnrctj|t}|2|jd|kr!t d|d|jddt ||}tj|dS)u 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 :math:`n \times n` matrix. Args: state: :math:`n \times n` boolean invertible matrix, describing the state of the input circuit. section_size: The size of each section in the Patel–Markov–Hayes algorithm [1]. If ``None`` it is chosen to be :math:`\max(2, \alpha\log_2(n))` with :math:`\alpha = 0.56`, which approximately minimizes the upper bound on the number of row operations given in [1] Eq. (3). Returns: A CX-only circuit implementing the linear transformation. Raises: ValueError: When ``section_size`` is larger than the number of columns. References: 1. 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] `_ NzThe section_size (z/) cannot be larger than the number of columns (z).T)add_regs) npasarrayastypeboolshape ValueErrorfast_pmhr_from_circuit_data)rr normalized circuit_datas X/granary/edev/quantum/lib/python3.11/site-packages/qiskit/synthesis/linear/cnot_synth.pyrrs>E""))$//JJ$4Q$7,$F$F ( ( ( # ( ( (   J 55L  ,\D I I II)N)rrrr r r) __doc__ __future__rnumpyrqiskit.circuitr#qiskit._accelerate.synthesis.linearrrrrr s #"""""))))))UUUUUULP*J*J*J*J*J*J*Jr