Searcharxiv⌕ Search

arXiv subjects

Alessandro Chiesa

Publications and source records attributed to Alessandro Chiesa.

36 records · Page 2Linked to original sources
arXiv2021

Unravelling the Spin Dynamics of Molecular Nanomagnets with Four-Dimensional Inelastic Neutron Scattering

Molecular Nanomagnets have attracted the attention of the scientific community since the rich physics behind their magnetic behaviour make them ideal test-beds for fundamental concepts in quantum mechanics. Sophisticated experiments and targeted research activities have also unveiled their potential for several technological applications. Inelastic neutron scattering is a powerful and widely used technique to investigate the properties of these systems. The new generation of spectrometers, equipped with arrays of position-sensitive detectors, enable to efficiently measure the neutron cross-sections as a function of energy and of the three component of the momentum transfer vector Q, in vast portions of the reciprocal space. Exploiting these capabilities together with the availability of sufficiently large single-crystal samples of MNMs, it is now possible to obtain an unprecedented insight into the coherent spin dynamics of these molecular clusters. This is witnessed by several recent results, that we present in this review. By using the benchmark system Cr$_8$, it has been demonstrated that the richness of the four-dimensional inelastic neutrons scattering technique enables to extract dynamical correlation functions directly from the data. This technique has been also applied to the archetypical single-molecule magnet Mn$_{12}$ to unambiguously characterise its Spin Hamiltonian as well as to portray the entanglement between molecular qubits in (Cr$_7$Ni)$_2$.

cond-mat.mes-hall↗
arXiv2021

Magnetic properties of transition metal dimers probed by inelastic neutron scattering

The physical characterisation and understanding of molecular magnetic materials is one of the most important steps towards the integration of such systems in hybrid spintronic devices. Amongst the many characterisation techniques employed in such a task, Inelastic Neutron Scattering (INS) stands as one of the most powerful and sensitive tools to investigate their spin dynamics. Herein, the magnetic properties and spin dynamics of two dinuclear complexes, namely [(M(hfacac)$_2$)$_2$(bpym)] (where M = Ni$^{2+}$, Co$^{2+}$, abbreviated in the following as Ni$_2$, Co$_2$) are reported. These are model systems that could constitute fundamental units of future spintronic devices. By exploiting the highly sensitive IN5 Cold INS spectrometer, we are able to gain a deep insight into the spin dynamics of Ni$_2$ and to fully obtain the microscopic spin Hamiltonian parameters; while for Co$_2$, a multitude of INS transitions are observed demonstrating the complexity of the magnetic properties of octahedral cobalt-based systems.

cond-mat.mes-hall↗
arXiv2020

Quantum computers as universal quantum simulators: state-of-art and perspectives

The past few years have witnessed the concrete and fast spreading of quantum technologies for practical computation and simulation. In particular, quantum computing platforms based on either trapped ions or superconducting qubits have become available for simulations and benchmarking, with up to few tens of qubits that can be reliably initialized, controlled, and measured. The present review aims at giving a comprehensive outlook on the state of art capabilities offered from these near-term noisy devices as universal quantum simulators, i.e. programmable quantum computers potentially able to calculate the time evolution of many physical models. First, we give a pedagogic overview on the basic theoretical background pertaining digital quantum simulations, with a focus on hardware-dependent mapping of spin-type Hamiltonians into the corresponding quantum circuit model as a key initial step towards simulating more complex models. Then, we review the main experimental achievements obtained in the last decade regarding the digital quantum simulation of such spin models, mostly employing the two leading quantum architectures. We compare their performances and outline future challenges, also in view of prospective hybrid technologies, towards the ultimate goal of reaching the long sought quantum advantage for the simulation of complex many body models in the physical sciences.

quant-ph↗
arXiv2019

Coherent manipulation of a molecular Ln-based nuclear qudit coupled to an electron qubit

We demonstrate that the [Yb(trensal)] molecule is a prototypical coupled electronic qubit-nuclear qudit system. The combination of noise-resilient nuclear degrees of freedom and large reduction of nutation time induced by electron-nuclear mixing enables coherent manipulation of this qudit by radio-frequency pulses. Moreover, the multi-level structure of the qudit is exploited to encode and operate a qubit with embedded basic quantum error correction.

cond-mat.mes-hall↗
arXiv2019

First-principles many-body models for electron transport through molecular nanomagnets

