Is your feature request related to a problem? Please describe.
A clear and concise description of what the problem is.
According to M. Houshmand et al., PRA 98, 012318 (2018), the minimal required number of qubits is n + 1 for graphs with a causal flow. However, current minimize_space() method sometimes returns bad answers(require more than n+1 qubits).
Describe the solution you'd like
A clear and concise description of what you want to happen.
Implement a flow-based-measurement-order generation method which absolutely minimizes required number to n+1.
Describe alternatives you've considered
A clear and concise description of any alternative solutions or features you've considered.
na
Additional context
Add any other context or screenshots about the feature request here.
Is your feature request related to a problem? Please describe. A clear and concise description of what the problem is.
According to M. Houshmand et al., PRA 98, 012318 (2018), the minimal required number of qubits is n + 1 for graphs with a causal flow. However, current
minimize_space()method sometimes returns bad answers(require more than n+1 qubits).Describe the solution you'd like A clear and concise description of what you want to happen.
Implement a flow-based-measurement-order generation method which absolutely minimizes required number to n+1.
Describe alternatives you've considered A clear and concise description of any alternative solutions or features you've considered.
na
Additional context Add any other context or screenshots about the feature request here.
na