simonwa7 / analytical-mps-quantum-circuit-encoding Goto Github PK

Greetings there,

Hope all are well. I am quite new to this package, and was hoping to ask if you have any existing code which would perform the following :

1. Define the classical data to be encoded
2. Convert the classical data to a quantum state vector (normalizing, and 0 padding)
3. Define the infidelity upper bound, and calculate the MPS (where the error upper bound would define the optimal bond dimension)
4. Prepare the MPS circuit

What this would do is approximate the initial input state through an MPS, and allow one to use that instead of the exponentially scaling exact ones like Mottonen and Shende. For your kind reference, here is the paper I am trying to implement for this :
https://arxiv.org/pdf/2311.07666.pdf
or
https://arxiv.org/pdf/2310.05897.pdf

Step 1 and 2 are quite self-explanatory, and I have code for that, so basically a code which would take a state vector with an error upper bound, calculate the MPS, and then create the circuit for that MPS. Also, if you do indeed allow this (fingers crossed), I would appreciate it if you can link the reference paper you used for my learning, and to confirm if the algorithm allows you to scale the depth linearly with respect to the number of qubits, basically $O(NX^2)$ where X is the bond dimension.

P.S : If this is not existing, and you are interested in implementing this, I am actually looking for someone to collaborate with and implement this. If you are interested, I'd love to collaborate with you on this.