Pablo Andrés-Martínez
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Pablo Andrés-Martínez has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Chris Heunen
University of Edinburgh, Edinburgh, United Kingdom
5 shared publications - Daniel Mills
Quantinuum Terrington House 13-15 Hills Road CB2 1NL Cambridge UK
2 shared publications - Jun-Yi Wu
Tamkang University
2 shared publications - Luciana Henaut
Oxford Quantum Circuits
2 shared publications - Mio Murao
The University of Tokyo
2 shared publications - Tim Forrer
Department of Physics, Graduate School of Science, The University of Tokyo, Hongo 7-3-1, Bunkyo-ku, Tokyo 113-0033, Japan
2 shared publications
Latest Publications
- Open Access
- 13 January 2025
- Published by Elsevier in Journal of Pure and Applied Algebra
- Vol. 229 (2)
Categories of sets with infinite addition
- 13 January 2025
- Published by Elsevier in Journal of Pure and Applied Algebra
- Vol. 229 (2)
Open AccessCategories of sets with infinite addition
- Open Access
- 6 August 2024
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 9 (4) , 045021
Distributing circuits over heterogeneous, modular quantum computing network architectures
We consider a heterogeneous network of quantum computing modules, sparsely connected via Bell states. Operations across these connections constitute a computational bottleneck and they are likely to add more noise to the computation than operations performed within a module. We introduce several techniques for transforming a given quantum circuit into one implementable on such a network, minimising the number of Bell states required to do so. We extend previous works on circuit distribution to the case of heterogeneous networks. On the one hand, we extend the hypergraph approach of Andres-Martinez and Heunen (2019 Phys. Rev. A 100 032308) to arbitrary network topologies, and we propose the use of Steiner trees to detect and reuse common connections, further reducing the cost of entanglement sharing within the network. On the other hand, we extend the embedding techniques of Wu et al (2023 Quantum 7 1196) to networks with more than two modules. We show that, with careful manipulation of trade-offs, these two new approaches can be combined into a single automated framework. Our proposal is implemented and benchmarked; the results confirm that our contributions make noticeable improvements upon the aforementioned works and complement their weaknesses.
- 6 August 2024
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 9 (4) , 045021
Open AccessDistributing circuits over heterogeneous, modular quantum computing network architectures
We consider a heterogeneous network of quantum computing modules, sparsely connected via Bell states. Operations across these connections constitute a computational bottleneck and they are likely to add more noise to the computation than operations performed within a module. We introduce several techniques for transforming a given quantum circuit into one implementable on such a network, minimising the number of Bell states required to do so. We extend previous works on circuit distribution to the case of heterogeneous networks. On the one hand, we extend the hypergraph approach of Andres-Martinez and Heunen (2019 Phys. Rev. A 100 032308) to arbitrary network topologies, and we propose the use of Steiner trees to detect and reuse common connections, further reducing the cost of entanglement sharing within the network. On the other hand, we extend the embedding techniques of Wu et al (2023 Quantum 7 1196) to networks with more than two modules. We show that, with careful manipulation of trade-offs, these two new approaches can be combined into a single automated framework. Our proposal is implemented and benchmarked; the results confirm that our contributions make noticeable improvements upon the aforementioned works and complement their weaknesses.
- Open Access
- 5 December 2023
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 7, 1196
Entanglement-efficient bipartite-distributed quantum computing
In noisy intermediate-scale quantum computing, the limited scalability of a single quantum processing unit (QPU) can be extended through distributed quantum computing (DQC), in which one can implement global operations over two QPUs by entanglement-assisted local operations and classical communication. To facilitate this type of DQC in experiments, we need an entanglement-efficient protocol. To this end, we extend the protocol in [Eisert et. al., PRA, 62:052317(2000)] implementing each nonlocal controlled-unitary gate locally with one maximally entangled pair to a packing protocol, which can pack multiple nonlocal controlled-unitary gates locally using one maximally entangled pair. In particular, two types of packing processes are introduced as the building blocks, namely the distributing processes and embedding processes. Each distributing process distributes corresponding gates locally with one entangled pair. The efficiency of entanglement is then enhanced by embedding processes, which merge two non-sequential distributing processes and hence save the entanglement cost. We show that the structure of distributability and embeddability of a quantum circuit can be fully represented by the corresponding packing graphs and conflict graphs. Based on these graphs, we derive heuristic algorithms for finding an entanglement-efficient packing of distributing processes for a given quantum circuit to be implemented by two parties. These algorithms can determine the required number of local auxiliary qubits in the DQC. We apply these algorithms for bipartite DQC of unitary coupled-cluster circuits and find a significant reduction of entanglement cost through embeddings. This method can determine a constructive upper bound on the entanglement cost for the DQC of quantum circuits.
- 5 December 2023
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 7, 1196
Open AccessEntanglement-efficient bipartite-distributed quantum computing
In noisy intermediate-scale quantum computing, the limited scalability of a single quantum processing unit (QPU) can be extended through distributed quantum computing (DQC), in which one can implement global operations over two QPUs by entanglement-assisted local operations and classical communication. To facilitate this type of DQC in experiments, we need an entanglement-efficient protocol. To this end, we extend the protocol in [Eisert et. al., PRA, 62:052317(2000)] implementing each nonlocal controlled-unitary gate locally with one maximally entangled pair to a packing protocol, which can pack multiple nonlocal controlled-unitary gates locally using one maximally entangled pair. In particular, two types of packing processes are introduced as the building blocks, namely the distributing processes and embedding processes. Each distributing process distributes corresponding gates locally with one entangled pair. The efficiency of entanglement is then enhanced by embedding processes, which merge two non-sequential distributing processes and hence save the entanglement cost. We show that the structure of distributability and embeddability of a quantum circuit can be fully represented by the corresponding packing graphs and conflict graphs. Based on these graphs, we derive heuristic algorithms for finding an entanglement-efficient packing of distributing processes for a given quantum circuit to be implemented by two parties. These algorithms can determine the required number of local auxiliary qubits in the DQC. We apply these algorithms for bipartite DQC of unitary coupled-cluster circuits and find a significant reduction of entanglement cost through embeddings. This method can determine a constructive upper bound on the entanglement cost for the DQC of quantum circuits.
- Open Access
- 11 February 2022
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 7 (2) , 025007
Weakly measured while loops: peeking at quantum states
A while loop tests a termination condition on every iteration. On a quantum computer, such measurements perturb the evolution of the algorithm. We define a while loop primitive using weak measurements, offering a trade-off between the perturbation caused and the amount of information gained per iteration. This trade-off is adjusted with a parameter set by the programmer. We provide sufficient conditions that let us determine, with arbitrarily high probability, a worst-case estimate of the number of iterations the loop will run for. As an example, we solve Grover’s search problem using a while loop and prove the quadratic quantum speed-up is maintained.
- 11 February 2022
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 7 (2) , 025007
Open AccessWeakly measured while loops: peeking at quantum states
A while loop tests a termination condition on every iteration. On a quantum computer, such measurements perturb the evolution of the algorithm. We define a while loop primitive using weak measurements, offering a trade-off between the perturbation caused and the amount of information gained per iteration. This trade-off is adjusted with a parameter set by the programmer. We provide sufficient conditions that let us determine, with arbitrarily high probability, a worst-case estimate of the number of iterations the loop will run for. As an example, we solve Grover’s search problem using a while loop and prove the quadratic quantum speed-up is maintained.
- Open Access
Weakly measured while loops: peeking at quantum states
A while loop tests a termination condition on every iteration. On a quantum computer, such measurements perturb the evolution of the algorithm. We define a while loop primitive using weak measurements, offering a trade-off between the perturbation caused and the amount of information gained per iteration. This trade-off is adjusted with a parameter set by the programmer. We provide sufficient conditions that let us determine, with arbitrarily high probability, a worst-case estimate of the number of iterations the loop will run for. As an example, we solve Grover's search problem using a while loop and prove the quadratic quantum speed-up is maintained.
Open AccessWeakly measured while loops: peeking at quantum states
A while loop tests a termination condition on every iteration. On a quantum computer, such measurements perturb the evolution of the algorithm. We define a while loop primitive using weak measurements, offering a trade-off between the perturbation caused and the amount of information gained per iteration. This trade-off is adjusted with a parameter set by the programmer. We provide sufficient conditions that let us determine, with arbitrarily high probability, a worst-case estimate of the number of iterations the loop will run for. As an example, we solve Grover's search problem using a while loop and prove the quadratic quantum speed-up is maintained.
- Open Access
Automated distribution of quantum circuits via hypergraph partitioning
Quantum algorithms are usually described as monolithic circuits, becoming large at modest input size. Near-term quantum architectures can only manage a small number of qubits. We develop an automated method to distribute quantum circuits over multiple agents, minimising quantum communication between them. We reduce the problem to hypergraph partitioning and then solve it with state-of-the-art optimisers. This makes our approach useful in practice, unlike previous methods. Our implementation is evaluated on five quantum circuits of practical relevance.
Open AccessAutomated distribution of quantum circuits via hypergraph partitioning
Quantum algorithms are usually described as monolithic circuits, becoming large at modest input size. Near-term quantum architectures can only manage a small number of qubits. We develop an automated method to distribute quantum circuits over multiple agents, minimising quantum communication between them. We reduce the problem to hypergraph partitioning and then solve it with state-of-the-art optimisers. This makes our approach useful in practice, unlike previous methods. Our implementation is evaluated on five quantum circuits of practical relevance.
- Top Cited Papers
- 5 September 2019
- Published by American Physical Society (APS) in Physical Review A
- Vol. 100 (3) , 032308
Automated distribution of quantum circuits via hypergraph partitioning
Quantum algorithms are usually described as monolithic circuits, becoming large at modest input size. Near-term quantum architectures can only manage a small number of qubits. We develop an automated method to distribute quantum circuits over multiple agents, minimizing quantum communication between them. We reduce the problem to hypergraph partitioning and then solve it with state-of-the-art optimizers. This makes our approach useful in practice, unlike previous methods. Our implementation is evaluated on five quantum circuits of practical relevance.
- 5 September 2019
- Published by American Physical Society (APS) in Physical Review A
- Vol. 100 (3) , 032308
Top Cited PapersAutomated distribution of quantum circuits via hypergraph partitioning
Quantum algorithms are usually described as monolithic circuits, becoming large at modest input size. Near-term quantum architectures can only manage a small number of qubits. We develop an automated method to distribute quantum circuits over multiple agents, minimizing quantum communication between them. We reduce the problem to hypergraph partitioning and then solve it with state-of-the-art optimizers. This makes our approach useful in practice, unlike previous methods. Our implementation is evaluated on five quantum circuits of practical relevance.