Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2508.07491 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911100773072896 |
|---|---|
| author | Udalov, O. G. |
| author_facet | Udalov, O. G. |
| contents | An algorithm is proposed for constructing quasi-random "peaked" quantum circuits, i.e., circuits whose final qubit state exhibits a high probability concentration on a specific computational basis state. These circuits consist of random gates arranged in a brick-wall architecture. While the multiqubit state in the middle of the circuit can exhibit significant entanglement, the final state is, with high probability, a predetermined pure bitstring. A technique is introduced to obscure the final bitstring in the structure of the quantum circuit. The algorithm allows precise control over the probability of the final peaked state. A modified version of the algorithm enables the construction of double- or multi-peaked quantum circuits. The matrix product state (MPS) method is evaluated for simulating such circuits; it performs effectively for shallow peaked circuits but offers no significant advantage for deeper ones. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_07491 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Method for Constructing Quasi-Random Peaked Quantum Circuits Udalov, O. G. Quantum Physics Materials Science An algorithm is proposed for constructing quasi-random "peaked" quantum circuits, i.e., circuits whose final qubit state exhibits a high probability concentration on a specific computational basis state. These circuits consist of random gates arranged in a brick-wall architecture. While the multiqubit state in the middle of the circuit can exhibit significant entanglement, the final state is, with high probability, a predetermined pure bitstring. A technique is introduced to obscure the final bitstring in the structure of the quantum circuit. The algorithm allows precise control over the probability of the final peaked state. A modified version of the algorithm enables the construction of double- or multi-peaked quantum circuits. The matrix product state (MPS) method is evaluated for simulating such circuits; it performs effectively for shallow peaked circuits but offers no significant advantage for deeper ones. |
| title | A Method for Constructing Quasi-Random Peaked Quantum Circuits |
| topic | Quantum Physics Materials Science |
| url | https://arxiv.org/abs/2508.07491 |