Impressive advances in the field of molecular spintronics allow one to study electron transport through individual magnetic molecules embedded between metallic leads in the purely quantum regime of single electron tunneling. Besides fundamental interest, this experimental setup, in which a single molecule is manipulated by electronic means, provides the elementary units of possible forthcoming technological applications, ranging from spin valves to transistors and qubits for quantum information processing. Theoretically, while for weakly correlated molecular junctions established first-principles techniques do enable the system-specific description of transport phenomena, methods of similar power and flexibility are still lacking for junctions involving strongly correlated molecular nanomagnets. Here we propose an efficient scheme based on the ab initio construction of material-specific Hubbard models and on the master-equation formalism. We apply this approach to a representative case, the Ni$_2$ molecular spin dimer, in the regime of weak molecule-electrode coupling, the one relevant for quantum-information applications. Our approach allows us to study in a realistic setting many-body effects such as current suppression and negative differential conductance. We think that this method has the potential for becoming a very useful tool for describing transport phenomena in strongly correlated molecules.

cond-mat.str-el↗
arXiv2018

On cycles of pairing-friendly elliptic curves

A cycle of elliptic curves is a list of elliptic curves over finite fields such that the number of points on one curve is equal to the size of the field of definition of the next, in a cyclic way. We study cycles of elliptic curves in which every curve is pairing-friendly. These have recently found notable applications in pairing-based cryptography, for instance in improving the scalability of distributed ledger technologies. We construct a new cycle of length 4 consisting of MNT curves, and characterize all the possibilities for cycles consisting of MNT curves. We rule out cycles of length 2 for particular choices of small embedding degrees. We show that long cycles cannot be constructed from families of curves with the same complex multiplication discriminant, and that cycles of composite order elliptic curves cannot exist. We show that there are no cycles consisting of curves from only the Freeman or Barreto--Naehrig families.

math.NT↗
arXiv2018

Spatial Isolation Implies Zero Knowledge Even in a Quantum World

Zero knowledge plays a central role in cryptography and complexity. The seminal work of Ben-Or et al. (STOC 1988) shows that zero knowledge can be achieved unconditionally for any language in NEXP, as long as one is willing to make a suitable physical assumption: if the provers are spatially isolated, then they can be assumed to be playing independent strategies. Quantum mechanics, however, tells us that this assumption is unrealistic, because spatially-isolated provers could share a quantum entangled state and realize a non-local correlated strategy. The MIP* model captures this setting. In this work we study the following question: does spatial isolation still suffice to unconditionally achieve zero knowledge even in the presence of quantum entanglement? We answer this question in the affirmative: we prove that every language in NEXP has a 2-prover zero knowledge interactive proof that is sound against entangled provers; that is, NEXP \subseteq ZK-MIP*. Our proof consists of constructing a zero knowledge interactive PCP with a strong algebraic structure, and then lifting it to the MIP* model. This lifting relies on a new framework that builds on recent advances in low-degree testing against entangled strategies, and clearly separates classical and quantum tools. Our main technical contribution consists of developing new algebraic techniques for obtaining unconditional zero knowledge; this includes a zero knowledge variant of the celebrated sumcheck protocol, a key building block in many probabilistic proof systems. A core component of our sumcheck protocol is a new algebraic commitment scheme, whose analysis relies on algebraic complexity theory.

quant-ph↗
arXiv2017

A Zero Knowledge Sumcheck and its Applications

Many seminal results in Interactive Proofs (IPs) use algebraic techniques based on low-degree polynomials, the study of which is pervasive in theoretical computer science. Unfortunately, known methods for endowing such proofs with zero knowledge guarantees do not retain this rich algebraic structure. In this work, we develop algebraic techniques for obtaining zero knowledge variants of proof protocols in a way that leverages and preserves their algebraic structure. Our constructions achieve unconditional (perfect) zero knowledge in the Interactive Probabilistically Checkable Proof (IPCP) model of Kalai and Raz [KR08] (the prover first sends a PCP oracle, then the prover and verifier engage in an Interactive Proof in which the verifier may query the PCP). Our main result is a zero knowledge variant of the sumcheck protocol [LFKN92] in the IPCP model. The sumcheck protocol is a key building block in many IPs, including the protocol for polynomial-space computation due to Shamir [Sha92], and the protocol for parallel computation due to Goldwasser, Kalai, and Rothblum [GKR15]. A core component of our result is an algebraic commitment scheme, whose hiding property is guaranteed by algebraic query complexity lower bounds [AW09,JKRS09]. This commitment scheme can then be used to considerably strengthen our previous work [BCFGRS16] that gives a sumcheck protocol with much weaker zero knowledge guarantees, itself using algebraic techniques based on algorithms for polynomial identity testing [RS05,BW04]. We demonstrate the applicability of our techniques by deriving zero knowledge variants of well-known protocols based on algebraic techniques, including the protocols of Shamir and of Goldwasser, Kalai, and Rothblum, as well as the protocol of Babai, Fortnow, and Lund [BFL91].

