arXiv subjects

Dardo Goyeneche

Publications and source records attributed to Dardo Goyeneche.

At least 19 recordsLinked to original sources

arXiv2026

Qudit-ADAPT-VQE: an adaptive variational algorithm with counterdiabatic-inspired improvements for qudits

Variational quantum algorithms based on qudits have attracted significant attention in recent years. However, as in their qubit-based counterparts, challenges such as barren plateaus and the design of efficient ansatz remain major obstacles. In this work, we propose to address these issues through a qudit implementation of the ADAPT-VQE algorithm, which constructs the ansatz iteratively. Specifically, we introduce an operator pool inspired by adiabatic evolution enhanced with counterdiabatic driving for ansatz construction and employ it to solve Max 3-Cut. We show that the warm-start strategy inherent to ADAPT-VQE, together with an ansatz construction based on counterdiabatic operators, achieves higher accuracy and lower native gates implementation than approaches on fixed ansatz. Furthermore, we show that, in qudit-based quantum computing, ADAPT-VQE with a counterdiabatic operator pool can navigate rough optimization landscapes with local traps through the burrowing mechanism, suggesting robustness against barren plateau effects and providing a scalable framework for variational quantum algorithms with qudits.

quant-ph↗

arXiv2026

Entanglement and discord classification via deep learning

In this work, we propose a deep learning-based approach for quantum entanglement and discord classification using convolutional autoencoders. We train models to distinguish entangled from separable bipartite states for $d \times d$ systems with local dimension $d$ ranging from two to seven, which enables identification of bound and free entanglement. Through extensive numerical simulations across various quantum state families, we demonstrate that our model achieves high classification accuracy. Furthermore, we leverage the learned representations to generate samples of bound entangled states, the rarest form of entanglement and notoriously difficult to construct analytically. We separately train the same convolutional autoencoders architecture for detecting the presence of quantum discord and show that the model also exhibits high accuracy while requiring significantly less training time.

quant-ph↗

arXiv2026

Counterdiabatic ADAPT-VQE for molecular simulation

Among variational quantum algorithms designed for NISQ devices, ADAPT-VQE stands out for its robustness against barren plateaus, particularly in estimating molecular ground states. On the other hand, counterdiabatic algorithms have shown advantages in both performance and circuit depth when compared to standard adiabatic approaches. In this work, we propose a hybrid method that integrates the ADAPT-VQE framework with counterdiabatic driving within an adiabatic evolution scheme. Specifically, we map the molecular Hamiltonian to a qubit representation and construct an adiabatic Hamiltonian, from which an approximate adiabatic gauge potential is computed using nested commutators. The resulting operator terms define the operator pool, and the ADAPT-VQE algorithm is applied to iteratively select the most relevant elements for the ansatz. Our results demonstrate improvements in performance and reductions in circuit depth compared to using either counterdiabatic algorithms or ADAPT-VQE with fermionic excitation operators, thus supporting the effectiveness of combining both paradigms in molecular simulations.

quant-ph↗

arXiv2025

Entanglement generation in qubit-ADAPT-VQE through four-qubit algebraic classification

While variational quantum algorithms are among the most promising approaches for the noisy intermediate-scale quantum (NISQ) era, their scalability is often hindered by the barren plateau problem. Among the proposals that have demonstrated robustness against this issue, the ADAPT-VQE algorithm stands out for ground state estimation, primarily due to its iterative ansatz construction. Although ADAPT-VQE has been extensively benchmarked on molecular Hamiltonians, where the ground states typically exhibit low entanglement, its performance for highly entangled ground states remains largely unexplored. In this work, we explore a variant of this algorithm known as qubit-ADAPT-VQE, assessing its ability to achieve ground states with substantial entanglement in spin models. We focus on four-qubit systems and employ an algebraic entanglement classification to identify distinct entanglement classes among ground states, and consider a representative of each class as an initial state to evaluate the performance of the algorithm. Our findings highlight the versatility of qubit-ADAPT-VQE, demonstrating that it accurately reaches the ground state across all entanglement classes and initial energy values.

