Searcharxiv⌕ Search

arXiv subjects

Berta Casas

Publications and source records attributed to Berta Casas.

8 recordsLinked to original sources

Optimal four-copy detection of the three-tangle and its fault-tolerant cost

The three-tangle, $τ_3$, is a measure of genuine tripartite entanglement that distinguishes GHZ-type from W-type entanglement in pure three-qubit states. Here, we identify the statistically optimal one-sided four-copy detector of the three-tangle and study its implementation cost. The optimal detector has click probability $τ_3^2/48$, while previous four-copy constructions achieve $τ_3^2/256$ and therefore require asymptotically $16/3$ times as many experimental repetitions. Using the representation-theoretic structure of the problem, we construct an ancilla-free implementation of the optimal detector using 15 CNOT gates, together with an 11-CNOT detector with click probability $τ_3^2/96$. These results reveal a tradeoff between statistical efficiency and implementation cost, since reducing the number of repetitions requires increasingly expensive circuits. We then show that this tradeoff persists once the circuits are encoded. In a fully fault-tolerant setting, the increased click probability comes with a substantial non-Clifford synthesis cost, while an early fault-tolerant implementation based on $T$ gates and STAR rotations reduces this overhead at the expense of additional encoded resources. We quantify these costs using both the Steane and $[[8,3,2]]$ codes, providing explicit resource estimates for implementing the optimal detector across different computational regimes.

quant-ph↗

Complexity separations for optimal matchgate-Clifford synthesis

Clifford and matchgate circuits are canonical families of classically simulable quantum circuits. Their intersection, the matchgate-Clifford group, plays an important role in randomized fermionic protocols and in matchgate synthesis. Its adjoint action is isomorphic to the group of unit-determinant signed permutations of $2n$ Majorana modes, and we study optimal exact synthesis in this group. That is, given a target unitary and a gate set, output an $n$-qubit circuit implementing the target using the fewest operations. We show that the complexity of this problem strongly depends on the gate set. In particular, we study gate sets consisting of Majorana braids with different connectivity graphs. For path and complete graphs, we prove that the problem is classically solvable in $\mathcal{O}\left(n^2\right)$ time, and we provide explicit gate-optimal compilers. In addition, we prove that when the connectivity graph is a tree, the decision version of the optimal synthesis problem becomes NP-complete. Finally, we benchmark our optimal compiler on chains of up to $n=80$ qubits against those of \texttt{Qiskit} and \texttt{Tket}, obtaining circuits with constant factor improvements $\times2.57$ and $\times2.28$ in the total number of gates, respectively.

quant-ph↗

Matchgate synthesis via Clifford matchgates and $T$ gates

Matchgate unitaries are ubiquitous in quantum computation due to their relation to non-interacting fermions and because they can be used to benchmark quantum computers. Implementing such unitaries on fault-tolerant devices requires first compiling them into a discrete universal gate set, typically Clifford$+T$. Here, we propose a different approach for their synthesis: compile matchgate unitaries using only matchgate gates. To this end, we first show that the matchgate-Clifford group (the intersection of the matchgate and Clifford groups) plus the $\overline{T}$ gate (a $T$ unitary up to a phase) is universal for the matchgate group. Our approach leverages the connection between $n$-qubit matchgate circuits and the standard representation of $\mathbb{SO}(2n)$, which reduces the compilation from $2^n\times 2^n$ unitaries to $2n\times2n$ ones, thus reducing exponentially the size of the target matrix. Moreover, we rigorously show that this scheme is efficient, as an approximation error $\varepsilon_{\mathbb{SO}(2n)}$ incurred in this smaller-dimensional representation translates at most into an $O(n \,\varepsilon_{\mathbb{SO}(2n)})$ error in the exponentially large unitary. In addition, we study the exact version of the matchgate synthesis problem, and we prove that all matchgate unitaries $U$ such that $U\otimes U^*$ has entries in the ring $\mathbb{Z}\big[1/\sqrt 2,i\big]$ can be exactly synthesized by a finite sequence of gates from the matchgate-Clifford$+\overline{T}$ set, without ancillas. We then use this insight to map optimal exact matchgate synthesis to Boolean satisfiability, and compile the circuits that diagonalize the free-fermionic $XX$ Hamiltonian on $n=4,\,8$ qubits.

quant-ph↗

Warm Starts, Cold States: Exploiting Adiabaticity for Variational Ground-States