cs.CC↗
arXiv2016

On Probabilistic Checking in Perfect Zero Knowledge

We present the first constructions of single-prover proof systems that achieve perfect zero knowledge (PZK) for languages beyond NP, under no intractability assumptions: 1. The complexity class #P has PZK proofs in the model of Interactive PCPs (IPCPs) [KR08], where the verifier first receives from the prover a PCP and then engages with the prover in an Interactive Proof (IP). 2. The complexity class NEXP has PZK proofs in the model of Interactive Oracle Proofs (IOPs) [BCS16,RRR16], where the verifier, in every round of interaction, receives a PCP from the prover. Our constructions rely on succinct simulators that enable us to "simulate beyond NP", achieving exponential savings in efficiency over [BCGV16]. These simulators crucially rely on solving a problem that lies at the intersection of coding theory, linear algebra, and computational complexity, which we call the succinct constraint detection problem, and consists of detecting dual constraints with polynomial support size for codes of exponential block length. Our two results rely on solutions to this problem for fundamental classes of linear codes: * An algorithm to detect constraints for Reed--Muller codes of exponential length. * An algorithm to detect constraints for PCPs of Proximity of Reed--Solomon codes [BS08] of exponential degree. The first algorithm exploits the Raz--Shpilka [RS05] deterministic polynomial identity testing algorithm, and shows, to our knowledge, a first connection of algebraic complexity theory with zero knowledge. Along the way, we give a perfect zero knowledge analogue of the celebrated sumcheck protocol [LFKN92], by leveraging both succinct constraint detection and low-degree testing. The second algorithm exploits the recursive structure of the PCPs of Proximity to show that small-support constraints are "locally" spanned by a small number of small-support constraints.

cs.CC↗
arXiv2015

Knightian Analysis of the Vickrey Mechanism

We analyze the Vickrey mechanism for auctions of multiple identical goods when the players have both Knightian uncertainty over their own valuations and incomplete preferences. In this model, the Vickrey mechanism is no longer dominant-strategy, and we prove that all dominant-strategy mechanisms are inadequate. However, we also prove that, in undominated strategies, the social welfare produced by the Vickrey mechanism in the worst case is not only very good, but also essentially optimal.

cs.GT↗
arXiv2015

Digital quantum simulators in a scalable architecture of hybrid spin-photon qubits

Resolving quantum many-body problems represents one of the greatest challenges in physics and physical chemistry, due to the prohibitively large computational resources that would be required by using classical computers. A solution has been foreseen by directly simulating the time evolution through sequences of quantum gates applied to arrays of qubits, i.e. by implementing a digital quantum simulator. Superconducting circuits and resonators are emerging as an extremely-promising platform for quantum computation architectures, but a digital quantum simulator proposal that is straightforwardly scalable, universal, and realizable with state-of-the-art technology is presently lacking. Here we propose a viable scheme to implement a universal quantum simulator with hybrid spin-photon qubits in an array of superconducting resonators, which is intrinsically scalable and allows for local control. As representative examples we consider the transverse-field Ising model, a spin-1 Hamiltonian, and the two-dimensional Hubbard model; for these, we numerically simulate the scheme by including the main sources of decoherence. In addition, we show how to circumvent the potentially harmful effects of inhomogeneous broadening of the spin systems.

quant-ph↗
arXiv2014

Knightian Robustness from Regret Minimization

We consider auctions in which the players have very limited knowledge about their own valuations. Specifically, the only information that a Knightian player $i$ has about the profile of true valuations, $θ^*$, consists of a set of distributions, from one of which $θ_i^*$ has been drawn. We analyze the social-welfare performance of the VCG mechanism, for unrestricted combinatorial auctions, when Knightian players that either (a) choose a regret-minimizing strategy, or (b) resort to regret minimization only to refine further their own sets of undominated strategies, if needed. We prove that this performance is very good.

