ORCID Profile
0000-0002-3396-8427
Current Organisations
University of Technology Sydney
,
Hon Hai Research Institute
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
Research Topics
In Research Link Australia (RLA), "Research Topics" refer to ANZSRC FOR and SEO codes. These topics are either sourced from ANZSRC FOR and SEO codes listed in researchers' related grants or generated by a large language model (LLM) based on their publications.
Top 5 Research Topics
ANZSRC Field of Research (FoR)
Quantum Information, Computation and Communication | Quantum Physics | Mathematical Aspects of Classical Mechanics, Quantum Mechanics and Quantum Information Theory | Mathematical Physics | Photonics, Optoelectronics and Optical Communications | Coding and Information Theory | Classical and Physical Optics |
ANZSRC Socio-Economic Objective (SEO)
Expanding Knowledge in the Physical Sciences | Expanding Knowledge in the Information and Computing Sciences | Information and Communication Services not elsewhere classified | Expanding Knowledge in Engineering | Expanding Knowledge in the Mathematical Sciences | Expanding Knowledge in Technology
Related Links
Publications
Quantum algorithm for estimating
α
Publisher: American Physical Society (APS)
Date: 24-08-2021
Counting stabiliser codes for arbitrary dimension
Publisher: Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften
Date: 06-07-2023
DOI: 10.22331/Q-2023-07-06-1048
Abstract: In this work, we compute the number of [ [ n , k ] ] d stabilizer codes made up of d -dimensional qudits, for arbitrary positive integers d . In a seminal work by Gross \\cite{Gross2006} the number of [ [ n , k ] ] d stabilizer codes was computed for the case when d is a prime (or the power of a prime, i.e., d = p m , but when the qudits are Galois-qudits). The proof in \\cite{Gross2006} is inapplicable to the non-prime case. For our proof, we introduce a group structure to [ [ n , k ] ] d codes, and use this in conjunction with the Chinese remainder theorem to count the number of [ [ n , k ] ] d codes. Our work overlaps with \\cite{Gross2006} when d is a prime and in this case our results match exactly, but the results differ for the more generic case. Despite that, the overall order of magnitude of the number of stabilizer codes scales agnostic of whether the dimension is prime or non-prime. This is surprising since the method employed to count the number of stabilizer states (or more generally stabilizer codes) depends on whether d is prime or not. The cardinality of stabilizer states, which was so far known only for the prime-dimensional case (and the Galois qudit prime-power dimensional case) plays an important role as a quantifier in many topics in quantum computing. Salient among these are the resource theory of magic, design theory, de Finetti theorem for stabilizer states, the study and optimisation of the classical simulability of Clifford circuits, the study of quantum contextuality of small-dimensional systems and the study of Wigner-functions. Our work makes available this quantifier for the generic case, and thus is an important step needed to place results for quantum computing with non-prime dimensional quantum systems on the same pedestal as prime-dimensional systems.
Quantum circuit architecture search for variational quantum algorithms
Publisher: Springer Science and Business Media LLC
Date: 23-05-2022
DOI: 10.1038/S41534-022-00570-Y
Abstract: Variational quantum algorithms (VQAs) are expected to be a path to quantum advantages on noisy intermediate-scale quantum devices. However, both empirical and theoretical results exhibit that the deployed ansatz heavily affects the performance of VQAs such that an ansatz with a larger number of quantum gates enables a stronger expressivity, while the accumulated noise may render a poor trainability. To maximally improve the robustness and trainability of VQAs, here we devise a resource and runtime efficient scheme termed quantum architecture search (QAS). In particular, given a learning task, QAS automatically seeks a near-optimal ansatz (i.e., circuit architecture) to balance benefits and side-effects brought by adding more noisy quantum gates to achieve a good performance. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks. In the problems studied, numerical and experimental results show that QAS cannot only alleviate the influence of quantum noise and barren plateaus but also outperforms VQAs with pre-selected ansatze.
One-Shot Capacity Bounds on the Simultaneous Transmission of Classical and Quantum Information
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2020
Exponential decay of matrix Φ-entropies on Markov semigroups with applications to dynamical evolutions of quantum ensembles
Publisher: AIP Publishing
Date: 09-2017
DOI: 10.1063/1.5000846
Abstract: In this work, we extend the theory of quantum Markov processes on a single quantum state to a broader theory that covers Markovian evolution of an ensemble of quantum states, which generalizes Lindblad’s formulation of quantum dynamical semigroups. Our results establish the equivalence between an exponential decrease of the matrix Φ-entropies and the Φ-Sobolev inequalities, which allows us to characterize the dynamical evolution of a quantum ensemble to its equilibrium. In particular, we study the convergence rates of two special semigroups, namely, the depolarizing channel and the phase-d ing channel. In the former, since there exists a unique equilibrium state, we show that the matrix Φ-entropy of the resulting quantum ensemble decays exponentially as time goes on. Consequently, we obtain a stronger notion of monotonicity of the Holevo quantity—the Holevo quantity of the quantum ensemble decays exponentially in time and the convergence rate is determined by the modified log-Sobolev inequalities. However, in the latter, the matrix Φ-entropy of the quantum ensemble that undergoes the phase-d ing Markovian evolution generally will not decay exponentially. There is no classical analogy for these different equilibrium situations. Finally, we also study a statistical mixing of Markov semigroups on matrix-valued functions. We can explicitly calculate the convergence rate of a Markovian jump process defined on Boolean hypercubes and provide upper bounds to the mixing time.
Publicness, Privacy and Confidentiality in the Single-Serving Quantum Broadcast Channel
Publisher: IEEE
Date: 07-2019
Entanglement-Assisted Quantum Turbo Codes
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2014
On the learnability of quantum neural networks
Publisher: Research Square Platform LLC
Date: 25-09-2020
DOI: 10.21203/RS.3.RS-80242/V1
Abstract: Quantum neural network (QNN), or equivalently, the variational quantum circuits with a gradient-based classical optimizer, has been broadly applied to many experimental proposals for noisy intermediate scale quantum (NISQ) devices. However, the learning capability of QNN remains largely unknown due to the non-convex optimization landscape, the measurement error, and the unavoidable gate noise introduced by NISQ machines. In this study, we theoretically explore the learnability of QNN from the perspective of the trainability and generalization. Particularly, we derive the convergence performance of QNN under the NISQ setting, and identify classes of computationally hard concepts that can be efficiently learned by QNN. Our results demonstrate that large gate noise, few quantum measurements, and deep circuit depth will lead to poor convergence rates of QNN towards the empirical risk minimization. Moreover, we prove that any concept class, which is efficiently learnable by a restricted quantum statistical query (QSQ) learning model, can also be efficiently learned by QNN. Since the restricted QSQ learning model can tackle certain problems such as parity learning with a runtime speedup, our result suggests that QNN established on NISQ devices will retain the quantum advantage. Our work provides the theoretical guidance for developing advanced QNNs and opens up avenues for exploring quantum advantages using NISQ devices.
Relating the Resource Theories of Entanglement and Quantum Coherence
Publisher: American Physical Society (APS)
Date: 08-07-2016
Public and private communication with a quantum channel and a secret key
Publisher: American Physical Society (APS)
Date: 05-08-2009
Quantum-to-classical rate distortion coding
Publisher: AIP Publishing
Date: 04-2013
DOI: 10.1063/1.4798396
Abstract: We establish a theory of quantum-to-classical rate distortion coding. In this setting, a sender Alice has many copies of a quantum information source. Her goal is to transmit a classical description of the source, obtained by performing a measurement on it, to a receiver Bob, up to some specified level of distortion. We derive a single-letter formula for the minimum rate of classical communication needed for this task. We also evaluate this rate in the case in which Bob has some quantum side information about the source. Our results imply that, in general, Alice's best strategy is a non-classical one, in which she performs a collective measurement on successive outputs of the source.
Matrix Poincaré, Φ-Sobolev inequalities, and quantum ensembles
Publisher: AIP Publishing
Date: 03-2019
DOI: 10.1063/1.5035381
Abstract: Sobolev-type inequalities have been extensively studied in the frameworks of real-valued functions and non-commutative Lp spaces, and have proven useful in bounding the time evolution of classical/quantum Markov processes, among many other applications. In this paper, we consider yet another fundamental setting—matrix-valued functions—and prove new Sobolev-type inequalities for them. Our technical contributions are two-fold: (i) we establish a series of matrix Poincaré inequalities for separably convex functions and general functions with Gaussian unitary ensembles inputs and (ii) we derive Φ-Sobolev inequalities for matrix-valued functions defined on Boolean hypercubes and for those with Gaussian distributions. Our results recover the corresponding classical inequalities (i.e., real-valued functions) when the matrix has one dimension. Finally, as an application of our technical outcomes, we derive the upper bounds for a fundamental entropic quantity—the Holevo quantity—in quantum information science since classical-quantum channels are a special instance of matrix-valued functions. This is obtained through the equivalence between the constants in the strong data processing inequality and the Φ-Sobolev inequality.
A novel channel interference identification
Publisher: IEEE
Date: 2002
Correcting Quantum Errors with Entanglement
Publisher: American Association for the Advancement of Science (AAAS)
Date: 20-10-2006
Abstract: We show how entanglement shared between encoder and decoder can simplify the theory of quantum error correction. The entanglement-assisted quantum codes we describe do not require the dual-containing constraint necessary for standard quantum error–correcting codes, thus allowing us to “quantize” all of classical linear coding theory. In particular, efficient modern classical codes that attain the Shannon capacity can be made into entanglement-assisted quantum codes attaining the hashing bound (closely related to the quantum capacity). For systems without large amounts of shared entanglement, these codes can also be used as catalytic codes, in which a small amount of initial entanglement enables quantum communication.
Randomized Benchmarking for Non-Markovian Noise
Publisher: American Physical Society (APS)
Date: 13-12-2021
One-shot Capacity Bounds on the Simultaneous Transmission of Public and Private Information Over Quantum Channels
Publisher: IEEE
Date: 06-2018
One-Shot Hybrid State Redistribution
Publisher: Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften
Date: 30-05-2022
DOI: 10.22331/Q-2022-05-30-724
Abstract: We consider state redistribution of a "hybrid" information source that has both classical and quantum components. The sender transmits classical and quantum information at the same time to the receiver, in the presence of classical and quantum side information both at the sender and at the decoder. The available resources are shared entanglement, and noiseless classical and quantum communication channels. We derive one-shot direct and converse bounds for these three resources, represented in terms of the smooth conditional entropies of the source state. Various coding theorems for two-party source coding problems are systematically obtained by reduction from our results, including the ones that have not been addressed in previous literature.
Source compression with a quantum helper
Publisher: IEEE
Date: 06-2015
Moderate Deviation Analysis for Classical-Quantum Channels and Quantum Hypothesis Testing
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2018
Catalytic Quantum Error Correction
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2014
Non-Asymptotic Classical Data Compression With Quantum Side Information
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2021
Entanglement-assisted quantum quasicyclic low-density parity-check codes
Publisher: American Physical Society (APS)
Date: 30-03-2009
Simple bounds for one-shot pure-state distillation in general resource theories
Publisher: American Physical Society (APS)
Date: 04-11-2020
Characterizations of matrix and operator-valued Φ-entropies, and operator Efron–Stein inequalities
Publisher: The Royal Society
Date: 03-2016
Abstract: We derive new characterizations of the matrix Φ-entropy functionals introduced in Chen & Tropp (Chen, Tropp 2014 Electron. J. Prob. 19 , 1–30. ( doi:10.1214/ejp.v19-2964 )). These characterizations help us to better understand the properties of matrix Φ-entropies, and are a powerful tool for establishing matrix concentration inequalities for random matrices. Then, we propose an operator-valued generalization of matrix Φ-entropy functionals, and prove the subadditivity under Löwner partial ordering. Our results demonstrate that the subadditivity of operator-valued Φ-entropies is equivalent to the convexity. As an application, we derive the operator Efron–Stein inequality.
Quantum noise protects quantum classifiers against adversaries
Publisher: American Physical Society (APS)
Date: 27-05-2021
The Expressive Power of Parameterized Quantum Circuits
Publisher: American Physical Society (APS)
Date: 22-07-2018
General entanglement-assisted quantum error-correcting codes
Publisher: IEEE
Date: 06-2007
General entanglement-assisted quantum error-correcting codes
Publisher: American Physical Society (APS)
Date: 19-12-2007
Entropy power inequalities for qudits
Publisher: AIP Publishing
Date: 05-2016
DOI: 10.1063/1.4950785
Abstract: Shannon’s entropy power inequality (EPI) can be viewed as a statement of concavity of an entropic function of a continuous random variable under a scaled addition rule: f(a X+1−a Y)≥af(X)+(1−a)f(Y)∀ a∈[0,1]. Here, X and Y are continuous random variables and the function f is either the differential entropy or the entropy power. König and Smith [IEEE Trans. Inf. Theory 60(3), 1536–1548 (2014)] and De Palma, Mari, and Giovannetti [Nat. Photonics 8(12), 958–964 (2014)] obtained quantum analogues of these inequalities for continuous-variable quantum systems, where X and Y are replaced by bosonic fields and the addition rule is the action of a beam splitter with transmissivity a on those fields. In this paper, we similarly establish a class of EPI analogues for d-level quantum systems (i.e., qudits). The underlying addition rule for which these inequalities hold is given by a quantum channel that depends on the parameter a ∈ [0, 1] and acts like a finite-dimensional analogue of a beam splitter with transmissivity a, converting a two-qudit product state into a single qudit state. We refer to this channel as a partial swap channel because of the particular way its output interpolates between the states of the two qudits in the input as a is changed from zero to one. We obtain analogues of Shannon’s EPI, not only for the von Neumann entropy and the entropy power for the output of such channels, but also for a much larger class of functions. This class includes the Rényi entropies and the subentropy. We also prove a qudit analogue of the entropy photon number inequality (EPnI). Finally, for the subclass of partial swap channels for which one of the qudit states in the input is fixed, our EPIs and EPnI yield lower bounds on the minimum output entropy and upper bounds on the Holevo capacity.
Concavity of the Auxiliary Function for Classical-Quantum Channels
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2016
Asymmetric Quantum Concatenated and Tensor Product Codes With Large Z-Distances
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2021
Revisiting the optimal detection of quantum information
Publisher: American Physical Society (APS)
Date: 27-08-2013
Error Exponents and Strong Converse Exponents for Classical Data Compression with Quantum Side Information
Publisher: IEEE
Date: 06-2018
One-Shot Trade-Off Bounds for State Redistribution of Classical-Quantum Sources
Publisher: IEEE
Date: 06-2020
NP-hardness of decoding quantum error-correction codes
Publisher: American Physical Society (APS)
Date: 31-05-2011
Erratum: Expressive power of parametrized quantum circuits [Phys. Rev. Research 2, 033125 (2020)]
Publisher: American Physical Society (APS)
Date: 24-06-2022
Quantum Rate Distortion, Reverse Shannon Theorems, and Source-Channel Separation
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2013
Partial Equivalence Checking of Quantum Circuits
Publisher: IEEE
Date: 09-2022
A complete MacWilliams theorem for convolutional codes
Publisher: IEEE
Date: 11-2014
Channel Simulation and Coded Source Compression
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2016
c3-Locally Testable Codes from Lossless Expanders
Publisher: IEEE
Date: 26-06-2022
Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver
Publisher: American Physical Society (APS)
Date: 14-03-2022
Single-Serving Quantum Broadcast Channel With Common, Individualized, and Confidential Messages
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2020
Trading classical communication, quantum communication, and entanglement in quantum Shannon theory
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 09-2010
Properties of Noncommutative Rényi and Augustin Information
Publisher: Springer Science and Business Media LLC
Date: 04-02-2022
Matrix Infinitely Divisible Series: Tail Inequalities and Their Applications
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2020
Towards a general framework of Randomized Benchmarking incorporating non-Markovian Noise
Publisher: Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften
Date: 12-2022
DOI: 10.22331/Q-2022-12-01-868
Abstract: The rapid progress in the development of quantum devices is in large part due to the availability of a wide range of characterization techniques allowing to probe, test and adjust them. Nevertheless, these methods often make use of approximations that hold in rather simplistic circumstances. In particular, assuming that error mechanisms stay constant in time and have no dependence in the past, is something that will be impossible to do as quantum processors continue scaling up in depth and size. We establish a theoretical framework for the Randomized Benchmarking protocol encompassing temporally-correlated, so-called non-Markovian noise, at the gate level, for any gate set belonging to a wide class of finite groups. We obtain a general expression for the Average Sequence Fidelity (ASF) and propose a way to obtain average gate fidelities of full non-Markovian noise processes. Moreover, we obtain conditions that are fulfilled when an ASF displays authentic non-Markovian deviations. Finally, we show that even though gate-dependence does not translate into a perturbative term within the ASF, as in the Markovian case, the non-Markovian sequence fidelity nevertheless remains stable under small gate-dependent perturbations.
The information-theoretic costs of simulating quantum measurements
Publisher: IOP Publishing
Date: 18-10-2012
Entanglement-assisted capacity regions and protocol designs for quantum multiple-access channels
Publisher: Springer Science and Business Media LLC
Date: 19-05-2021
DOI: 10.1038/S41534-021-00412-3
Abstract: We solve the entanglement-assisted (EA) classical capacity region of quantum multiple-access channels (MACs) with an arbitrary number of senders. As an ex le, we consider the bosonic thermal-loss MAC and solve the one-shot capacity region enabled by an entanglement source composed of sender-receiver pairwise two-mode squeezed vacuum states. The EA capacity region is strictly larger than the capacity region without entanglement-assistance. With two-mode squeezed vacuum states as the source and phase modulation as the encoding, we also design practical receiver protocols to realize the entanglement advantages. Four practical receiver designs, based on optical parametric lifiers, are given and analyzed. In the parameter region of a large noise background, the receivers can enable a simultaneous rate advantage of 82.0% for each sender. Due to teleportation and superdense coding, our results for EA classical communication can be directly extended to EA quantum communication at half of the rates. Our work provides a unique and practical network communication scenario where entanglement can be beneficial.
Entanglement boosts quantum turbo codes
Publisher: IEEE
Date: 07-2011
The Conditional Common Information in Classical and Quantum Secret Key Distillation
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2018
Learnability of Quantum Neural Networks
Publisher: American Physical Society (APS)
Date: 17-11-2021
The quantum dynamic capacity formula of a quantum channel
Publisher: Springer Science and Business Media LLC
Date: 24-09-2011
One-shot assisted concentration of coherence
Publisher: IOP Publishing
Date: 14-09-2018
Duality Between Source Coding With Quantum Side Information and Classical-Quantum Channel Coding
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2022
The apex of the family tree of protocols: optimal rates and resource inequalities
Publisher: IOP Publishing
Date: 30-09-2011
Sphere-packing bound for symmetric classical-quantum channels
Publisher: IEEE
Date: 06-2017
Quantum Gram-Schmidt processes and their application to efficient state readout for quantum algorithms
Publisher: American Physical Society (APS)
Date: 11-2021
Second-order asymptotics for quantum hypothesis testing in settings beyond i.i.d.—quantum lattice systems and more
Publisher: AIP Publishing
Date: 06-2016
DOI: 10.1063/1.4953582
Abstract: Quantum Stein’s lemma is a cornerstone of quantum statistics and concerns the problem of correctly identifying a quantum state, given the knowledge that it is one of two specific states (ρ or σ). It was originally derived in the asymptotic i.i.d. setting, in which arbitrarily many (say, n) identical copies of the state (ρ⊗n or σ⊗n) are considered to be available. In this setting, the lemma states that, for any given upper bound on the probability αn of erroneously inferring the state to be σ, the probability βn of erroneously inferring the state to be ρ decays exponentially in n, with the rate of decay converging to the relative entropy of the two states. The second order asymptotics for quantum hypothesis testing, which establishes the speed of convergence of this rate of decay to its limiting value, was derived in the i.i.d. setting independently by Tomamichel and Hayashi, and Li. We extend this result to settings beyond i.i.d. Ex les of these include Gibbs states of quantum spin systems (with finite-range, translation-invariant interactions) at high temperatures, and quasi-free states of fermionic lattice gases.
Optimal Trading of Classical Communication, Quantum Communication, and Entanglement
Publisher: Springer Berlin Heidelberg
Date: 2009
NEW CLASS OF QUANTUM CODES CONSTRUCTED FROM CYCLIC DIFFERENCE SET
Publisher: World Scientific Pub Co Pte Lt
Date: 02-2012
DOI: 10.1142/S0219749912500153
Abstract: We introduce joint difference sets as a generalization of cyclic difference sets, and we construct a new class of quantum error-correcting codes (QECCs) from these joint difference sets. The main benefits of our method are as follows. First, we can construct quantum codes that are both high rate and with large block length, while maintaining good performance. Second, the density of constructed quantum parity check matrix can approach zero when the code length is very large. This allows us to use a simple iterative decoding algorithm. Interestingly, our method yields the well-known [5,1,3] QECC.
Sphere-packing bound for classical-quantum channels
Publisher: IEEE
Date: 11-2017
Quantifying Resources in General Resource Theory with Catalysts
Publisher: American Physical Society (APS)
Date: 09-11-2018
Noisy Quantum State Redistribution With Promise and the Alpha-Bit
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2020
Experimental Quantum Generative Adversarial Networks for Image Generation
Publisher: American Physical Society (APS)
Date: 27-08-2021
PassivePT
Publisher: American Physical Society (APS)
Date: 05-11-2015
Inequivalent multipartite coherence classes and two operational coherence monotones
Publisher: American Physical Society (APS)
Date: 03-04-2019
Superadditivity in Trade-Off Capacities of Quantum Channels
Publisher: IEEE
Date: 06-2018
Entanglement-Assisted Capacity of Quantum Multiple-Access Channels
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-2008
Quantum Sphere-Packing Bounds With Polynomial Prefactors
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-2019
Decoding quantum information via the Petz recovery map
Publisher: AIP Publishing
Date: 08-2016
DOI: 10.1063/1.4961515
Abstract: We obtain a lower bound on the maximum number of qubits, Qn, ε(N), which can be transmitted over n uses of a quantum channel N, for a given non-zero error threshold ε. To obtain our result, we first derive a bound on the one-shot entanglement transmission capacity of the channel, and then compute its asymptotic expansion up to the second order. In our method to prove this achievability bound, the decoding map, used by the receiver on the output of the channel, is chosen to be the Petz recovery map (also known as the transpose channel). Our result, in particular, shows that this choice of the decoder can be used to establish the coherent information as an achievable rate for quantum information transmission. Applying our achievability bound to the 50-50 erasure channel (which has zero quantum capacity), we find that there is a sharp error threshold above which Qn, ε(N) scales as n.
Undetermined states: how to find them and their applications
Publisher: Springer Science and Business Media LLC
Date: 03-12-2010
A Smooth Entropy Approach to Quantum Hypothesis Testing and the Classical Capacity of Quantum Channels
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2013
Superadditivity in Trade-Off Capacities of Quantum Channels
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2019
Asymptotic state discrimination and a strict hierarchy in distinguishability norms
Publisher: AIP Publishing
Date: 11-2014
DOI: 10.1063/1.4902027
Abstract: In this paper, we consider the problem of discriminating quantum states by local operations and classical communication (LOCC) when an arbitrarily small amount of error is permitted. This paradigm is known as asymptotic state discrimination, and we derive necessary conditions for when two multipartite states of any size can be discriminated perfectly by asymptotic LOCC. We use this new criterion to prove a gap in the LOCC and separable distinguishability norms. We then turn to the operational advantage of using two-way classical communication over one-way communication in LOCC processing. With a simple two-qubit product state ensemble, we demonstrate a strict majorization of the two-way LOCC norm over the one-way norm.
When Do Local Operations and Classical Communication Suffice for Two-Qubit State Discrimination?
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2014
Construction and Performance of Quantum Burst Error Correction Codes for Correlated Errors
Publisher: IEEE
Date: 06-2018
Entanglement-Assisted Communication of Classical and Quantum Information
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 09-2010
Moderate deviations for quantum hypothesis testing and a martingale inequality
Publisher: IEEE
Date: 06-2017
Multicasting homogeneous and heterogeneous quantum states in quantum networks
Publisher: Elsevier BV
Date: 12-2010
Partially Concatenated Calderbank-Shor-Steane Codes Achieving the Quantum Gilbert-Varshamov Bound Asymptotically
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Classical enhancement of quantum-error-correcting codes
Publisher: American Physical Society (APS)
Date: 21-07-2008
Entanglement-assisted concatenated quantum codes
Publisher: Proceedings of the National Academy of Sciences
Date: 10-06-2022
Abstract: Entanglement-assisted concatenated quantum codes (EACQCs), constructed by concatenating two quantum codes, are proposed. These EACQCs show significant advantages over standard concatenated quantum codes (CQCs). First, we prove that, unlike standard CQCs, EACQCs can beat the nondegenerate Hamming bound for entanglement-assisted quantum error-correction codes (EAQECCs). Second, we construct families of EACQCs with parameters better than the best-known standard quantum error-correction codes (QECCs) and EAQECCs. Moreover, these EACQCs require very few Einstein–Podolsky–Rosen (EPR) pairs to begin with. Finally, it is shown that EACQCs make entanglement-assisted quantum communication possible, even if the ebits are noisy. Furthermore, EACQCs can outperform CQCs in entanglement fidelity over depolarizing channels if the ebits are less noisy than the qubits. We show that the error-probability threshold of EACQCs is larger than that of CQCs when the error rate of ebits is sufficiently lower than that of qubits. Specifically, we derive a high threshold of 47% when the error probability of the preshared entanglement is 1% to that of qubits.
Entanglement-assisted quantum error-correcting codes
Publisher: Cambridge University Press
Date: 12-09-2013
Strong converse theorems using Rényi entropies
Publisher: AIP Publishing
Date: 08-2016
DOI: 10.1063/1.4960099
Abstract: We use a Rényi entropy method to prove strong converse theorems for certain information-theoretic tasks which involve local operations and quantum (or classical) communication between two parties. These include state redistribution, coherent state merging, quantum state splitting, measurement compression with quantum side information, randomness extraction against quantum side information, and data compression with quantum side information. The method we employ in proving these results extends ideas developed by Sharma [preprint arXiv:1404.5940 [quant-ph] (2014)], which he used to give a new proof of the strong converse theorem for state merging. For state redistribution, we prove the strong converse property for the boundary of the entire achievable rate region in the (e, q)-plane, where e and q denote the entanglement cost and quantum communication cost, respectively. In the case of measurement compression with quantum side information, we prove a strong converse theorem for the classical communication cost, which is a new result extending the previously known weak converse. For the remaining tasks, we provide new proofs for strong converse theorems previously established using smooth entropies. For each task, we obtain the strong converse theorem from explicit bounds on the figure of merit of the task in terms of a Rényi generalization of the optimal rate. Hence, we identify candidates for the strong converse exponents for each task discussed in this paper. To prove our results, we establish various new entropic inequalities, which might be of independent interest. These involve conditional entropies and mutual information derived from the sandwiched Rényi ergence. In particular, we obtain novel bounds relating these quantities, as well as the Rényi conditional mutual information, to the fidelity of two quantum states.
Entanglement-assisted multiple-access channels: capacity regions and protocol designs
Publisher: IEEE
Date: 12-07-2021
Fully quantum source compression with a quantum helper
Publisher: IEEE
Date: 10-2015
Recent Advances for Quantum Neural Networks in Generative Learning
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
The MacWilliams identity for quantum convolutional codes
Publisher: IEEE
Date: 06-2014
Duality between source coding with quantum side information and c-q channel coding
Publisher: IEEE
Date: 07-2019
Theoretical error performance analysis for variational quantum circuit based functional regression
Publisher: Springer Science and Business Media LLC
Date: 09-01-2023
DOI: 10.1038/S41534-022-00672-7
Abstract: The noisy intermediate-scale quantum devices enable the implementation of the variational quantum circuit (VQC) for quantum neural networks (QNN). Although the VQC-based QNN has succeeded in many machine learning tasks, the representation and generalization powers of VQC still require further investigation, particularly when the dimensionality of classical inputs is concerned. In this work, we first put forth an end-to-end QNN, TTN-VQC, which consists of a quantum tensor network based on a tensor-train network (TTN) for dimensionality reduction and a VQC for functional regression. Then, we aim at the error performance analysis for the TTN-VQC in terms of representation and generalization powers. We also characterize the optimization properties of TTN-VQC by leveraging the Polyak-Lojasiewicz condition. Moreover, we conduct the experiments of functional regression on a handwritten digit classification dataset to justify our theoretical analysis.
A Quantum-inspired Algorithm for General Minimum Conical Hull Problems
Publisher: American Physical Society (APS)
Date: 05-08-2019
Universal coding for transmission of private information
Publisher: AIP Publishing
Date: 12-2010
DOI: 10.1063/1.3521499
Abstract: We consider the scenario in which Alice transmits private classical messages to Bob via a classical-quantum channel, part of whose output is intercepted by an eavesdropper Eve. We prove the existence of a universal coding scheme under which Alice's messages can be inferred correctly by Bob, and yet Eve learns nothing about them. The code is universal in the sense that it does not depend on specific knowledge of the channel. Prior knowledge of the probability distribution on the input alphabet of the channel, and bounds on the corresponding Holevo quantities of the output ensembles at Bob's and Eve's end suffice.
Contractivity properties of a quantum diffusion semigroup
Publisher: AIP Publishing
Date: 2017
DOI: 10.1063/1.4974223
Abstract: We consider a quantum generalization of the classical heat equation and study contractivity properties of its associated semigroup. We prove a Nash inequality and a logarithmic Sobolev inequality. The former leads to an ultracontractivity result. This in turn implies that the largest eigenvalue and the purity of a state with positive Wigner function, evolving under the action of the semigroup, decrease at least inverse polynomially in time, while its entropy increases at least logarithmically in time.
A Grover-search based quantum learning scheme for classification
Publisher: IOP Publishing
Date: 02-2021
Abstract: The hybrid quantum–classical learning scheme provides a prominent way to achieve quantum advantages on near-term quantum devices. A concrete ex le toward this goal is the quantum neural network (QNN), which has been developed to accomplish various supervised learning tasks such as classification and regression. However, there are two central issues that remain obscure when QNN is exploited to accomplish classification tasks. First, a quantum classifier that can well balance the computational cost such as the number of measurements and the learning performance is unexplored. Second, it is unclear whether quantum classifiers can be applied to solve certain problems that outperform their classical counterparts. Here we devise a Grover-search based quantum learning scheme (GBLS) to address the above two issues. Notably, most existing QNN-based quantum classifiers can be seamlessly embedded into the proposed scheme. The key insight behind our proposal is reformulating the classification tasks as the search problem. Numerical simulations exhibit that GBLS can achieve comparable performance with other quantum classifiers under various noise settings, while the required number of measurements is dramatically reduced. We further demonstrate a potential quantum advantage of GBLS over classical classifiers in the measure of query complexity. Our work provides guidance to develop advanced quantum classifiers on near-term quantum devices and opens up an avenue to explore potential quantum advantages in various classification tasks.
Quantum Differentially Private Sparse Regression Learning
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2022
Distributions Attaining Secret Key at a Rate of the Conditional Mutual Information
Publisher: Springer Berlin Heidelberg
Date: 2015
An upper bound on the second order asymptotic expansion for the quantum communication cost of state redistribution
Publisher: AIP Publishing
Date: 05-2016
DOI: 10.1063/1.4949571
Abstract: State redistribution is the protocol in which given an arbitrary tripartite quantum state, with two of the subsystems initially being with Alice and one being with Bob, the goal is for Alice to send one of her subsystems to Bob, possibly with the help of prior shared entanglement. We derive an upper bound on the second order asymptotic expansion for the quantum communication cost of achieving state redistribution with a given finite accuracy. In proving our result, we also obtain an upper bound on the quantum communication cost of this protocol in the one-shot setting, by using the protocol of coherent state merging as a primitive.
Erratum to: The quantum dynamic capacity formula of a quantum channel; Public and private resource trade-offs for a quantum channel
Publisher: Springer Science and Business Media LLC
Date: 07-08-2012
Public and private resource trade-offs for a quantum channel
Publisher: Springer Science and Business Media LLC
Date: 18-10-2011
Adaptively correcting quantum errors with entanglement
Publisher: IEEE
Date: 07-2011
Quantum Rate-Distortion Coding With Auxiliary Resources
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2013
Entanglement generation with a quantum channel and a shared state
Publisher: IEEE
Date: 06-2010
On the MacWilliams Identity for Classical and Quantum Convolutional Codes
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2016
One-Shot Entanglement-Assisted Quantum and Classical Communication
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2013
LocalP T
Publisher: American Physical Society (APS)
Date: 03-04-2014
Quantum speedup in adaptive boosting of binary classification
Publisher: Springer Science and Business Media LLC
Date: 30-12-2020
Round complexity in the local transformations of quantum and classical states
Publisher: Springer Science and Business Media LLC
Date: 12-12-2017
DOI: 10.1038/S41467-017-01887-5
Abstract: In distributed quantum and classical information processing, spatially separated parties operate locally on their respective subsystems, but coordinate their actions through multiple exchanges of public communication. With interaction, the parties can perform more tasks. But how the exact number and order of exchanges enhances their operational capabilities is not well understood. Here we consider the minimum number of communication rounds needed to perform the locality-constrained tasks of entanglement transformation and its classical analog of secrecy manipulation. We provide an explicit construction of both quantum and classical state transformations which, for any given r , can be achieved using r rounds of classical communication exchanges, but no fewer. To show this, we build on the common structure underlying both resource theories of quantum entanglement and classical secret key. Our results reveal that highly complex communication protocols are indeed necessary to fully harness the information-theoretic resources contained in general quantum and classical states.
Secret-key-assisted private classical communication capacity over quantum channels
Publisher: American Physical Society (APS)
Date: 08-10-2008
Properties of Scaled Noncommutative Rényi and Augustin Information
Publisher: IEEE
Date: 07-2019
Classical Analog to Entanglement Reversibility
Publisher: American Physical Society (APS)
Date: 27-08-2015
The Private and Public Correlation Cost of Three Random Variables With Collaboration
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2016
High Performance Entanglement-Assisted Quantum LDPC Codes Need Little Entanglement
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2011
Related Organisations
University Of Cambridge
Location: United Kingdom of Great Britain and Northern Ireland
Related Funding Activities
ARC Future Fellowships - Grant ID: FT140100574
Start Date: 08-2014
End Date: 08-2018
Amount: $678,502.00
Funder: Australian Research Council
View Funded ActivityLinkage Infrastructure, Equipment And Facilities - Grant ID: LE210100040
Start Date: 07-2021
End Date: 12-2023
Amount: $699,664.00
Funder: Australian Research Council
View Funded ActivityDiscovery Projects - Grant ID: DP200102273
Start Date: 03-2020
End Date: 12-2023
Amount: $594,000.00
Funder: Australian Research Council
View Funded Activity