quant-ph↗

arXiv2025

Efficient state estimation on quantum processors

We present two scalable and entanglement-free methods for estimating the collective state of an n-qubit quantum computer. The first method consists of a fixed set of five quantum circuits-regardless of the number of qubits-that avoid the use of entanglement as a measurement resource, relying instead on classical communication between selected pairs of qubits. The second method requires only 2n+1 circuits, each of which applies a single local gate to one of the n qubits during the measurement stage. Unlike traditional estimation methods, our approaches do not require any costly post-processing procedure to estimate a quantum state, enabling scalability to relatively large system sizes. We experimentally compare both methods on freely available IBM quantum processors, and observe how the state estimation varies with increasing number of qubits and shots. We further validated our results by estimating the 4-qubit entangled state of two remote ion-trap quantum processors, demonstrating that the optimized 2n+1 tomographic scheme achieves estimates consistent with standard methods while using exponentially fewer measurements.

quant-ph↗

arXiv2025

Cyclic measurements and simplified quantum state tomography

Tomographic reconstruction of quantum states plays a fundamental role in benchmarking quantum systems and accessing information encoded in quantum-mechanical systems. Among the informationally complete sets of quantum measurements, the tight ones provide a linear reconstruction formula and minimize the propagation of statistical errors. However, implementing tight measurements in the lab is challenging due to the high number of required measurement projections, involving a series of experimental setup preparations. In this work, we introduce the notion of cyclic tight measurements, which allow us to perform full quantum state tomography while considering only repeated application of a single unitary-based quantum device during the measurement stage. This type of measurement significantly simplifies the complexity of the experimental setup required to retrieve the quantum state of a physical system. Additionally, we design a feasible setup preparation procedure that produces well-approximated cyclic tight measurements in every finite dimension.

quant-ph↗

arXiv2023

Local hidden variable values without optimization procedures

The problem of computing the local hidden variable (LHV) value of a Bell inequality plays a central role in the study of quantum nonlocality. In particular, this problem is the first step towards characterizing the LHV polytope of a given scenario. In this work, we establish a relation between the LHV value of bipartite Bell inequalities and the mathematical notion of excess of a matrix. Inspired by the well developed theory of excess, we derive several results that directly impact the field of quantum nonlocality. We show infinite families of bipartite Bell inequalities for which the LHV value can be computed exactly, without needing to solve any optimization problem, for any number of measurement settings. We also find tight Bell inequalities for a large number of measurement settings.

quant-ph↗

arXiv2022

Reconstructing the whole from its parts

The quantum marginal problem consists in deciding whether a given set of marginal reductions is compatible with the existence of a global quantum state or not. In this work, we formulate the problem from the perspective of dynamical systems theory and study its advantages with respect to the standard approach. The introduced formalism allows us to analytically determine global quantum states from a wide class of self-consistent marginal reductions in any multipartite scenario. In particular, we show that any self-consistent set of multipartite marginal reductions is compatible with the existence of a global quantum state, after passing through a depolarizing channel. This result reveals that the complexity associated to the marginal problem can be drastically reduced when restricting the attention to sufficiently mixed marginals. We also formulate the marginal problem in a compressed way, in the sense that the total number of scalar constraints is smaller than the one required by the standard approach. This fact suggests an exponential speedup in runtime when considering semi-definite programming techniques to solve it, in both classical and quantum algorithms. Finally, we reconstruct $n$-qubit quantum states from all the $\binom{n}{k}$ marginal reductions to $k$ parties, generated from randomly chosen mixed states. Numerical simulations reveal that the fraction of cases where we can find a global state equals 1 when $5\leq n\leq12$ and $\lfloor(n-1)/\sqrt{2}\rfloor\leq k\leq n-1$, where $\lfloor\cdot\rfloor$ denotes the floor function.

quant-ph↗

arXiv2022

Fast and simple quantum state estimation

