IEEE Transactions on Quantum Engineering最新文献

{"title":"A Grover-Meets-Simon Approach to Match Vector Boolean Functions","authors":"Marco Venere;Alessandro Barenghi;Gerardo Pelosi","doi":"10.1109/TQE.2025.3595275","DOIUrl":"https://doi.org/10.1109/TQE.2025.3595275","url":null,"abstract":"The Boolean matching problem via NP-equivalence requires determining whether two Boolean functions are equivalent or not up to a permutation and negation of the input binary variables. Its solution is a fundamental step in the electronic design automation (EDA) tool chains commonly used for digital circuit design. In fact, the <italic>library-mapping</i> step of an EDA workflow requires matching parts of the gate-level design (<italic>netlist</i>) with the components available in a technology library, considering them as Boolean functions, while taking into account that permutations and negations of input variables can be efficiently implemented through rewiring and the use of inverters. For <inline-formula><tex-math>$n$</tex-math></inline-formula>-to-<inline-formula><tex-math>$n$</tex-math></inline-formula> vector Boolean functions, where <inline-formula><tex-math>$n$</tex-math></inline-formula> is the number of input and output variables, the search space of possible negations and permutations is super-exponential in size, while the <inline-formula><tex-math>$mathcal {O}(n!n2^{2n})$</tex-math></inline-formula> time complexity of classical approaches allows solving only small instances of the NP-problem, often limited to <inline-formula><tex-math>$n$</tex-math></inline-formula>-to-1 Boolean functions (executing <inline-formula><tex-math>$mathcal {O}(n!2^{2n})$</tex-math></inline-formula> bit operations). This work presents a quantum algorithm for matching <inline-formula><tex-math>$n$</tex-math></inline-formula>-to-<inline-formula><tex-math>$n$</tex-math></inline-formula> vector Boolean functions by effectively combining the Grover-meets-Simon approach with an original and novel use of the Simon solver without the constraints imposed by its usual premises. We provide a fully detailed quantum circuit implementing our proposal, calculate its cost by evaluating key performance indicators for circuit synthesis, and show an exponential speedup over classical solutions. Finally, we validate our approach on the Boolean functions included in the ISCAS benchmark suite, which are of practical interest in EDA.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-14"},"PeriodicalIF":4.6,"publicationDate":"2025-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11108706","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144896761","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Simulation of Shor Algorithm for Discrete Logarithm Problems With Comprehensive Pairs of Modulo $p$ and Order $q$","authors":"Kaito Kishi;Junpei Yamaguchi;Tetsuya Izu;Noboru Kunihiro","doi":"10.1109/TQE.2025.3591213","DOIUrl":"https://doi.org/10.1109/TQE.2025.3591213","url":null,"abstract":"The discrete logarithm problem (DLP) over finite fields, commonly used in classical cryptography, has no known polynomial-time algorithm on classical computers. However, Shor has provided its polynomial-time algorithm on quantum computers. Nevertheless, there are only few examples simulating quantum circuits that operate on general pairs of modulo <inline-formula><tex-math>$p$</tex-math></inline-formula> and order <inline-formula><tex-math>$q$</tex-math></inline-formula>. In this article, we constructed such quantum circuits and solved DLPs for all 1860 possible pairs of <inline-formula><tex-math>$p$</tex-math></inline-formula> and <inline-formula><tex-math>$q$</tex-math></inline-formula> up to 32 qubits using a quantum simulator with PRIMEHPC FX700. From this, we obtained and verified values of the success probabilities, which had previously been heuristically analyzed by Ekerå (2019). As a result, the detailed waveform shape of the success probability of Shor's algorithm for solving the DLP, known as a periodic function of order <inline-formula><tex-math>$q$</tex-math></inline-formula>, was clarified. In addition, we generated 1015 quantum circuits for larger pairs of <inline-formula><tex-math>$p$</tex-math></inline-formula> and <inline-formula><tex-math>$q$</tex-math></inline-formula>, extrapolated the circuit sizes obtained, and compared them for <inline-formula><tex-math>$p=2048$</tex-math></inline-formula> bits between safe-prime groups and Schnorr groups. While in classical cryptography, the cipher strength of safe-prime groups and Schnorr groups is the same if <inline-formula><tex-math>$p$</tex-math></inline-formula> is equal, we quantitatively demonstrated how much the strength of the latter decreases to the bit length of <inline-formula><tex-math>$p$</tex-math></inline-formula> in the former when using Shor's quantum algorithm. In particular, it was experimentally and theoretically shown that when a basic adder is used in the addition circuit, the cryptographic strength of a Schnorr group with <inline-formula><tex-math>$p=2048$</tex-math></inline-formula> bits under Shor's algorithm is almost equivalent to that of a safe-prime group with <inline-formula><tex-math>$p=1024$</tex-math></inline-formula> bits.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-12"},"PeriodicalIF":4.6,"publicationDate":"2025-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11087664","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144896789","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Fidelity-Aware Multipath Routing for Multipartite State Distribution in Quantum Networks","authors":"Evan Sutcliffe;Alejandra Beghelli","doi":"10.1109/TQE.2025.3588783","DOIUrl":"https://doi.org/10.1109/TQE.2025.3588783","url":null,"abstract":"We consider the problem of distributing entangled multipartite states across a quantum network with improved distribution rate and fidelity. For this, we propose fidelity-aware multipath routing protocols, assess their performance in terms of the rate and fidelity of the distributed Greenberger–Horne–Zeilinger (GHZ) states, and compare such performance against that of single-path routing. Simulation results show that the proposed multipath routing protocols select routes that require more Bell states compared to single-path routing, but also require fewer rounds of Bell state generation. We also optimized the tradeoff between distribution rate and fidelity by selecting an appropriate cutoff to the quantum memory storage time. Using such a cutoff technique, the proposed multipath protocols can achieve up to an 8.3 times higher distribution rate and up to a 28% improvement in GHZ state fidelity compared to single-path routing. These results show that multipath routing both improves the distribution rates and enhances fidelity for multipartite state distribution.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-18"},"PeriodicalIF":4.6,"publicationDate":"2025-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11079232","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144750969","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Quantum Resource Estimates for Computing Binary Elliptic Curve Discrete Logarithms","authors":"Michael Garn;Angus Kan","doi":"10.1109/TQE.2025.3586541","DOIUrl":"https://doi.org/10.1109/TQE.2025.3586541","url":null,"abstract":"We perform logical and physical resource estimation for computing binary elliptic curve discrete logarithms using Shor's algorithm on fault-tolerant quantum computers. We adopt a windowed approach to design our circuit implementation of the algorithm, which comprises repeated applications of elliptic curve point addition operations and table look-ups. Unlike previous work, the point addition operation is implemented exactly, including all exceptional cases. We provide exact logical gate and qubit counts of our algorithm for cryptographically relevant binary field sizes. Furthermore, we estimate the hardware footprint and runtime of our algorithm executed on surface-code matter-based quantum computers with a baseline architecture, where logical qubits have nearest-neighbor connectivity, and on a surface-code photonic fusion-based quantum computer with an active-volume architecture, which enjoys a logarithmic number of nonlocal connections between logical qubits. At 10<inline-formula><tex-math>$%$</tex-math></inline-formula> threshold and compared to a baseline device with a 1-<inline-formula><tex-math>$mu text{s}$</tex-math></inline-formula> code cycle, our algorithm runs <inline-formula><tex-math>$gtrsim$</tex-math></inline-formula> 2–20 times faster, depending on the operating regime of the hardware and over all considered field sizes, on a photonic active-volume device.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-23"},"PeriodicalIF":4.6,"publicationDate":"2025-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11072281","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144914382","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Control of a Josephson Digital Phase Detector via an SFQ-Based Flux Bias Driver","authors":"Laura Di Marino;Luigi Di Palma;Michele Riccio;Francesco Fienga;Marco Arzeo;Oleg Mukhanov","doi":"10.1109/TQE.2025.3583570","DOIUrl":"https://doi.org/10.1109/TQE.2025.3583570","url":null,"abstract":"Quantum computation requires high-fidelity qubit readout, preserving the quantum state. In the case of superconductings qubits, readout is typically performed using a complex analog experimental setup operating at room temperature, which poses significant technological and economic barriers to large system scalability. An alternative approach is to perform a cryogenic on-chip qubit readout based on a Josephson digital phase detector (JDPD): a flux switchable device capable of digitizing the phase sign of a coherent input. The readout operation includes the flux excitation of the JDPD to evolve from a single- to a double-minima potential. In this work, the effect of the flux bias characteristics on the JDPD performances is studied numerically. To meet the identified requirements that maximize detection fidelity and tackle the engineering challenges, a cryogenic on-chip single flux quantum-based flux bias driver is proposed and discussed.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-8"},"PeriodicalIF":4.6,"publicationDate":"2025-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11052858","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144781922","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Cryo-CMOS Bias-Voltage Generation and Demultiplexing at mK Temperatures for Large-Scale Arrays of Quantum Devices","authors":"Job van Staveren;Luc Enthoven;Peter Luka Bavdaz;Marcel Meyer;Corentin Déprez;Ville Nuutinen;Russell Lake;Davide Degli Esposti;Cornelius Carlsson;Alberto Tosato;Jiang Gong;Bagas Prabowo;Masoud Babaie;Carmen G. Almudever;Menno Veldhorst;Giordano Scappucci;Fabio Sebastiano","doi":"10.1109/TQE.2025.3580377","DOIUrl":"https://doi.org/10.1109/TQE.2025.3580377","url":null,"abstract":"The rapidly growing number of qubits in semiconductor quantum computers requires a scalable control interface, including the efficient generation of dc bias voltages for gate electrodes. To avoid unrealistically complex wiring between any room-temperature electronics and the cryogenic qubits, this article presents an integrated cryogenic solution for the bias-voltage generation and distribution for large-scale semiconductor spin-qubit quantum processors. A dedicated cryogenic CMOS (cryo-CMOS) demultiplexer and a cryo-CMOS dc digital-to-analog converter (DAC) have been developed in a 22-nm fin field-effect transistor process to control a codeveloped 2-D array designed with 648 single-hole transistors. Thanks to the dissipation below <inline-formula><tex-math>$120 ,mathrm{mu }mathrm{W}$</tex-math></inline-formula>, the whole system operates at temperatures below <inline-formula><tex-math>$70 ,mathrm{m}mathrm{K}$</tex-math></inline-formula> in a custom-built electrical/mechanical infrastructure embedded in a standard single-pulse-tube dilution refrigerator. The bias voltages generated by the cryo-CMOS DAC are demultiplexed to sample-and-hold structures, allowing to store 96 unique bias voltages over a <inline-formula><tex-math>$3 ,mathrm{V}$</tex-math></inline-formula> range with a voltage drift between <inline-formula><tex-math>$60 ,mathrm{mu }mathrm{V}/ mathrm{s}$</tex-math></inline-formula> and <inline-formula><tex-math>$18 ,mathrm{m}mathrm{V}/ mathrm{s}$</tex-math></inline-formula>. This work demonstrates a tight integration at <inline-formula><tex-math>$,mathrm{m}mathrm{K}$</tex-math></inline-formula> temperatures of cryo-CMOS bias generation and distribution with a dedicated large-scale quantum device. This showcases how this approach simplifies the wiring to the electronics, thus facilitating the scaling up of quantum processors toward the large number of qubits required for a practical quantum computer.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-18"},"PeriodicalIF":0.0,"publicationDate":"2025-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11037551","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144646673","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Improved Belief Propagation Decoding Algorithms for Surface Codes","authors":"Jiahan Chen;Zhengzhong Yi;Zhipeng Liang;Xuan Wang","doi":"10.1109/TQE.2025.3577769","DOIUrl":"https://doi.org/10.1109/TQE.2025.3577769","url":null,"abstract":"Quantum error correction is crucial for universal fault-tolerant quantum computing. Highly accurate and low-time-complexity decoding algorithms play an indispensable role in ensuring quantum error correction works effectively. Among existing decoding algorithms, belief propagation (BP) is notable for its nearly linear time complexity and general applicability to stabilizer codes. However, BP's decoding accuracy without postprocessing is unsatisfactory in most situations. This article focuses on improving the decoding accuracy of BP over GF(4) for surface codes. Inspired by machine learning optimization techniques, we first propose Momentum-BP and AdaGrad-BP to reduce oscillations in message updating, breaking the trapping sets of surface codes. We further propose exponential weighted average initialization belief propagation (EWAInit-BP), which adaptively updates initial probabilities and provides a one to three orders of magnitude improvement over traditional BP for planar surface code, toric code, and <inline-formula><tex-math>$XZZX$</tex-math></inline-formula> surface code without any postprocessing method, showing high decoding accuracy even under parallel scheduling. The theoretical <inline-formula><tex-math>$O(1)$</tex-math></inline-formula> time complexity under parallel implementation and high accuracy of EWAInit-BP make it a promising candidate for high-precision real-time decoders.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-16"},"PeriodicalIF":0.0,"publicationDate":"2025-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11027786","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144687710","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Runtime–Coherence Tradeoffs for Hybrid Satisfiability Solvers","authors":"Vahideh Eshaghian;Sören Wilkening;Johan Åberg;David Gross","doi":"10.1109/TQE.2025.3563805","DOIUrl":"https://doi.org/10.1109/TQE.2025.3563805","url":null,"abstract":"Many search-based quantum algorithms that achieve a theoretical speedup are not practically relevant since they require extraordinarily long coherence times, or lack the parallelizability of their classical counterparts. This raises the question of how to divide computational tasks into a collection of parallelizable subproblems, each of which can be solved by a quantum computer with limited coherence time. Here, we approach this question via hybrid algorithms for the <inline-formula><tex-math>$k$</tex-math></inline-formula>-satisfiability problem (k-SAT). Our analysis is based on Schöning's algorithm, which solves instances of <inline-formula><tex-math>$k$</tex-math></inline-formula>-SAT by performing random walks in the space of potential assignments. The search space of the walk allows for “natural” partitions, where we subject only one part of the partition to a Grover search, while the rest is sampled classically, thus resulting in a hybrid scheme. In this setting, we argue that there exists a simple tradeoff relation between the total runtime and the coherence time, which no such partition-based hybrid scheme can surpass. For several concrete choices of partitions, we explicitly determine the specific runtime coherence time relations and show saturation of the ideal tradeoff. Finally, we present numerical simulations, which suggest additional flexibility in implementing hybrid algorithms with the optimal tradeoff.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-22"},"PeriodicalIF":0.0,"publicationDate":"2025-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10974582","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144148131","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Quantum Direct-Sequence Spread-Spectrum CDMA Communication Systems: Mathematical Foundations","authors":"Mohammad Amir Dastgheib;Jawad A. Salehi;Mohammad Rezai","doi":"10.1109/TQE.2025.3560403","DOIUrl":"https://doi.org/10.1109/TQE.2025.3560403","url":null,"abstract":"This article describes the fundamental principles and mathematical foundations of quantum direct-sequence spread-spectrum code division multiple-access communication systems. The evolution of quantum signals through the quantum direct-sequence spread-spectrum multiple-access communication system is carefully characterized by a novel approach called the decomposition of creation operators. In this methodology, the creation operator of the transmitted quantum signal is decomposed into the chip-time interval creation operators, each of which is defined over the duration of a chip. These chip-time interval creation operators are the invariant building blocks of the spread-spectrum quantum communication systems. With the aid of the proposed chip-time decomposition approach, we can find closed-form relations for quantum signals at the receiver of such a quantum communication system. Furthermore, this article details the principles of narrowband filtering of quantum signals required at the receiver, a crucial step in designing and analyzing quantum communication systems. We show, that by employing coherent states as the transmitted quantum signals, the interuser interference appears as an additive term in the magnitude of the output coherent (Glauber) state, and the output of the quantum communication system is a pure quantum signal. On the other hand, if the transmitters utilize particle-like quantum signals (Fock states) such as single-photon states, the entanglement effect can arise at the receivers. The important techniques developed in this article are expected to have far-reaching implications for various applications in the exciting field of quantum communications and quantum signal processing.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-40"},"PeriodicalIF":0.0,"publicationDate":"2025-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10964196","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144072826","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A Comprehensive Cross-Model Framework for Benchmarking the Performance of Quantum Hamiltonian Simulations","authors":"Avimita Chatterjee;Sonny Rappaport;Anish Giri;Sonika Johri;Timothy Proctor;David E. Bernal Neira;Pratik Sathe;Thomas Lubinski","doi":"10.1109/TQE.2025.3558090","DOIUrl":"https://doi.org/10.1109/TQE.2025.3558090","url":null,"abstract":"Quantum Hamiltonian simulation is one of the most promising applications of quantum computing and forms the basis for many quantum algorithms. Benchmarking them is an important gauge of progress in quantum computing technology. We present a methodology and software framework to evaluate various facets of the performance of gate-based quantum computers on Trotterized quantum Hamiltonian evolution. We propose three distinct modes for benchmarking: 1) comparing simulation on a real device to that on a noiseless classical simulator; 2) comparing simulation on a real device with exact diagonalization results; and 3) using scalable mirror circuit techniques to assess hardware performance in scenarios beyond classical simulation methods. We demonstrate this framework on five Hamiltonian models from the HamLib library: the Fermi–Hubbard and Bose–Hubbard models, the transverse-field Ising model, the Heisenberg model, and the Max3SAT problem. Experiments were conducted using Qiskit's Aer simulator, BlueQubit's CPU cluster and GPU simulators, and IBM's quantum hardware. Our framework, extendable to other Hamiltonians, provides comprehensive performance profiles that reveal hardware and algorithmic limitations and measure both fidelity and execution times, identifying crossover points where quantum hardware outperforms CPU/GPU simulators.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-26"},"PeriodicalIF":0.0,"publicationDate":"2025-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10949677","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143896182","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}