cs.GT↗
arXiv2014

Knightian Analysis of the VCG Mechanism in Unrestricted Combinatorial Auctions

We consider auctions in which the players have very limited knowledge about their own valuations. Specifically, the only information that a Knightian player $i$ has about the profile of true valuations, $θ^*$, consists of a set of distributions, from one of which $θ_i^*$ has been drawn. The VCG mechanism guarantees very high social welfare both in single- and multi-good auctions, so long as Knightian players do not select strategies that are dominated. With such Knightian players, however, we prove that the VCG mechanism guarantees very poor social welfare in unrestricted combinatorial auctions.

cs.GT↗
arXiv2014

Knightian Robustness of Single-Parameter Domains

We consider players that have very limited knowledge about their own valuations. Specifically, the only information that a Knightian player $i$ has about the profile of true valuations, $θ^*$, consists of a set of distributions, from one of which $θ_i^*$ has been drawn. We prove a ``robustness'' theorem for Knightian players in single-parameter domains: every mechanism that is weakly dominant-strategy truthful for classical players continues to be well-behaved for Knightian players that choose undominated strategies.

cs.GT↗
arXiv2013

Improved Soundness for QMA with Multiple Provers

We present three contributions to the understanding of QMA with multiple provers: 1) We give a tight soundness analysis of the protocol of [Blier and Tapp, ICQNM '09], yielding a soundness gap Omega(1/N^2). Our improvement is achieved without the use of an instance with a constant soundness gap (i.e., without using a PCP). 2) We give a tight soundness analysis of the protocol of [Chen and Drucker, ArXiV '10], thereby improving their result from a monolithic protocol where Theta(sqrt(N)) provers are needed in order to have any soundness gap, to a protocol with a smooth trade-off between the number of provers k and a soundness gap Omega(k^2/N), as long as k>=Omega(log N). (And, when k=Theta(sqrt(N)), we recover the original parameters of Chen and Drucker.) 3) We make progress towards an open question of [Aaronson et al., ToC '09] about what kinds of NP-complete problems are amenable to sublinear multiple-prover QMA protocols, by observing that a large class of such examples can easily be derived from results already in the PCP literature - namely, at least the languages recognized by a non-deterministic RAMs in quasilinear time.

quant-ph↗
arXiv2011

Knightian Auctions

We study single-good auctions in a setting where each player knows his own valuation only within a constant multiplicative factor δ in (0,1), and the mechanism designer knows δ. The classical notions of implementation in dominant strategies and implementation in undominated strategies are naturally extended to this setting, but their power is vastly different. On the negative side, we prove that no dominant-strategy mechanism can guarantee social welfare that is significantly better than that achievable by assigning the good to a random player. On the positive side, we provide tight upper and lower bounds for the fraction of the maximum social welfare achievable in undominated strategies, whether deterministically or probabilistically.

cs.GT↗
arXiv2011

Going Beyond Pollution Attacks: Forcing Byzantine Clients to Code Correctly

Network coding achieves optimal throughput in multicast networks. However, throughput optimality \emph{relies} on the network nodes or routers to code \emph{correctly}. A Byzantine node may introduce junk packets in the network (thus polluting downstream packets and causing the sinks to receive the wrong data) or may choose coding coefficients in a way that significantly reduces the throughput of the network. Most prior work focused on the problem of Byzantine nodes polluting packets. However, even if a Byzantine node does not pollute packets, he can still affect significantly the throughput of the network by not coding correctly. No previous work attempted to verify if a certain node \emph{coded correctly using random coefficients} over \emph{all} of the packets he was supposed to code over. We provide two novel protocols (which we call PIP and Log-PIP) for detecting whether a node coded correctly over all the packets received (i.e., according to a random linear network coding algorithm). Our protocols enable any node in the network to examine a packet received from another node by running a "verification test". With our protocols, the worst an adversary can do and still pass the packet verification test is in fact equivalent to random linear network coding, which has been shown to be optimal in multicast networks. Our protocols resist collusion among nodes and are applicable to a variety of settings. Our topology simulations show that the throughput in the worst case for our protocol is two to three times larger than the throughput in various adversarial strategies allowed by prior work. We implemented our protocols in C/C++ and Java, as well as incorporated them on the Android platform (Nexus One). Our evaluation shows that our protocols impose modest overhead.

cs.NI↗