We present an iterative method to solve the multipartite quantum state estimation problem. We demonstrate convergence for any informationally complete set of generalized quantum measurements in every finite dimension. Our method exhibits fast convergence in high dimension and strong robustness under the presence of realistic errors both in state preparation and measurement stages. In particular, for mutually unbiased bases and tensor product of generalized Pauli observables it converges in a single iteration. We show outperformance of our algorithm with respect to the state-of-the-art of maximum likelihood estimation methods both in runtime and fidelity of the reconstructed states.

quant-ph↗

arXiv2020

A No-go theorem for device-independent security in relativistic causal theories

A crucial task for secure communication networks is to determine the minimum of physical requirements to certify a cryptographic protocol. A widely accepted candidate for certification is the principle of relativistic causality which is equivalent to the disallowance of causal loops. Contrary to expectations, we demonstrate how correlations allowed by relativistic causality could be exploited to break security for a broad class of multi-party protocols (all modern protocols belong to this class). As we show, deep roots of this dramatic lack of security lies in the fact that unlike in previous (quantum or no-signaling) scenarios the new theory "decouples" the property of extremality and that of statistical independence on environment variables. Finally, we find out, that the lack of security is accompanied by some advantage: the new correlations can reduce communication complexity better than the no-signaling ones. As a tool for analysis of this advantage, we characterize relativistic causal polytope by its extremal points in the simplest multi-party scenario that goes beyond the no-signaling paradigm.

quant-ph↗

arXiv2020

Circulant matrices with orthogonal rows and off-diagonal entries of absolute value $1$

It is known that a real symmetric circulant matrix with diagonal entries $d\geq0$, off-diagonal entries $\pm1$ and orthogonal rows exists only of order $2d+2$ (and trivially of order $1$) [Turek and Goyeneche 2019]. In this paper we consider a complex Hermitian analogy of those matrices. That is, we study the existence and construction of Hermitian circulant matrices having orthogonal rows, diagonal entries $d\geq0$ and any complex entries of absolute value $1$ off the diagonal. As a particular case, we consider matrices whose off-diagonal entries are 4th roots of unity; we prove that the order of any such matrix with $d$ different from an odd integer is $n=2d+2$. We also discuss a similar problem for symmetric circulant matrices defined over finite rings $\mathbb{Z}_m$. As an application of our results, we show a close connection to mutually unbiased bases, an important open problem in quantum information theory.

math.CO↗

arXiv2019

Iso-entangled mutually unbiased bases, symmetric quantum measurements and mixed-state designs

Discrete structures in Hilbert space play a crucial role in finding optimal schemes for quantum measurements. We solve the problem whether a complete set of five iso-entangled mutually unbiased bases exists in dimension four, providing an explicit analytical construction. The reduced density matrices of these $20$ pure states forming this generalized quantum measurement form a regular dodecahedron inscribed in a sphere of radius $\sqrt{3/20}$ located inside the Bloch ball of radius $1/2$. Such a set forms a mixed-state $2$-design --- a discrete set of quantum states with the property that the mean value of any quadratic function of density matrices is equal to the integral over the entire set of mixed states with respect to the flat Hilbert-Schmidt measure. We establish necessary and sufficient conditions mixed-state designs need to satisfy and present general methods to construct them. Furthermore, it is shown that partial traces of a projective design in a composite Hilbert space form a mixed-state design, while decoherence of elements of a projective design yields a design in the classical probability simplex. We identify a distinguished two-qubit orthogonal basis such that four reduced states are evenly distributed inside the Bloch ball and form a mixed-state $2$-design.

quant-ph↗

arXiv2019

Tight Frames, Hadamard Matrices and Zauner's Conjecture