Reliable preparation of many-body ground states is an essential task in quantum computing, with applications spanning areas from chemistry and materials modeling to quantum optimization and benchmarking. A variety of approaches have been proposed to tackle this problem, including variational methods. However, variational training often struggle to navigate complex energy landscapes, frequently encountering suboptimal local minima or suffering from barren plateaus. In this work, we introduce an iterative strategy for ground-state preparation based on a stepwise (discretized) Hamiltonian deformation. By complementing the Variational Quantum Eigensolver (VQE) with adiabatic principles, we demonstrate that solving a sequence of intermediate problems facilitates tracking the ground-state manifold toward the target system, even as we scale the system size. We provide a rigorous theoretical foundation for this approach, proving a lower bound on the loss variance that suggests trainability throughout the deformation, provided the system remains away from gap closings. Numerical simulations, including the effects of shot noise, confirm that this path-dependent tracking consistently converges to the target ground state.

quant-ph↗

Distributed Quantum Circuit Cutting for Hybrid Quantum-Classical High-Performance Computing

Most quantum computers today are constrained by hardware limitations, particularly the number of available qubits, causing significant challenges for executing large-scale quantum algorithms. Circuit cutting has emerged as a key technique to overcome these limitations by decomposing large quantum circuits into smaller subcircuits that can be executed independently and later reconstructed. In this work, we introduce Qdislib, a distributed and flexible library for quantum circuit cutting, designed to seamlessly integrate with hybrid quantum-classical high-performance computing (HPC) systems. Qdislib employs a graph-based representation of quantum circuits to enable efficient partitioning, manipulation and execution, supporting both wire cutting and gate cutting techniques. The library is compatible with multiple quantum computing libraries, including Qiskit and Qibo, and leverages distributed computing frameworks to execute subcircuits across CPUs, GPUs, and quantum processing units (QPUs) in a fully parallelized manner. We present a proof of concept demonstrating how Qdislib enables the distributed execution of quantum circuits across heterogeneous computing resources, showcasing its potential for scalable quantum-classical workflows.

cs.DC↗

Quantum Circuits for High-Dimensional Absolutely Maximally Entangled States

Absolutely maximally entangled (AME) states of multipartite quantum systems exhibit maximal entanglement across all possible bipartitions. These states lead to teleportation protocols that surpass standard teleportation schemes, determine quantum error correction codes and can be used to test performance of current term quantum processors. Several AME states can be constructed from graph states using minimal quantum resources. However, there exist other constructions that depart from the stabilizer formalism. In this work, we present explicit quantum circuits to generate exemplary non-stabilizer AME states of four subsystems with four, six, and eight levels each and analyze their capabilities to perform quantum information tasks.

quant-ph↗

The role of data-induced randomness in quantum machine learning classification tasks

Quantum machine learning (QML) has surged as a prominent area of research with the objective to go beyond the capabilities of classical machine learning models. A critical aspect of any learning task is the process of data embedding, which directly impacts model performance. Poorly designed data-embedding strategies can significantly impact the success of a learning task. Despite its importance, rigorous analyses of data-embedding effects are limited, leaving many cases without effective assessment methods. In this work, we introduce a metric for binary classification tasks, the class margin, by merging the concepts of average randomness and classification margin. This metric analytically connects data-induced randomness with classification accuracy for a given data-embedding map. We benchmark a range of data-embedding strategies through class margin, demonstrating that data-induced randomness imposes a limit on classification performance. We expect this work to provide a new approach to evaluate QML models by their data-embedding processes, addressing gaps left by existing analytical tools.

quant-ph↗

Multidimensional Fourier series with quantum circuits

Quantum machine learning is the field that aims to integrate machine learning with quantum computation. In recent years, the field has emerged as an active research area with the potential to bring new insights to classical machine learning problems. One of the challenges in the field is to explore the expressibility of parametrized quantum circuits and their ability to be universal function approximators, as classical neural networks are. Recent works have shown that with a quantum supervised learning model, we can fit any one-dimensional Fourier series, proving their universality. However, models for multidimensional functions have not been explored in the same level of detail. In this work, we study the expressibility of various types of circuit ansatzes that generate multidimensional Fourier series. We found that, for some ansatzes, the degrees of freedom required for fitting such functions grow faster than the available degrees in the Hilbert space generated by the circuits. For example, single-qudit models have limited power to represent arbitrary multidimensional Fourier series. Despite this, we show that we can enlarge the Hilbert space of the circuit by using more qudits or higher local dimensions to meet the degrees of freedom requirements, thus ensuring the universality of the models.

quant-ph↗