We show that naturally associated to a SIC (symmetric informationally complete positive operator valued measure or SIC-POVM) in dimension d there are a number of higher dimensional structures: specifically a projector and a complex Hadamard matrix in dimension d squared and a pair of ETFs (equiangular tight frames) in dimensions d(d-1)/2, d(d+1)/2. We also show that a WH (Weyl Heisenberg covariant) SIC in odd dimension d is naturally associated to a pair of symmetric tight fusion frames in dimension d. We deduce two relaxations of the WH SIC existence problem. We also find a reformulation of the problem in which the number of equations is fewer than the number of variables. Finally, we show that in at least four cases the structures associated to a SIC lie on continuous manifolds of such structures. In two of these cases the manifolds are non-linear. Restricted defect calculations are consistent with this being true for the structures associated to every known SIC with d between 3 and 16, suggesting it may be true for all d greater than 2.

quant-ph↗

arXiv2019

Quantum circuits for maximally entangled states

We design a series of quantum circuits that generate absolute maximally entangled (AME) states to benchmark a quantum computer. A relation between graph states and AME states can be exploited to optimize the structure of the circuits and minimize their depth. Furthermore, we find that most of the provided circuits obey majorization relations for every partition of the system, and at every step of the quantum computation. The rational for our approach is to benchmark quantum computers with maximal useful entanglement, which can be used to implement multipartite quantum protocols.

quant-ph↗

arXiv2019

A generalization of circulant Hadamard and conference matrices

We study the existence and construction of circulant matrices $C$ of order $n\geq2$ with diagonal entries $d\geq0$, off-diagonal entries $\pm1$ and mutually orthogonal rows. These matrices generalize circulant conference ($d=0$) and circulant Hadamard ($d=1$) matrices. We demonstrate that matrices $C$ exist for every order $n$ and for $d$ chosen such that $n=2d+2$, and we find all solutions $C$ with this property. Furthermore, we prove that if $C$ is symmetric, or $n-1$ is prime, or $d$ is not an odd integer, then necessarily $n=2d+2$. Finally, we conjecture that the relation $n=2d+2$ holds for every matrix $C$, which generalizes the circulant Hadamard conjecture. We support the proposed conjecture by computing all the existing solutions up to $n=50$.

math.CO↗

arXiv2018

Steering is an essential feature of non-locality in quantum theory

A physical theory is called non-local when observers can produce instantaneous effects over distant systems. Non-local theories rely on two fundamental effects: local uncertainty relations and steering of physical states at a distance. In quantum mechanics, the former one dominates the other in a well-known class of non-local games known as XOR games. In particular, optimal quantum strategies for XOR games are completely determined by the uncertainty principle alone. This breakthrough result has yielded the fundamental open question whether optimal quantum strategies are always restricted by local uncertainty principles, with entanglement-based steering playing no role. In this work, we provide a negative answer to the question, showing that both steering and uncertainty relations play a fundamental role in determining optimal quantum strategies for non-local games. Our theoretical findings are supported by an experimental implementation with entangled photons.

quant-ph↗

arXiv2018

Coarse-grained entanglement classification through orthogonal arrays

Classification of entanglement in multipartite quantum systems is an open problem solved so far only for bipartite systems and for systems composed of three and four qubits. We propose here a coarse-grained classification of entanglement in systems consisting of $N$ subsystems with an arbitrary number of internal levels each, based on properties of orthogonal arrays with $N$ columns. In particular, we investigate in detail a subset of highly entangled pure states which contains all states defining maximum distance separable codes. To illustrate the methods presented, we analyze systems of four and five qubits, as well as heterogeneous tripartite systems consisting of two qubits and one qutrit or one qubit and two qutrits.

math.CO↗

arXiv2018

Entanglement properties of multipartite informationally complete quantum measurements

We analyze tight informationally complete measurements for arbitrarily large multipartite systems and study their configurations of entanglement. We demonstrate that tight measurements cannot be exclusively composed neither of fully separable nor maximally entangled states. We establish an upper bound on the maximal number of fully separable states allowed by tight measurements and investigate the distinguished case, in which every measurement operator carries the same amount of entanglement. Furthermore, we introduce the notion of nested tight measurements, i.e. multipartite tight informationally complete measurements such that every reduction to a certain number of parties induces a lower dimensional tight measurement, proving that they exist for any number of parties and internal levels.

quant-ph↗